Optimization of Vegetable Planting and Allocation

Xie Siqi; Chong Yangjing; Sun Wenyuan

doi:doi:10.11648/j.ijtam.20170302.15

| Peer-Reviewed

Optimization of Vegetable Planting and Allocation

Xie Siqi, Chong Yangjing, Sun Wenyuan

Published in International Journal of Theoretical and Applied Mathematics (Volume 3, Issue 2)

Received: 29 December 2016 Accepted: 12 January 2017 Published: 27 February 2017

Views: Downloads:

Download PDF

Share This Article

Twitter
Linked In
Facebook

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.

Published in	International Journal of Theoretical and Applied Mathematics (Volume 3, Issue 2)
DOI	10.11648/j.ijtam.20170302.15
Page(s)	77-81
Creative Commons	This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.
Copyright	Copyright © The Author(s), 2017. Published by Science Publishing Group

Keywords

Vegetable Planting, Transportation Scheme, Optimization Problem, Lingo Software

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.

Cite This Article

Plain Text BibTeX RIS

APA Style

Xie Siqi, Chong Yangjing, Sun Wenyuan. (2017). Optimization of Vegetable Planting and Allocation. International Journal of Theoretical and Applied Mathematics, 3(2), 77-81. https://doi.org/10.11648/j.ijtam.20170302.15

Copy | Download

ACS Style

Xie Siqi; Chong Yangjing; Sun Wenyuan. Optimization of Vegetable Planting and Allocation. Int. J. Theor. Appl. Math. 2017, 3(2), 77-81. doi: 10.11648/j.ijtam.20170302.15

Copy | Download

AMA Style

Xie Siqi, Chong Yangjing, Sun Wenyuan. Optimization of Vegetable Planting and Allocation. Int J Theor Appl Math. 2017;3(2):77-81. doi: 10.11648/j.ijtam.20170302.15

Copy | Download

@article{10.11648/j.ijtam.20170302.15,
  author = {Xie Siqi and Chong Yangjing and Sun Wenyuan},
  title = {Optimization of Vegetable Planting and Allocation},
  journal = {International Journal of Theoretical and Applied Mathematics},
  volume = {3},
  number = {2},
  pages = {77-81},
  doi = {10.11648/j.ijtam.20170302.15},
  url = {https://doi.org/10.11648/j.ijtam.20170302.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijtam.20170302.15},
  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.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Optimization of Vegetable Planting and Allocation
AU  - Xie Siqi
AU  - Chong Yangjing
AU  - Sun Wenyuan
Y1  - 2017/02/27
PY  - 2017
N1  - https://doi.org/10.11648/j.ijtam.20170302.15
DO  - 10.11648/j.ijtam.20170302.15
T2  - International Journal of Theoretical and Applied Mathematics
JF  - International Journal of Theoretical and Applied Mathematics
JO  - International Journal of Theoretical and Applied Mathematics
SP  - 77
EP  - 81
PB  - Science Publishing Group
SN  - 2575-5080
UR  - https://doi.org/10.11648/j.ijtam.20170302.15
AB  - 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.
VL  - 3
IS  - 2
ER  -

Copy | Download

Author Information

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

Download PDF

Sections

Plain Text BibTeX RIS

APA Style

Xie Siqi, Chong Yangjing, Sun Wenyuan. (2017). Optimization of Vegetable Planting and Allocation. International Journal of Theoretical and Applied Mathematics, 3(2), 77-81. https://doi.org/10.11648/j.ijtam.20170302.15

Copy | Download

ACS Style

Xie Siqi; Chong Yangjing; Sun Wenyuan. Optimization of Vegetable Planting and Allocation. Int. J. Theor. Appl. Math. 2017, 3(2), 77-81. doi: 10.11648/j.ijtam.20170302.15

Copy | Download

AMA Style

Xie Siqi, Chong Yangjing, Sun Wenyuan. Optimization of Vegetable Planting and Allocation. Int J Theor Appl Math. 2017;3(2):77-81. doi: 10.11648/j.ijtam.20170302.15

Copy | Download

@article{10.11648/j.ijtam.20170302.15,
  author = {Xie Siqi and Chong Yangjing and Sun Wenyuan},
  title = {Optimization of Vegetable Planting and Allocation},
  journal = {International Journal of Theoretical and Applied Mathematics},
  volume = {3},
  number = {2},
  pages = {77-81},
  doi = {10.11648/j.ijtam.20170302.15},
  url = {https://doi.org/10.11648/j.ijtam.20170302.15},
  eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ijtam.20170302.15},
  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.},
 year = {2017}
}

Copy | Download

TY  - JOUR
T1  - Optimization of Vegetable Planting and Allocation
AU  - Xie Siqi
AU  - Chong Yangjing
AU  - Sun Wenyuan
Y1  - 2017/02/27
PY  - 2017
N1  - https://doi.org/10.11648/j.ijtam.20170302.15
DO  - 10.11648/j.ijtam.20170302.15
T2  - International Journal of Theoretical and Applied Mathematics
JF  - International Journal of Theoretical and Applied Mathematics
JO  - International Journal of Theoretical and Applied Mathematics
SP  - 77
EP  - 81
PB  - Science Publishing Group
SN  - 2575-5080
UR  - https://doi.org/10.11648/j.ijtam.20170302.15
AB  - 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.
VL  - 3
IS  - 2
ER  -

Copy | Download