Optimization of minimum completion time MTSP based on the improved DE

  • Authors:

  • Huiren Zhou;Yinghui Wei

  • Affiliations:

  • Institute of Systems Engineering, Tianjin University, Tianjin, China;Department of Management, Liaoning Institute of Science and Technology, Benxi, China

  • Venue:
  • ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to solve traveling salesman problems that employed completion- time- shortest as the evaluating rule, an encoding method and improved differential evolution algorithm were proposed In these methods, real number encoding and roulette wheel selection were adopted for improved differential evolution and neighborhood search operator was devised It was fit for solving symmetric and asymmetric multiple traveling salesman problem Asymmetric multiple traveling salesman problems were simulated By comparison with the results of genetic algorithm and standard differential evolution, it is shown that the improved differential evolution algorithm proposed in this paper is efficient to solve the discrete combinatorial problem, such as optimization of multiple traveling salesman problems.