A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem

The fixed-charge transportation problem FCTP is a generalization of the transportation problem where an additional fixed cost is paid for sending a flow from an origin to a destination. We propose an iterated local search heuristic based on the utilization of reduced costs for guiding the restart phase. The reduced costs are obtained by applying a lower bounding procedure that computes a sequence of nondecreasing lower bounds by solving a three-index mathematical formulation of the problem strengthened with valid inequalities. The proposed method was tested on two sets of benchmark instances from the literature. The first set was used to evaluate the state-of-the-art heuristics for the problem; the proposed heuristic was able to provide new best-knownupper bounds on all 124 open instances. On the second set of instances, which was recently introduced for testing the currently best exact method for the problem, the new heuristic was able to provide provably good upper bounds within short computing times.

[1]  H. Kuhn,et al.  An approximative algorithm for the fixed‐charges transportation problem , 1962 .

[2]  Fred W. Glover,et al.  Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks , 2005, J. Heuristics.

[3]  Veena Adlakha,et al.  A SIMPLE HEURISTIC FOR SOLVING SMALL FIXED-CHARGE TRANSPORTATION PROBLEMS , 2003 .

[4]  C. B. Millham,et al.  The Optimal Location of Nuclear-Power Facilities in the Pacific Northwest , 1974, Oper. Res..

[5]  W. M. Hirsch,et al.  The fixed charge problem , 1968 .

[6]  Christoph Haehling von Lanzenauer,et al.  Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics , 1989 .

[7]  D. I. Steinberg,et al.  The fixed charge problem , 1970 .

[8]  Luís Gouveia,et al.  A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..

[9]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[10]  John William Stroup.  Letter to the Editor - Allocation of Launch Vehicles to Space Missions: A Fixed-Cost Transportation Problem , 1967, Oper. Res..

[11]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[12]  Luis Gouveia,et al.  Enhancing discretized formulations: the knapsack reformulation and the star reformulation , 2012 .

[13]  Christoph Haehling von Lanzenauer,et al.  COAL: a new heuristic approach for solving the fixed charge problem―computational results , 1991 .

[14]  Jesús Sáez Aguado.  Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems , 2009, Ann. Oper. Res..

[15]  Fred W. Glover,et al.  A New Optimization Method for Large Scale Fixed Charge Transportation Problems , 1981, Oper. Res..

[16]  Yash P. Aneja,et al.  Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron , 2012, Oper. Res..

[17]  Laurence A. Wolsey,et al.  Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems , 1993 .

[18]  Antonio Frangioni,et al.  0-1 Reformulations of the Multicommodity Capacitated Network Design Problem , 2009, Discret. Appl. Math..

[19]  Rashid M. Alhamali,et al.  A hybrid particle swarm algorithm with artificial immune learning for solving the fixed charge transportation problem , 2013, Comput. Ind. Eng..

[20]  M. W. Cooper,et al.  A branch and bound method for the fixed charge transportation problem , 1970 .

[21]  Roberto Roberti,et al.  The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation , 2015, Manag. Sci..

[22]  Reza Tavakkoli-Moghaddam,et al.  A genetic algorithm using priority-based encoding with new operators for fixed charge transportation problems , 2013, Appl. Soft Comput..

[23]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[24]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[25]  Katta G. Murty,et al.  Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..

[26]  A. Victor Cabot,et al.  Some branch‐and‐bound procedures for fixed‐cost transportation problems , 1984 .

[27]  Jesús Sáez Aguado,et al.  Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems , 2008 .

[28]  Minghe Sun,et al.  Tabu search applied to the general fixed charge problem , 1993, Ann. Oper. Res..

[29]  Francisco Saldanha-da-Gama,et al.  Discretized formulations for capacitated location problems with modular distribution costs , 2010, Eur. J. Oper. Res..

[30]  J. Kennington,et al.  A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem , 1976 .

[31]  Bruce W. Lamar,et al.  Revised-Modified Penalties for Fixed Charge Transportation Problems , 1997 .

[32]  M. Balinski.  Fixed‐cost transportation problems , 1961 .

[33]  Luís Gouveia,et al.  Solving the variable size bin packing problem with discretized formulations , 2008, Comput. Oper. Res..

[34]  Minghe Sun,et al.  A tabu search heuristic procedure for the fixed charge transportation problem , 1998, Eur. J. Oper. Res..

[35]  Palle Thoft-Christensen,et al.  The Branch-and-Bound Method , 1986 .

[36]  Yogesh K. Agarwal,et al.  k‐Partition‐based facets of the network design problem , 2006, Networks.

[37]  H. D. Ratliff,et al.  A branch-and-bound method for the fixed charge transportation problem , 1990 .

[38]  S. Selcuk Erenguc,et al.  Improved penalties for fixed cost linear programs using Lagrangean relaxation , 1986 .

[39]  Arie M. C. A. Koster,et al.  On cut‐based inequalities for capacitated network design polyhedra , 2011, Networks.

[40]  Paul Gray,et al.  Technical Note - Exact Solution of the Fixed-Charge Transportation Problem , 1971, Oper. Res..

[41]  W. Walker.  A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem , 1976 .

[42]  Paul S. Dwyer.  Use of completely reduced matrices in solving transportation problems with fixed charges , 1966 .

[43]  Torbjörn Larsson,et al.  A Set Covering Reformulation of the Pure Fixed Charge Transportation Problem , 1994, Discret. Appl. Math..

[44]  Bala Shetty,et al.  A relaxation/decomposition algorithm for the fixed charged network problem , 1990 .

[45]  Jack J. Dongarra,et al.  Performance of various computers using standard linear equations software in a FORTRAN environment , 1988, CARN.

[46]  Luís Gouveia,et al.  On the capacitated concentrator location problem: a reformulation by discretization , 2006, Comput. Oper. Res..

[47]  Ronald L. Rardin,et al.  Optimal Design of Regional Wastewater Systems: A Fixed-Charge Network Flow Model , 1978, Oper. Res..

[48]  Domingos M. Cardoso,et al.  The teacher assignment problem: A special case of the fixed charge transportation problem , 1997 .