The preemptive swapping problem on a tree

Authors:
Shoshana Anily;Michel Gendreau;Gilbert Laporte
Affiliations:
Faculty of Management, Tel-Aviv University, Tel-Aviv 69978, Israel;CIRRELT, Université de Montréal, C.P. 6128, succursale Centre-ville, Montreal, Quebec, Canada H3C 3J7;GERAD, CIRRELT, and Canada Research Chair in Distribution Management, HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine Montreal, Quebec, Canada H3T 2A7
Venue:
Networks
Year:
2011

Citing 0
Cited 4

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

Discrete Applied Mathematics
Models for the single-vehicle preemptive pickup and delivery problem

Journal of Combinatorial Optimization
A branch-and-cut algorithm for the preemptive swapping problem

Networks
The uncapacitated swapping problem on a line and on a circle

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article considers the swapping problem on a tree. In this problem at most one object of some type is available at each vertex, and each vertex also requests at most one object of a given type. The total demand and the total supply of each object type are identical. The problem is to determine a minimum cost routing plan starting and ending at a prespecified vertex which is the depot, for a single vehicle of unit capacity and m object types, so that all vertex requests are satisfied. We consider the preemptive mode in which objects may be temporarily dropped along the way. It is shown that this problem is NP-hard. A heuristic with a worst-case performance ratio of 1.5 is developed. Finally, it is shown that the case where m = 1 is polynomially solvable. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.