A Branch-and-Cut Algorithm for the Median-Path Problem

The Median-Path problem consists of locating a 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, Revelle and Cohon, 1989).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 Branch-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.

[1]  Jared L. Cohon,et al.  THE MEDIAN SHORTEST PATH PROBLEM : A MULTIOBJECTIVE APPROACH TO ANALYZE COST VS. ACCESSIBILITY IN THE DESIGN OF TRANSPORTATION NETWORKS , 1987 .

[2]  Edward Minieka,et al.  On Finding the Core of a Tree with a Specified Length , 1983, J. Algorithms.

[3]  Peter J. Slater,et al.  A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[4]  Michael B. Richey,et al.  Optimal location of a path or tree on a network with cycles , 1990, Networks.

[5]  Egon Balas,et al.  A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets , 1993, Math. Program..

[6]  Igor Vasil'ev,et al.  Computational study of large-scale p-Median problems , 2007, Math. Program..

[7]  Pasquale Avella,et al.  Logical reduction tests for the p‐problem , 1999, Ann. Oper. Res..

[8]  Edward Minieka.  The optimal location of a path or tree in a tree network , 1985, Networks.

[9]  Juan José Salazar González,et al.  The Median Cycle Problem , 2001 .

[10]  Gilbert Laporte,et al.  Path, Tree and Cycle Location , 1998 .

[11]  P. Slater.  Locating Central Paths in a Graph , 1982 .

[12]  Manfred W. Padberg.  Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[13]  Maurice Queyranne,et al.  Hamiltonian path and symmetric travelling salesman polytopes , 1993, Math. Program..

[14]  Martine Labbé,et al.  On locating path- or tree-shaped facilities on networks , 1993, Networks.

[15]  Antonio Sassano,et al.  On the p-Median polytope , 2001, Math. Program..

[16]  G. Ghiani,et al.  A multi-modal approach to the location of a rapid transit line , 1998 .

[17]  Frank Harary,et al.  Distance in graphs , 1990 .

[18]  Egon Balas,et al.  On the cycle polytope of a directed graph , 2000 .