Location Theory and Distribution Management



This chapter deals with modeling problems related to both strategic-level decisions about the location for the fixed assets of a company such as plants, warehouses, retail stores, etc., as well as with modeling tactical and operational problems such as optimizing transportation costs a company is likely to face, especially in the manufacturing sector. Several algorithms are discussed for the models presented in this chapter that combines location with transportation issues precisely because one affects the other in very significant ways.


Greedy Randomize Adaptive Search Procedure Variable Neighborhood Search Vehicle Rout Problem Facility Location Problem Distribution Management 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. Aloise D, Desphande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Mach Learn 75(2): 245–248CrossRefGoogle Scholar
  2. Aloise D, Hansen P, Liberti L (2010) An improved column generation algorithm for minimum sum of squares clustering. Math Program Ser A, 20 April 2010, published online Google Scholar
  3. Beasley JE (1985) A note on solving large p-median problems. Eur J Oper Res, 21(2):270–273Google Scholar
  4. Bilgen B, Gunther H-O (2009) Integrated production and distribution planning in the fast moving consumer goods industry: a block planning application. OR Spectrum, 18 June. 2009, first published onlineGoogle Scholar
  5. Braysy O, Gendreau M (2002) Tabu Search heuristics for the vehicle routing problem with time windows. Top 10(2):211–237MathSciNetCrossRefGoogle Scholar
  6. Captivo EM (1991) Fast primal and dual heuristics for the p-median location problem. Eur J Oper Res, 52(1):65–74Google Scholar
  7. Christou IT (2011) Coordination of cluster ensembles via exact methods. IEEE Trans Pattern Anal Mach Intell 33(2):279–293Google Scholar
  8. Christou IT, Lagodimos AG, Lycopoulou D (2007) Hierarchical production planning for multi-product lines in the beverage industry. J Prod Plan Control 18(5):367–376CrossRefGoogle Scholar
  9. Cornuejols G, Fisher M, Nemhauser GL (1977) On the uncapacitated location problem. Ann Discret Math, 1:163–177Google Scholar
  10. Desrochers M, Soumis F (1988) A reoptimization algorithm for the shortest path problem with time windows. Eur J Oper Res, 35(2):242–254Google Scholar
  11. Desrochers M, Soumis F (1989) A column generation approach to the urban transit crew scheduling problem. Trans Sci 23(1):1–13MATHCrossRefGoogle Scholar
  12. Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time-windows. Oper Res 40(2):342–354 MathSciNetMATHCrossRefGoogle Scholar
  13. Desrosiers J, Soumis F, Desrochers M (1984) Routing with time-windows by column generation. Networks, 14(4):545–565Google Scholar
  14. Elloumi S, Labbe M, Pochet Y (2004) A new formulation and resolution method for the p-center problem. INFORMS J Comp 16(1):84–94MathSciNetCrossRefGoogle Scholar
  15. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Oper Res 26(6):992–1009 MathSciNetMATHCrossRefGoogle Scholar
  16. Ghiani G, Laporte G, Musmanno R (2004) Introduction to logistics systems planning and control. Wiley, ChicesterGoogle Scholar
  17. Ghosh D (2003) Neighborhood search heuristics for the uncapacitated facility location problem. Eur J Oper Res, 150:150–162Google Scholar
  18. Golden BL, Assad AA (1988) Vehicle routing: methods and studies. North-Holland, AmsterdamMATHGoogle Scholar
  19. Hansen P, Mladenovic N (1997) Variable neighborhood search for the p-median. Locat Sci 5(4):207–226 MATHCrossRefGoogle Scholar
  20. Hoefer M (2003) Experimental comparison of heuristic and approximation algorithms for uncapacitated facility location. Lect Notes Comput Sci, 2647Google Scholar
  21. Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems: part 2, the p-medians. SIAM J Appl Math, 37:539–560Google Scholar
  22. Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouse. Manag Sci, 9(4):643–666Google Scholar
  23. Laporte G (1988) Location-routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North-Holland, AmsterdamGoogle Scholar
  24. Love RF, Morris JG, Wesolowsky GO (1988) Facilities Location. North-Holland, AmsterdamMATHGoogle Scholar
  25. Maranzana FE (1964) On the location of supply points to minimize transportation costs. Operat Res Quart 15:261–270 Google Scholar
  26. Megiddo N, Supowit KJ (1984) On the complexity of some common geometric location problems. SIAM J Comput 13(1):182–196MathSciNetMATHGoogle Scholar
  27. Meyer RR (1992) Lecture notes on integer programming. Dept of Computer Sciences, University of WisconsinGoogle Scholar
  28. Moreno J, Rodrigez C, Jimenez N (1990) Heuristic cluster algorithm for multiple facility location-allocation problem. RAIRO Oper Res 25(1):97–107Google Scholar
  29. Pardalos PM, Pitsoulis LS (2000) Nonlinear assignment problems: algorithms and applications. Kluwer, DordrechtMATHGoogle Scholar
  30. Resende MGC, Werneck RF (2003) On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the 5th Workshop on algorithm engineering and experiments, pp. 119–127, SIAMGoogle Scholar
  31. Resende MGC, Werneck RF (2004) A hybrid heuristic for the p-median problem. J Heuristics 10(1):59–88MATHCrossRefGoogle Scholar
  32. Shi L, Meyer RR, Bozbay M, Miller AJ (2004) A nested partitions method for solving large-scale multi-commodity facility location problems. J Syst Sci Syst Eng 13(2):158–179 CrossRefGoogle Scholar
  33. Whitaker R (1983) A fast algorithm for the greedy interchange for large scale clustering and median location problems. INFOR, 21:95–108Google Scholar
  34. Wren A (1981) Computer scheduling of public transport urban passenger vehicle and crew scheduling. North-Holland, AmsterdamMATHGoogle Scholar
  35. Yunes TH, Moura AV, deSouza CC (2005) Hybrid column generation approaches for urban transit crew management problems. Transp Sci 39(2):273–288 CrossRefGoogle Scholar

Copyright information

© Springer-Verlag London Limited 2012

Authors and Affiliations

  1. 1.Athens Information TechnologyPaianiaGreece

Personalised recommendations