Archive
Special Issues
Optimization of Vegetable Planting and Allocation
International Journal of Theoretical and Applied Mathematics
Volume 3, Issue 2, April 2017, Pages: 77-81
Received: Dec. 29, 2016; Accepted: Jan. 12, 2017; Published: Feb. 27, 2017
Authors
Xie Siqi, Department of Mathematics, Yan Bian Univerdity, Yan Ji, China
Chong Yangjing, Department of Mathematics, Yan Bian Univerdity, Yan Ji, China
Sun Wenyuan, Department of Mathematics, Yan Bian Univerdity, Yan Ji, China
Article Tools
Abstract
In this paper, we aiming at question about vegetable planting. First we use the method of line segment superposition to calculate the minimum distance between 8 vegetable planting bases and 35 sales points’ and every route must through traffic junction. After we get the shortest distance, we change the conditions and establish the relationship between the planting base supply and the demand of each point of sale. According to the above relationship to write lingo program, and get optimal allocation scheme from direct allocation. Then we change the procedure and get the optimal allocation schemes between expanding the planting area and ensuring the vegetable species two circumstance.
Keywords
Vegetable Planting, Transportation Scheme, Optimization Problem, Lingo Software
Xie Siqi, Chong Yangjing, Sun Wenyuan, Optimization of Vegetable Planting and Allocation, International Journal of Theoretical and Applied Mathematics. Vol. 3, No. 2, 2017, pp. 77-81. doi: 10.11648/j.ijtam.20170302.15
References
[1]
Jiang Qiyuan, mathematical model, Beijing, higher education press, 2003
[2]
Diao Zaiyun, operational research, Beijing, higher education press, 2007.
[3]
Su Xiaohong, C language programming, Beijing, higher education press, 2013.
[4]
LIU Xiao-ke. Discussion on Vegetable Planting Problem Model in Vegetable Basket Project [J]. Journal of Science &, 2016, (3): 184-184. DOI: 10.3969/j.issn.1674-6813(z).2016.03.148.
[5]
Shao Xian. Financial Model Innovation of Agricultural Supply Chain - Taking Mawangdui Vegetable Wholesale Market as an Example [J]. Agricultural Economy, 2013, 34 (8): 62-68.
[6]
ZOU Gui-fang, ZHANG Pei-ai. Improved Floyd Algorithm for Shortest Path Problem in Network Optimization [J]. Science Technology and Engineering, 2011, 11 (28): 6875-6878, 6892. DOI: 10.3969/j.issn.1671-1815.2011.28.020.
[7]
Yijie Han. An O (n~3(log log n/log n)~(5/4)) Time Algorithm for All Pairs Shortest Path [J]. Algorithmica, 2008, 51 (4): 428-434.
[8]
The Floyd-Warshall algorithm on graphs with negative cycles [J]. Information processing letters, 2010, 110 (8/9): 279-.
[9]
DENG Ao. Study on Traffic Congestion and Accident Avoidance System Based on Genetic Algorithm and Ant Colony Algorithm [J]; Jiangsu University.
[10]
WANG Li. Application of Graph Theory in Algorithm Design [D]. Xidian University, 2010. DOI: 10.7666 / d.y1706742.
PUBLICATION SERVICES