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

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

0.00 Avg rating0 Votes
Article ID: iaor20031640
Country: Netherlands
Volume: 140
Issue: 3
Start Page Number: 606
End Page Number: 617
Publication Date: Aug 2002
Journal: European Journal of Operational Research
Authors: , , ,
Keywords: heuristics
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, 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.

Reviews

Required fields are marked *. Your email address will not be published.