Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics

Abstract A new heuristic algorithm is presented for solving large general fixed charge problems based on Langrangian relaxation and cost allocation heuristics. Limited computational results indicate the new algorithm provides good solutions to large problems with reasonable computational requirements. It demonstrates significant improvement over current methods for solving large general fixed charge problems.

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

[2]  P. P. Kleutghen,et al.  Development and Implementation of an Integrated Inventory Management Program at Pfizer Pharmaceuticals , 1985 .

[3]  Leon Cooper,et al.  An approximate solution method for the fixed charge problem , 1967 .

[4]  M. Fisher.  Worst-Case Analysis of Heuristic Algorithms , 1980 .

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

[6]  Frederick S. Hillier,et al.  Introduction of Operations Research , 1967 .

[7]  James R. Evans,et al.  Heuristic “Optimization”: Why, When, and How to Use It , 1981 .

[8]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

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

[10]  L. R. Foulds,et al.  The Heuristic Problem-Solving Approach , 1983 .

[11]  Frederick S. Hillier.  Heuristics: A Gambler's Roll , 1983 .

[12]  Jean-Marc Rousseau.  A Cutting Plane Method for the Fixed Cost Problem. , 1975 .

[13]  Warren Walker,et al.  Development and Use of a Fixed Charge Programming Model for Regional Solid Waste Planning , 1974 .

[14]  D. de Werra,et al.  A tutorial on heuristic methods , 1980 .

[15]  Mary W. Cooper,et al.  An integer programming algorithm for portfolio selection with fixed charges , 1982 .

[16]  Marshall L. Fisher,et al.  An Applications Oriented Guide to Lagrangian Relaxation , 1985 .

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

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

[19]  Leon F. McGinnis,et al.  Invited reviewLocational analysis , 1983 .

[20]  P. McKeown.  A branch‐and‐bound algorithm for solving fixed charge problems , 1981 .

[21]  Don David Wright.  Cost Allocation Heuristics For Solving The Fixed Charge Problem , 1985 .

[22]  Glen L. Urban,et al.  Management Science in Marketing , 1970 .

[23]  Heiner Müller-Merbach,et al.  Heuristics and their design: a survey , 1981 .

[24]  S. Graves.  Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems , 1982 .