Ye Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ye Liu has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Yazhuo Gao
Key Lab. of Process Optimization and Intelligent Decision-making of Ministry of Education, School of Management, Hefei Univ. of Lechnology, Hefei, 230009
1 shared publication - Zhiwei Ni
School of Management, Hefei University of Technology, Hefei 230009, China
1 shared publication
Latest Publications
- 9 September 2010
- Published by American Society of Civil Engineers (ASCE)
- p. 3173-3179
Application of Improved Genetic Algorithm in Optimization of Logistics Distribution Routing
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.
- 9 September 2010
- Published by American Society of Civil Engineers (ASCE)
- p. 3173-3179
Application of Improved Genetic Algorithm in Optimization of Logistics Distribution Routing
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.