Abstract

This study analyzes the principle and calculating steps of Particle Swarm Arithmetic first, then put forward improved Particle Swarm Arithmetic and states the steps of iteration calculation using improved Particle Swarm Arithmetic specifically. Based on it, in terms of the principles of the shortest transportation time and the cheapest transportation expenses, we establish the mathematical model of food logistics and combined with the real data and uses improved Particle Swarm Arithmetic to calculate, making an optimal decision in the end. Now the food logistics in our country is far from perfect and there are still lots of issues to be solved and much laws constructed, so as to developing food transportation in our country in a higher speed.

Keywords:

Food logistics, food transportation, particle swarm arithmetic,

References

1. Changjiang, X., 2007. The steel supply chain of forging stability-re-recognition of current relationship for steel and steel production. China's Steel Ind., 1: 33-35.
   
2. Krainyukov, A., V. Kutev and D. Opolchenov, 2010. Transport Telecommun., 11(4): 14-28.
   
3. Liu, H.H., C.H. Qu and J. Cheng, 2013. An improved genetic algorithm to solve traveling salesman problem. J. Beijing Inst. Technol., 12: 139-142.
   
4. Shi, Y.F. and W. Jinwei, 2009. Emergency logistics distribution model and algorithm research. Logist. Technol., 28(6): 80-112.
   
5. Thomas, M.U., 2002. Supply chain reliability for contingency operations. Proceeding of Annual Reliability and Maintainability Symposium, pp: 61-67.
   CrossRef    
6. Wei, W., W. Min, C. Xiao-Fang and G. Wei-Hua, 2003. Raw material stock optimization system based on multiple parallel genetic algorithm. Control Eng. China, 10(1): 33-37.
   
7. Xie, W., 2013. A hybrid particle swarm optimization algorithm in the application of TSP [J]. J. Taiyuan Univ., Technol., 7(1): 41-44.
   
8. Zhifeng, L., 2009. Food emergency logistics operation process. Logist. Eng. Manage., pp: 81-84.
   

Competing interests

The authors have no competing interests.

Open Access Policy

This article is 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, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.