Heuristics for the black and white traveling salesman problem

Authors:
Mélanie Bourgeois;Gilbert Laporte;Frédéric Semet
Affiliations:
Canada Research Chair in Distribution Managements, HEC-Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montreal, Canada;Canada Research Chair in Distribution Managements, HEC-Montréal, 3000 Chemin de la Côte-Sainte-Catherine, Montreal, Canada;Canada Research Chair in Distribution Managements, HEC-Montréal, Montreal, Canada and LAMIH, Université de Valenciennes et du Hainaut-Cambrésis, Le Mont Houy, Cedex, France
Venue:
Computers and Operations Research
Year:
2003

Citing 2
Cited 4

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
The Four-Day Aircraft Maintenance Routing Problem

Transportation Science

The Black and White Traveling Salesman Problem

Operations Research
Counting feasible solutions of the traveling salesman problem with pickups and deliveries is #P-complete

Discrete Applied Mathematics
Solving shortest path problems with a weight constraint and replenishment arcs

Computers and Operations Research
Approximation algorithms for the black and white traveling salesman problem

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.01

Visualization

Abstract

The black and white traveling salesman problem (BWTSP) is defined on a graph G whose vertex set is partitioned into black and white vertices. The aim is to design a shortest Hamiltonian tour on G subject to two constraints: both the number of white vertices as well as the length of the tour between two consecutive black vertices are bounded above. The BWTSP has applications in airline scheduling and in telecommunications. This article proposes and compares several heuristics for the BWTSP. Computational results are reported for instances involving up to 200 vertices.