A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
This paper discusses a new hybrid solution method for a bi-objective routing problem, namely the bi-objective ring star problem. The bi-objective ring star problem is a generalization of the ring star problem in which the assignment cost has been dissociated from the cost of visiting a subset of nodes. Here, we investigate the possible contribution of incorporating specialized TSP heuristics into a multiobjective evolutionary algorithm. Experiments show that the use of this hybridization scheme
doi:10.1007/978-3-540-88439-2_9
fatcat:6mpgef2xzjc75mjnnjfh4b2mri