The bi-objective covering tour problem

The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the covering tour problem, which means that the covering distance and the associated constraints have been replaced by a new objective. We propose a two-phase cooperative strategy that combines a multi-objective evolutionary algorithm with a branch-and-cut algorithm initially designed to solve a single-objective covering tour problem. Experiments were conducted using both randomly generated instances and real data. Optimal Pareto sets were determined using a bi-objective exact method based on an constraint approach with a branch-and-cut algorithm. ᭧ 2005 Elsevier Ltd. All rights reserved.

• Type: Journal
• Year: 2007
• Where: COR
• Authors: Nicolas Jozefowiez, Frédéric Semet, El-Ghazali Talbi
• Keywords: Bi-objective Routing Problem, Branch-and-cut Algorithm, COR 2007, Tour Problem