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

Chiung Moon, Jongsoo Kim, Gyunghyun Choi, Yoonho Seo

Research output: Contribution to journalArticle

140 Citations (Scopus)

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.

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

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'An efficient genetic algorithm for the traveling salesman problem with precedence constraints'. Together they form a unique fingerprint.

  • Cite this