Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems

Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 155)

Abstract

Though it is generally agreed that the term “Lagrangean relaxation” was first used by Geoffrion (1974), the use of this technique, either explicitly or implicitly (through special applications of Lagrangean relaxation ideas), precedes the work of Geoffrion by a number of years. For example, among others, Held and Karp (1970, 1971) used the concept in their successful algorithm for the traveling salesman problem.

Keywords

Transportation 

Notes

Acknowledgments

R. Galvão would like to thank his Ph.D. student Ormeu Coelho da Silva Junior for helping him with a detailed revision of the original manuscript.

References

  1. Baker BM, Sheasby J (1999) Accelerating the convergence of subgradient optimisation. Euro J Oper Res 117:136–144CrossRefGoogle Scholar
  2. Barceló J, Casanovas J (1984) A heuristic Lagrangean algorithm for the capacitated plant location problem. Euro J Oper Res 15:212–226CrossRefGoogle Scholar
  3. Bazaraa M, Sherali HD (1981) On the choice of step sizes in subgradient optimization. Euro J Oper Res 7:380–388CrossRefGoogle Scholar
  4. Beasley JE (1993) Lagrangean heuristics for location problems. Euro J Oper Res 65: 383–399CrossRefGoogle Scholar
  5. Bilde O, Krarup J (1967) Bestemmelse of optimal beliggenhed af produktionssteder. Research Report, IMSOR, Technical University of DenmarkGoogle Scholar
  6. Bilde O, Krarup J (1977) Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann Discrete Math 1:79–97CrossRefGoogle Scholar
  7. Boffey TB, Karkazis J (1984) p-medians and multi-medians. J Oper Res Soc 35:57–64Google Scholar
  8. Campbell JF (1994) Integer programming formulations of discrete hub location problems. Euro J Oper Res 72: 387–405CrossRefGoogle Scholar
  9. Cánovas L, García SE, Marín A (2006) Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Ann Oper Res 130: 163–178Google Scholar
  10. Chen B, Guignard M (1998) Polyhedral analysis and decompositions for capacitated plant location-type problems. Discrete Appl Math 82:79–91CrossRefGoogle Scholar
  11. Christofides N, Beasley JE (1982) A tree search algorithm for the p-median problem. Euro J Oper Res 10:196–204CrossRefGoogle Scholar
  12. Cortinhal MJ, Captivo ME (2003) Upper and lower bounds for the single source capacitated location problem. Euro J Oper Res 151:333–351CrossRefGoogle Scholar
  13. Diehr G (1972) An algorithm for the p-median problem. Working Paper No. 191, Western Management Science Institute, University of California, Los AngelesGoogle Scholar
  14. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26:992–1009CrossRefGoogle Scholar
  15. Espejo LGA, Galvão RD, Boffey B (2003) Dual-based heuristics for a hierarchical covering location problem. Comput Oper Res 30: 165–180CrossRefGoogle Scholar
  16. Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manage Sci 27:1–18CrossRefGoogle Scholar
  17. Galvão RD (1980) A dual-bounded algorithm for the p-median problem. Oper Res 28: 1112–1121CrossRefGoogle Scholar
  18. Galvão RD (1981) A note on Garfinkel, Neebe and Rao’s LP decomposition for the p-median problem. Transp Sci 15: 175–182CrossRefGoogle Scholar
  19. Galvão RD (1993) The use of Lagrangean relaxation in the solution of uncapacitated facility location problems. Location Sci 1:57–79Google Scholar
  20. Galvão RD, Raggi LA (1989) A method for solving to optimality uncapacitated location problems. Ann Oper Res 18:225–244CrossRefGoogle Scholar
  21. Galvão RD, Espejo LGA, Boffey B (2000) A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem. Eur J Oper Res 124: 377–389CrossRefGoogle Scholar
  22. Garfinkel RS, Neebe AW, Rao MR (1974) An algorithm for the m-median plant location problem. Transp Sci 8:217–236CrossRefGoogle Scholar
  23. Geoffrion AM (1974) Lagrangean relaxation for integer programming. Math Program Study 2: 82–114Google Scholar
  24. Guignard M (1988) A Lagrangean dual ascent algorithm for simple plant location problems. Eur J Oper Res 35: 193–200CrossRefGoogle Scholar
  25. Guignard M, Kim S (1987) Lagrangean decomposition for integer programming: theory and applications. RAIRO— Recherche Opérationnelle 21:307–323Google Scholar
  26. Hakimi SL (1964) Optimum locations of switching centers and the absolute centers and medians of a graph. Oper Res 12: 450–459CrossRefGoogle Scholar
  27. Hakimi SL (1965) Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper Res 13: 462–475CrossRefGoogle Scholar
  28. Hanjoul P, Peeters D (1985) A comparison of two dual-based procedures for solving the p-median problem. Eur J Oper Res 20:287–396CrossRefGoogle Scholar
  29. Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138–1162CrossRefGoogle Scholar
  30. Held M, Karp RM (1971) The traveling salesman problem and minimum spanning trees: part II. Math Program 1:6–25CrossRefGoogle Scholar
  31. Held M, Wolfe P, Crowder H (1974) Validation of subgradient optimization. Math Program 6: 62–88CrossRefGoogle Scholar
  32. Hogan WW, Marsten RE, Blakenship JW (1975) The boxstep method for large scale optimization. Oper Res 23:389–405CrossRefGoogle Scholar
  33. Karasakal O, Karasakal EK (2004) A maximal covering location model in the presence of partial coverage. Comput Oper Res 31:1515–1526CrossRefGoogle Scholar
  34. Karg RL, Thompson GL (1964) A heuristic approach to solving travelling salesman problems. Manage Sci 10: 225–248CrossRefGoogle Scholar
  35. Klincewicz JG (1996) A dual algorithm for the uncapacitated hub location problem. Location Sci 4: 173–184CrossRefGoogle Scholar
  36. Klincewicz JG, Luss H (1986) A Lagrangean relaxation heuristic for capacitated facility location with single-source constraints. J Oper Res Soc 37:495–500Google Scholar
  37. Körkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39: 157–173Google Scholar
  38. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9:643–666CrossRefGoogle Scholar
  39. Larsson T, Patriksson M, Strömberg A-B (1996) Conditional subgradient optimization: theory and applications. Eur J Oper Res 88: 382–403CrossRefGoogle Scholar
  40. Marsten RE (1972) An algorithm for finding almost all of the medians of a network. Discussion Paper No. 23, Northwestern University, Evanston, IllinoisGoogle Scholar
  41. Martello S, Toth P (1990) Knapsack problems: algorithms and computer implementations. Wiley, New YorkGoogle Scholar
  42. Mavrides LP (1979) An indirect method for the generalized k-median problem applied to lock box location. Manage Sci 25: 990–996CrossRefGoogle Scholar
  43. Mayer G, Wagner B (2002) Hub locator: an exact solution method for the multiple allocation hub location problem. Comput Oper Res 29:715–739CrossRefGoogle Scholar
  44. Mirchandani PB, Oudjit A, Wong RT (1985) ‘Multidimensional’ extensions and a nested dual approach for the m-median problem. Eur J Oper Res 21: 121–137CrossRefGoogle Scholar
  45. Narula SC, Ogbu UI, Samuelsson HM (1977) An algorithm for the p-median problem. Oper Res 25:709–713CrossRefGoogle Scholar
  46. Pirkul H (1987) Efficient algorithms for the capacitated concentrator location problem. Comput Oper Res 14: 197–208CrossRefGoogle Scholar
  47. Poljak BT (1967) A general method for solving extremum problems. Sov Math 8: 593–597Google Scholar
  48. Poljak BT (1969) Minimization of unsmooth functionals. U.S.S.R. Comput Math Math Phys 9: 1429Google Scholar
  49. Revelle CS, Marks D, Liebman JC (1970) An analysis of private and public sector location models. Manage Sci 16: 692–707CrossRefGoogle Scholar
  50. ReVelle CS, Swain RW (1970) Central facilities location. Geogr Anal 2:30–42CrossRefGoogle Scholar
  51. Sarin S, Karwan MH (1987) A computational evaluation of two subgradient search methods. Comput Oper Res 14:241–247CrossRefGoogle Scholar
  52. Senne ELF, Lorena LAN, Pereira MA (2005) A branch-and-price approach to p-median location problems. Comput Oper Res 32: 1655–1664CrossRefGoogle Scholar
  53. Shapiro JF (1979) A survey of Lagrangean techniques for discrete optimization. Ann Discrete Math 5:113–138CrossRefGoogle Scholar
  54. Sherali HD, Myers DC (1988) Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs. Discrete Appl Math 20:51–68CrossRefGoogle Scholar
  55. Sung CS, Jin HW (2001) Dual-based approach for a hub network design problem under non-restrictive policy. Eur J Oper Res 132:88–105CrossRefGoogle Scholar
  56. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16:955–961CrossRefGoogle Scholar
  57. Wen Y-F, Lin FY-S, Kuo W-C (2007) A tree-based energy-efficient algorithm for data-centric wireless sensor networks. Proceedings of the IEEE AINA, Ontario, Canada, May 21–23, 2007, Art. No. 4220895, 202–209Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Electrical EngineeringPontificia Universidad Católica de ChileSantiagoChile
  2. 2.COPPEFederal University of Rio de JaneiroRio de JaneiroBrazil

Personalised recommendations