Heuristics for the mixed swapping problem

Authors:
Charles Bordenave;Michel Gendreau;Gilbert Laporte
Affiliations:
CIRRELT and Département d'informatique et de recherche opérationnelle, Université de Montréal, case postale 6128, succursale "Centre-ville", Montréal, Canada H3C 3J7;CIRRELT and Département d'informatique et de recherche opérationnelle, Université de Montréal, case postale 6128, succursale "Centre-ville", Montréal, Canada H3C 3J7;CIRRELT and Canada Research Chair in Distribution Management, HEC Montréal, 3000 chemin de la Côte-Sainte-Catherine, Montréal, Canada H3T 2A7
Venue:
Computers and Operations Research
Year:
2010

Citing 7
Cited 4

Efficient solutions to some transportation problems with applications to minimizing robot arm travel

SIAM Journal on Computing
Preemptive ensemble motion planning on a tree

SIAM Journal on Computing
Nonpreemptive ensemble motion planning on a tree

Journal of Algorithms
Approximating Capacitated Routing and Delivery Problems

SIAM Journal on Computing
The Swapping Problem on a Line

SIAM Journal on Computing
Heuristics for the mixed rural postman problem

Computers and Operations Research
Computing Minimum-Weight Perfect Matchings

INFORMS Journal on Computing

A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem

Discrete Applied Mathematics
A branch-and-cut algorithm for the preemptive swapping problem

Networks
Synchronization in Vehicle Routing---A Survey of VRPs with Multiple Synchronization Constraints

Transportation Science
The uncapacitated swapping problem on a line and on a circle

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

In the swapping problem, to each vertex of a complete directed graph are associated at most two object types representing its supply and demand. It is assumed that for each object type the total supply equals the total demand. A vehicle of unit capacity, starting and ending its route at an arbitrary vertex, is available to carry the objects along the arcs of the graph. The aim is to determine a minimum cost route such that each supply and demand is satisfied. When some of the object types are allowed to be temporarily unloaded at some intermediate vertices before being carried to their final destination, the problem is called the mixed swapping problem. In this paper we describe constructive and improvement heuristics which were successfully applied to randomly generated instances with up to 10,000 vertices, with an average optimality gap not exceeding 1%.