Application of Improved Genetic Algorithm in Optimization of Logistics Distribution Routing
- 9 September 2010
- conference paper
- Published by American Society of Civil Engineers (ASCE)
- p. 3173-3179
Abstract
The optimization of distribution routing is a key problem of logistics systems optimization, and can be considered as a traveling salesman problem (TSP). In this paper, the optimization of distribution routing is transformed into TSP, and dissimilar order crossover operator is proposed to improve the genetic algorithm (GA) to solve TSP. The improved crossover operator is based on natural representation, which makes the offspring inherit the excellent substrings of its parent and speeds up the convergence of GA. Simultaneously, steady state reproduction without duplicates is adopted to avoid prematurity. It is proved that the improved GA provides prominent performance for both TSP and asymmetric traveling salesman problem (ATSP), which will facilitate the optimization of distribution routing.Keywords
This publication has 5 references indexed in Scilit:
- Two new robust genetic algorithms for the flowshop scheduling problemOmega, 2006
- Study on a New Heuristic Crossover for the Traveling Salesman Problem2006
- Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and OperatorsArtificial Intelligence Review, 1999
- Genetic algorithms and traveling salesman problemsEuropean Journal of Operational Research, 1996
- Genetic algorithms for the traveling salesman problemAnnals of Operations Research, 1996