doi: 10.4304/jsw.6.4.612-619
Research on Heuristics Logistics Distribution Algorithm Based on Parallel Multi-ant Colonies
- 1 Guizhou University, Guizhou, China
- 2 Guizhou College of Finance and Economics, Guizhou, China
Abstract
Logistics distribution problem is an important part of the modern logistics system. Suppliers need to plan a route scheme for each customer in goods distribution, which is a multi-point to multi-point problem. It is NP-hard. Through analysis of characteristics of the existing logistics system, mathematical models are constructed, by introducing the order request and the return request with multiple suppliers. With these models, we present multivendor logistics distribution optimized algorithm and heuristic logistics distribution algorithm based on parallel multi-colonies. The first algorithm takes into account customer requests, make full use of vehicle loading and reasonably choose delivery route, so that transportation costs are lower, but the time cost is higher. The second algorithm add heuristic factor and introduce metrizable ratio, which get a faster convergence rate and higher-quality global optima. Simulation results show that both of the proposed algorithms can be adapted to this problem, but the heuristic logistics distribution algorithm based on parallel multi-colonies is more effective, which can keep balance between the time overhead and the best route.
Keywords
- logistics distribution problem
- delivery
How to Cite
Ruixue Tang, Yongbin Qin, and Li Zhang, "Research on Heuristics Logistics Distribution Algorithm Based on Parallel Multi-ant Colonies," Journal of Software, vol. 6, no. 4, pp. 612-619, 2011. https://doi.org/ 10.4304/jsw.6.4.612-619
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).