Pham, D.T. and Huynh, T.T.B. and Bui, T.L. (2013) A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem. In: 2013 International Conference on Soft Computing and Pattern Recognition, SoCPaR 2013, 15 December 2013 through 18 December 2013.
A survey on hybridizing genetic algorithm with dynamic programming for solving the traveling salesman problem.pdf
Download (509kB) | Preview
Abstract
Traveling Salesman Problem (TSP) is a well-known NP-hard problem. Many algorithms were developed to solve this problem and gave the nearly optimal solutions within reasonable time. This paper presents a survey about the combination Genetic Algorithm (GA) with Dynamic Programming (DP) for solving TSP. We also setup a combination between GA and DP for this problem and experimented on 7 Euclidean instances derived from TSP-lib. Experimental results are reported to show the efficiency of the experimented algorithm comparing to the genetic algorithm. © 2013 IEEE.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculties > Faculty of Information Technology |
| Identification Number: | 10.1109/SOCPAR.2013.7054102 |
| Uncontrolled Keywords: | Algorithms; Computational complexity; Genetic algorithms; Pattern recognition; Problem solving; Soft computing; Surveys; Traveling salesman problem; Bound algorithms; Combination genetic algorithm; Euclidean instances; Optimal solutions; Dynamic programming |
| Additional Information: | Conference code: 111424. Language of original document: English. |
| URI: | http://eprints.lqdtu.edu.vn/id/eprint/10070 |
Actions (login required)
- View Item