The bi-objective covering tour problem |
| |
Authors: | Nicolas Jozefowiez Frédéric Semet El-Ghazali Talbi |
| |
Affiliation: | 1. Laboratoire d’Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, 59655 Villeneuve d’Ascq Cedex, France;2. Laboratoire d’Automatique, de Mécanique et d’Informatique Industrielles et Humaines, Université de Valenciennes et du Hainaut-Cambrésis, 59313 Valenciennes Cedex 9, France |
| |
Abstract: | 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. |
| |
Keywords: | Routing Multi-objective optimization Cooperative approach |
本文献已被 ScienceDirect 等数据库收录! |