Logistics Distribution Routing Optimization Algorithm

Abstract:

Logistics distribution involves preparing goods in the distribution center or logistics node for most reasonable delivery according to the requirements of customers. Genetic algorithm is a random global search algorithm based on the principle of natural evolution. It can be a good solution to optimize the distribution routes. This paper combines genetic algorithm and the simulated annealing algorithm, to which memory device is added, in order to avoid best result losing in the crossover operator of the genetic algorithm. The experimental results show that a memory function with this genetic simulated annealing algorithm in solving the logistics distribution routing problem, can not only get a higher qualified solution, but can also significantly reduce the evolutionary generation that algorithm requires, and obtain solution to the problem in less time.

• Periodical: Applied Mechanics and Materials (Volumes 513-517)
• Pages: 1740-1743
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.513-517.1740
• Online since: February 2014
• Authors: Zhang Chun Hua*, Hua Xin, Zhang Wei
• Keywords: Genetic Algorithm (GA), Routing Optimization, Simulated Annealing Algorithm

References

[1] Lang Mao-hu Si ji, with mixed genetic algorithm logistics distribution routing problem research, China Management Science, (2002).

[2] LANG Mao-xiang, logistics vehicle scheduling problem model and algorithm, Beijing: Northern Jiaotong University, (2002).

[3] Zhou Yan-cong, Sun Xiao-chen. Logistics Distribution Routing Optimization Based on Genetic Algorithm. Computer Engineering and Science, 2012, 10(2).