Detailed Information
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
An efficient genetic algorithm for the traveling salesman problem with precedence constraints
- Authors
- Moon, CChiung; Kim,Jongsoo; Choi, Gyunghyun; Seo, Yoonho
- Issue Date
- Aug-2002
- Publisher
- ELSEVIER SCIENCE BV
- Keywords
- traveling salesman problem with precedence constraints; genetic algorithm; topological sort; optimization
- Citation
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.140, no.3, pp.606 - 617
- Indexed
- SCIE
SCOPUS
- Journal Title
- EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Volume
- 140
- Number
- 3
- Start Page
- 606
- End Page
- 617
- ISSN
- 0377-2217
- Abstract
- The traveling salesman problem with precedence constraints (TSPPC) is one of the most difficult combinatorial optimization problems. In this paper, an efficient genetic algorithm (GA) to solve the TSPPC is presented. The key concept of the proposed GA is a topological sort (TS), which is defined as an ordering of vertices in a directed graph, Also, a new crossover operation is developed for the proposed GA. The results of numerical experiments show that the proposed GA produces an optimal solution and shows superior performance compared to the traditional algorithms. (C) 2002 Elsevier Science B.V. All rights reserved.
- Files in This Item
- Go to Link
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.