The bi-objective covering tour problem

Authors:
Nicolas Jozefowiez;Frédéric Semet;El-Ghazali Talbi
Affiliations:
Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, 59655 Villeneuve d'Ascq Cedex, France;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;Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, 59655 Villeneuve d'Ascq Cedex, France
Venue:
Computers and Operations Research
Year:
2007

Citing 3
Cited 6

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
Multiobjective evolutionary algorithms: classifications, analyses, and new innovations

Multiobjective evolutionary algorithms: classifications, analyses, and new innovations
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation

On the Integration of a TSP Heuristic into an EA for the Bi-objective Ring Star Problem

HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
The bi-objective stochastic covering tour problem

Computers and Operations Research
An approximate ε-constraint method for the multi-objective undirected capacitated arc routing problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport

Applied Soft Computing
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

INFORMS Journal on Computing
A math-heuristic for the warehouse location-routing problem in disaster relief

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

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 @e-constraint approach with a branch-and-cut algorithm.