An exact algorithm for the network pricing problem

This work focuses on an improved exact algorithm for addressing an NP-hard network pricing problem. The method involves an efficient and partial generation of candidate solutions, a recursive scheme for generating improved upper bounds, and a column generation procedure for solving the network-structured subproblems. Its efficiency is assessed against both randomly generated instances involving three distinct topologies as well as instances based on real life situations in telecommunication and freight transportation.

[1]  Martine Labbé,et al.  Joint Design and Pricing on a Network , 2008, Oper. Res..

[2]  Alexander Grigoriev,et al.  Pricing Network Edges to Cross a River , 2004, WAOA.

[3]  Martine Labbé,et al.  A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem , 2000, Transp. Sci..

[4]  G. Dobson,et al.  Heuristics for pricing and positioning a product-line using conjoint and cost data , 1993 .

[5]  Martine Labbé,et al.  A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network , 2000, Transp. Sci..

[6]  Robert E. Tarjan,et al.  7. Shortest Paths , 1983 .

[7]  P. Marcotte,et al.  A bilevel model of taxation and its application to optimal highway pricing , 1996 .

[8]  Patrice Marcotte,et al.  Path-based formulations of a bilevel toll setting problem , 2006 .

[9]  P. Marcotte,et al.  An approximation algorithm for Stackelberg network pricing , 2005 .

[10]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[11]  Géraldine Heilporn.  Network Pricing Problems: Complexity, polyhedral study and solution approaches , 2009 .

[12]  Martine Labbé,et al.  New formulations and valid inequalities for a bilevel pricing problem , 2008, Oper. Res. Lett..

[13]  Kenneth L. Schultz,et al.  Modeling and worker motivation in JIT production systems , 1998 .

[14]  Steven Fortune,et al.  Voronoi Diagrams and Delaunay Triangulations , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[16]  David Bernstein,et al.  The Holding Problem with Real - Time Information Available , 2001, Transp. Sci..