An efficient composite heuristic for the symmetric generalized traveling salesman problem

An efficient composite heuristic for the symmetric generalized traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor19993162
Country: Netherlands
Volume: 108
Issue: 3
Start Page Number: 571
End Page Number: 584
Publication Date: Aug 1998
Journal: European Journal of Operational Research
Authors: ,
Keywords: heuristics
Abstract:

The main purpose of this paper is to introduce a new comnposite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solution improvement phase. We show that the heuristic performs very well on 36 TSPLIB problems which have been solved to optimality by other researchers. We also propose some simple heuristics that can be used as basic blocks to construct more efficient composite heuristics.

Reviews

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