Solving elementary shortest-path problems as mixed-integer programs

Authors:
Michael Drexl;Stefan Irnich
Affiliations:
Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, Germany and Fraunhofer Centre for Applied Research on Supply Chain Services (SCS) ...;Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University, Mainz, Germany
Venue:
OR Spectrum
Year:
2014

Citing 8
Cited 0

The vehicle routing problem

The vehicle routing problem
Traveling Salesman Problems with Profits

Transportation Science
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3

INFORMS Journal on Computing
Models for Evaluating and Planning City Logistics Systems

Transportation Science
Accelerated label setting algorithms for the elementary resource constrained shortest path problem

Operations Research Letters
Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints

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

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ibrahim et al. (Int Trans Oper Res 16:361---369, 2009) presented and analyzed two integer programming formulations for the elementary shortest-path problem (ESPP), which is known to be NP-hard if the underlying digraph contains negative cycles. In fact, the authors showed that a formulation based on multi-commodity flows possesses a significantly stronger LP relaxation than a formulation based on arc flow variables. Since the ESPP is essentially an integer problem, the contribution of our paper lies in extending this research by comparing the formulations with regard to the computation time and memory requirements required for their integer solution. Moreover, we assess the quality of the lower bounds provided by an integer relaxation of the multi-commodity flow formulation.