An efficient genetic algorithm for the traveling salesman problem with precedence constraints

Chiung Moon, Jongsoo Kim, Gyunghyun Choi, Yoon Ho Seo

Research output: Contribution to journalArticle

135 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)606-617
Number of pages12
JournalEuropean Journal of Operational Research
Issue number3
Publication statusPublished - 2002 Aug 1
Externally publishedYes



  • Genetic algorithm
  • Optimization
  • Topological sort
  • Traveling salesman problem with precedence constraints

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Applied Mathematics
  • Modelling and Simulation
  • Transportation

Cite this