A branch-and-cut algorithm for the preemptive swapping problem

Authors:
Charles Bordenave;Michel Gendreau;G. Laporte
Affiliations:
HEC Montréal and Département d'informatique et de recherche opérationnelle, Université de Montréal, case postale 6128, succursale “Centre-ville”, M ...;HEC Montréal and Département d'informatique et de recherche opérationnelle, Université de Montréal, case postale 6128, succursale “Centre-ville”, M ...;HEC Montréal and Département d'informatique et de recherche opérationnelle, Université de Montréal, case postale 6128, succursale “Centre-ville”, M ...
Venue:
Networks
Year:
2012

Citing 12
Cited 0

A new approach to the maximum-flow problem

Journal of the ACM (JACM)
A faster algorithm for finding the minimum cut in a graph

SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
Integer Programming Formulation of Traveling Salesman Problems

Journal of the ACM (JACM)
The Swapping Problem on a Line

SIAM Journal on Computing
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery

Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
The one-commodity pickup-and-delivery traveling salesman problem: Inequalities and algorithms

Networks
Heuristics for the mixed swapping problem

Computers and Operations Research
The preemptive swapping problem on a tree

Networks
Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determining a minimum cost route that allows the vehicle to satisfy every supply and demand. This article investigates the preemptive version of the SP in which the objects are allowed to be dropped at temporary locations along the route. The problem is modeled as a mixed integer linear program which is solved by branch-and-cut. Computational results on random geometric instances containing up to 100 vertices and eight object types are reported. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2012 Wiley Periodicals, Inc.