Abstract

Multi-depot farmland food harvester routing problem with time windows is a variation of the farmland food harvester routing problem constrained by multi-depot and time windows, which is a typical NP-hard problem. Particle swarm optimization with a particle coding method is designed to solve the problem. The mathematic mode is established and the solution algorithm is developed. The simulation results of example indicate that the algorithm has faster search speed and stronger optimization ability than the genetic algorithm and ant colony algorithm.

Keywords:

Farmland food harvester, multi-depot, particle swarm optimization, route problem, time windows,

References

1. Chaos, I.M., B.L. Golden and E. Wasil, 1983. A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am. J. Math. Manage. Sci., 13: 371-406.
   
2. Clerc, M. and J. Kennedy, 2002. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE T. Evolut. Comput., 6: 58-73.
   CrossRef    
3. Dantzig, G. and J. Ramser, 1959. The truck dispatching problem. Manage. Sci., 6: 58-102.
   CrossRef    
4. Kennedy, J. and R. Eberhart, 1995. Particle swarm optimization. Proceeding of the IEEE International Conference on Neural Networks, pp: 1942-1948.
   CrossRef    
5. Meijun, C., Z. Zhisheng and C. Chunyong, 2008. A new type of ant colony clustering algorithm of multiple-depot vehicle routing problem. China's Manuf. Ind. Inform., 37: 1-5.
   
6. Salmen, A., I. Ahmad and S. Al-Madani, 2002. Particle swarm optimization for task assignment problem. Microprocess. Microsy., 26: 363-371.
   CrossRef    
7. Yuanbiao, Z. and L. Guangqing, 2007. The logistics distribution route optimization problem study based on hybrid particle swarm optimization. J. Packag. Eng., 28: 10-12.
   
8. Yuanfeng, Y., 2008. The improved genetic algorithm for multiple-depot multiple-vehicles vehicle routing problem. Comput. Moderniz., 9: 10-13.
   
9. Zhixiong, L., 2009. Logistics vehicle optimize scheduling research based on particle swarm algorithm. J. Wuhan Univ., Sci. Technol., 32: 615-618.
   

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.