LE QUY DON
Technical University
VietnameseClear Cookie - decide language by browser settings

New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem

Thanh, P.D. and Binh, H.T.T. and Lam, B.T. (2015) New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem. In: 6th International Conference on Knowledge and Systems Engineering, KSE 2014, 9 October 2014 through 11 October 2014.

Text
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem.pdf

Download (1MB) | Preview

Abstract

Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. In this paper, we propose two new crossover operators and new mechanism of combination crossover operators in genetic algorithm for solving TSP. We experimented on TSP instances from TSP-Lib and compared the results of proposed algorithm with genetic algorithm(GA), which used MSCX. Experimental results show that, our proposed algorithm is better than the GA using MSCX on the min, mean cost values. © Springer International Publishing Switzerland 2015.

Item Type: Conference or Workshop Item (Paper)
Divisions: Faculties > Faculty of Information Technology
Identification Number: 10.1007/978-3-319-11680-8_29
Uncontrolled Keywords: Algorithms; Systems engineering; Traveling salesman problem; Algorithm for solving; Cost values; Crossover operator; Modified Sequential Constructive Crossover; New mechanisms; Genetic algorithms
Additional Information: Conference code: 110309. Language of original document: English. All Open Access, Green.
URI: http://eprints.lqdtu.edu.vn/id/eprint/9969

Actions (login required)

View Item
View Item