A branch-and-cut algorithm for the median-path problem

A branch-and-cut algorithm for the median-path problem

0.00 Avg rating0 Votes
Article ID: iaor2006593
Country: United Kingdom
Volume: 32
Issue: 3
Start Page Number: 215
End Page Number: 230
Publication Date: Dec 2005
Journal: Computational Optimization and Applications
Authors: , , ,
Keywords: programming: travelling salesman
Abstract:

The Median-Path problem consists of locating an st-path on a network, minimizing a function of two parameters: accessibility to the path and total cost of the path. Applications of this problem can be found in transportation planning, water resource management and fluid transportation. A problem formulation based on Subtour and Variable Upper Bound (VUB) inequalities was proposed in the seminal paper by Current et al. In this paper we introduce a tighter formulation, based on a new family of valid inequalities, named Lifted Subtour inequalities, that are proved to be facet-defining. For the class of Lifted Subtour inequalities we propose a polynomial separation algorithm. Then we introduce more families of valid inequalities derived by investigating the relation to the Asymmetric Traveling Salesman Problem (ATSP) polytope and to the Stable Set polytope. These results are used to develop a Barnch-and-Cut algorithm that enables us to solve to optimality small and medium size instances in less than 2 hours of CPU time on a workstation.

Reviews

Required fields are marked *. Your email address will not be published.