Skip to main content

Advertisement

SpringerLink
Log in

Hybrid algorithms for the uncapacitated continuous location-allocation problem

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

In this paper, hybrid algorithms are developed for the multisource location-allocation problem in continuous space. Three hybrid algorithms are proposed to solve this problem that combine elements of several traditional metaheuristics (genetic algorithm and variable neighborhood search) and local searches to find near-optimal solutions. Many problems from the literature have been solved with these algorithms and the obtained results confirm the robustness of the proposed hybrid algorithms. Moreover, the results show that in comparison to the best methods in literature (GA and VNS), these algorithms provide some better solutions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Love RF, Morris JG, Wesolowsky GO (1988) Facilities location: models and methods. North-Holland, New York

    MATH  Google Scholar 

  2. Liu CM, Kao RL, Wang AH (1994) Solving location-allocation problems with rectilinear distances by simulated annealing. J Oper Res Soc 45:1304–1315

    Article  MATH  Google Scholar 

  3. Cooper L (1963) Location-allocation problem. Oper Res 11:331–343

    MATH  Google Scholar 

  4. Brimberg J, Salhi S (2005) A continuous location-allocation problem with zone-dependent fixed cost. Ann Oper Res 136:99–115

    Article  MATH  MathSciNet  Google Scholar 

  5. Kuenne RE, Soland RM (1972) Exact and approximate solutions to the multisource Weber problem. Math Program 3:193–209

    Article  MATH  MathSciNet  Google Scholar 

  6. Ostresh LM (1973) TWAIN––exact solutions to the two-source location-allocation problem. In: Rushton G, Goodchild MF, Ostresh LM (eds) Computer programs for location-allocation problems. Department of Geography, University of Iowa, Iowa City, pp 29–53

    Google Scholar 

  7. Chen PC et al (1992) Solution of the multisource Weber and conditional Weber problems by D.C. programming. GERAD Research Report. Montreal, Canada

  8. Hansen P, Jaumard B, Krau S (1998) A stabilized column generation algorithm for the multisource Weber problem. In: GERAD Research Report, GERAD Montreal, Canada

  9. Brimberg J et al (2000) Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem. Oper Res 48:444–460

    Article  Google Scholar 

  10. Cooper L (1964) Heuristic methods for location-allocation problems. SIAM Rev 6:37–53

    Article  MathSciNet  Google Scholar 

  11. Bongartez I, Calami PH (1994) A projection method for lp-norm location-allocation problem. Math Program 66:283–312

    Article  Google Scholar 

  12. Brimberg J, Mladenovic N (1996) Solving the continuous location-allocation problem with Tabu search. Stud Locat Anal 8:23–32

    MATH  MathSciNet  Google Scholar 

  13. Houck CR, Joines JA, Kay MG (1996) Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems. Eur J Oper Res 20:387–396

    Google Scholar 

  14. Salhi S, Gamal MDH (2003) A genetic algorithm based approach for the uncapacitated continuous location-allocation problem. Ann Oper Res 123:203–222

    Article  MATH  MathSciNet  Google Scholar 

  15. Merz P, Freisleben B (1999) A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem. In: Proceedings of the 1999 congress on evolutionary computation 3:1999–2070

  16. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper Res 16(5):955–961

    Article  MATH  Google Scholar 

  17. Resende GC, Werneck RF (2004) A fast swap-based local search procedure for location problems. AT&T Labs Research, Florham Park, NJ

    Google Scholar 

  18. Laurent M, Van Hentenryck P (1999) LOCALIZER: a modeling language for local search. INFORMS J Comput 11(1)

  19. Hansen P, Mladenovic N, Taillard ED (1998) Heuristic solution of the multisource Weber problem as a P-median problem. Oper Res Lett 22:55–62

    Article  MATH  MathSciNet  Google Scholar 

  20. Teodor Gabriel C et al (2004) Cooperative parallel variable neighborhood search for the P-median. J Heuristics 10:293–314

    Article  Google Scholar 

  21. Garcia F, Melen B, Moreno JA (2002) The parallel variable neighborhood search for the p-median problem. J Heuristics 8:375–388

    Article  MATH  Google Scholar 

  22. Doong S-H, Lai C-C, Wu C-H (2005) Genetic subgradient method for solving location-allocation problems. Appl Soft Comput DOI 10.1016/j.asoc.2005.06.008

  23. Merz P, Freisleben B (1999) Fitness landscapes and memetic algorithm design. In: Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, London, pp 245–260

    Google Scholar 

  24. Alegre JF et al (1999) Use of memetic algorithms to solve a stochastic location model: health resources for diabetics in some provinces of Castilla-León

  25. Reinelt G (1991) TSLIB-a traveling salesman library. ORSA J Comput 3:376–384

    MATH  Google Scholar 

  26. Karu S (1997) Extensions Du Problems de Weber

Download references

Author information

Authors and Affiliations

  1. Iran University of Science and Technology, Tehran, Iran

    Mohammad Saeed Jabalameli & Abdolsalam Ghaderi

Authors
  1. Mohammad Saeed Jabalameli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdolsalam Ghaderi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Abdolsalam Ghaderi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jabalameli, M.S., Ghaderi, A. Hybrid algorithms for the uncapacitated continuous location-allocation problem. Int J Adv Manuf Technol 37, 202–209 (2008). https://doi.org/10.1007/s00170-007-0944-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-0944-9

Keywords

Search

Navigation