Advertisement

Warehouse Location Problem

  • Zeinab Bagherpoor
  • Shaghayegh Parhizi
  • Mahtab Hoseininia
  • Nooshin Heidari
  • Reza Ghasemi Yaghin
Chapter
Part of the Contributions to Management Science book series (MANAGEMENT SC.)

Abstract

Finding the optimal location for industrial facilities has always been of a crucial importance and priority from geographers’ and economists’ view point. Although economics play the main role in presenting location theories by resorting to its theories, geographers, with their focus on locative and spatial changes leading to natural phenomenon, have also had a share in complimenting these location theories and finding optimal points to locate industrial activities location. From this point of view, materials, market and other manufacturing factors have not been concentrated in one point, and their spatial separation necessitates traveling distances which, in turn, brings about costs. That is why optimal industrial location is also a part of geographical studies.

Keywords

Transportation Cost Lagrangian Relaxation Unit Production Cost Meta Heuristic Method Warehouse Location 
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.

References

  1. Akinc U, Khumawala BM (1977) An efficient branch and bound algorithm for the capacitated warehouse location problem. Manage Sci 23(6):585–594CrossRefGoogle Scholar
  2. Alves ML, Almedia MT (1992) Simulated annealing algorithm for simple plant location problems. Revista Investigacao Operationanl 12Google Scholar
  3. Al-Sultan KS, Al-Fawzan MA (1999) A tabu search approach to the uncapacitated facility location problem Ann Oper Res 86:91–103Google Scholar
  4. Baker BM (1986) A partial dual algorithm for the capacitated warehouse location problem. Eur J Oper Res 23:48–56CrossRefGoogle Scholar
  5. Baker BM, Sheasby J (1999) Accelerating the convergence of subgradient optimization. Eur J Oper Res 117:136–144CrossRefGoogle Scholar
  6. Beasley JE (1988) An algorithm for solving large capacitated warehouse location problems. Eur J Oper Res 33:314–323CrossRefGoogle Scholar
  7. Christofides N, Beasley JE (1983) Extensions to a Lagrangian relaxation approach for the capacitated warehouse location problem. Eur J Oper Res 12:19–28CrossRefGoogle Scholar
  8. Dupont L (2008) Branch and bound algorithm for a facility location problem with concave site dependent costs. International Journal of Production Economics 112(1):245–254Google Scholar
  9. Erlenkotter D (1978) A dual-based procedure for uncapacitated facility location. Eur J Oper Res 26(6):992–1009CrossRefGoogle Scholar
  10. Geoffrion AM, Graves GV (1974) Multicommodity distribution system design by benders decomposition. Manage Sci 20(5):882–844Google Scholar
  11. Geoffrion AM, Nauss R (1977) Parametric and postoptimality analysis in integer linear programming. Manage Sci 23(5):453–466CrossRefGoogle Scholar
  12. Heras F, Larrosa J (2006) Intelligent variable orderings and re-orderingsin DAC-based solvers for WCSP. J Heuristics 12:287–306CrossRefGoogle Scholar
  13. Kelly DL, Marucheck AS (1984) Planning horizon results for the dynamic warehouse location problem. J Oper Manage 4(3):279–294CrossRefGoogle Scholar
  14. Khumawala BM (1972) An efficient branch and bound algorithm for the warehouse location problem. Manage Sci 18(12):585–594CrossRefGoogle Scholar
  15. Korkel M (1989) On the exact solution of large-scale simple plant location problems. Eur J Oper Res 39:157–173CrossRefGoogle Scholar
  16. Kratica J, Tosic D, Filipovic V, Ljubic I (2001) Solving the simple plant location problem by genetic algorithm. Oper Res 35:127–142CrossRefGoogle Scholar
  17. Kuehn A, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9:643–666CrossRefGoogle Scholar
  18. Lee CY (1993) The multi product warehouse location problem: Applying a decomposition algorithm. Int J Phys Distrib Logist Manage 23(6):3–13CrossRefGoogle Scholar
  19. Lee CY (1996) An algorithm for a two-staged distribution system with various types of distribution centers. INFOR 34(2):105–117Google Scholar
  20. Melachrinoudis E, Min H (2007) Redesigning a warehouse network. Eur J Oper Res 176:210–229CrossRefGoogle Scholar
  21. Michel L, Hentenryck PV (2004) A simple tabu search for warehouse location. Eur J Oper Res 157:576–591CrossRefGoogle Scholar
  22. Nagy T (2004), Warehouse location problem. Available online at http://www.freehackers.org
  23. Nuass RM (1978) An improved algorithm for the capacitated facility location problem. J Oper Res Soc 29(12):1195–1201Google Scholar
  24. Sharma RRK, Berry V (2007) Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): Empirical investigation for assessing; relative strengths and computational effort. Eur J Oper Res 177:803–812CrossRefGoogle Scholar
  25. Sweeny DJ, Tatham RL (1976) An improved long-run model for multiple warehouse location. Manage Sci 7:748–758CrossRefGoogle Scholar
  26. Tompkins JA, White JA, Bozer YA, Frazelle EH, Tanchoco JMA, Trevino J (1996) Facility planning, 2nd ed. Wiley, New YorkGoogle Scholar
  27. Wan YW, Raymond K, Cheung, Liu J, Judy H, Tong (1998) Warehouse location problems for air freight forwarders: A challenge created by the airport relocation. J Air Transport Manage 4:201–207Google Scholar
  28. Whitaker RA (1985) Some add-drop and drop-add interchange heuristics for non-linear warehouse location. J Oper Res Soc 36:61–70Google Scholar
  29. William J, Baumol, Wolfe P (1958) A warehouse-location problem. Oper Res 6:252–263Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Zeinab Bagherpoor
    • 1
  • Shaghayegh Parhizi
    • 1
  • Mahtab Hoseininia
    • 1
  • Nooshin Heidari
    • 1
  • Reza Ghasemi Yaghin
    • 1
  1. 1.Department of Industrial EngineeringAmirkabir University of TechnologyTehranIran

Personalised recommendations