IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p91-10310.1023-a1018956213524.html
   My bibliography  Save this article

A tabu search approach to the uncapacitated facility location problem

Author

Listed:
  • K.S. Al‐Sultan
  • M.A. Al‐Fawzan

Abstract

In this paper, the uncapacitated facility location problem is considered. A tabu searchalgorithm for solving this problem is proposed. The algorithm is tested on some standardtest problems taken from literature and its performance is compared with the known optimalsolutions. Computational results show that the proposed algorithm produces optimal solutionsfor all test problems, and that it is very efficient in terms of time compared to existingalgorithms in the literature. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • K.S. Al‐Sultan & M.A. Al‐Fawzan, 1999. "A tabu search approach to the uncapacitated facility location problem," Annals of Operations Research, Springer, vol. 86(0), pages 91-103, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:91-103:10.1023/a:1018956213524
    DOI: 10.1023/A:1018956213524
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018956213524
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018956213524?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Martínez-Salazar, Iris Abril & Molina, Julian & Ángel-Bello, Francisco & Gómez, Trinidad & Caballero, Rafael, 2014. "Solving a bi-objective Transportation Location Routing Problem by metaheuristic algorithms," European Journal of Operational Research, Elsevier, vol. 234(1), pages 25-36.
    2. Ghosh, Diptesh, 2003. "Neighborhood search heuristics for the uncapacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 150(1), pages 150-162, October.
    3. Schweiger, Katharina & Sahamie, Ramin, 2013. "A hybrid Tabu Search approach for the design of a paper recycling network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 98-119.
    4. Fathali Firoozi, 2008. "Boundary Distributions in Testing Inequality Hypotheses," Working Papers 0046, College of Business, University of Texas at San Antonio.
    5. Mina Husseinzadeh Kashan & Ali Husseinzadeh Kashan & Nasim Nahavandi, 2013. "A novel differential evolution algorithm for binary optimization," Computational Optimization and Applications, Springer, vol. 55(2), pages 481-513, June.
    6. Drexl, Michael & Schneider, Michael, 2015. "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 283-308.
    7. Melo, M.T. & Nickel, S. & Saldanha-da-Gama, F., 2012. "A tabu search heuristic for redesigning a multi-echelon supply chain network over a planning horizon," International Journal of Production Economics, Elsevier, vol. 136(1), pages 218-230.
    8. Escobar, John Willmer & Linfati, Rodrigo & Baldoquin, Maria G. & Toth, Paolo, 2014. "A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 344-356.
    9. Ting, Ching-Jung & Chen, Chia-Ho, 2013. "A multiple ant colony optimization algorithm for the capacitated location routing problem," International Journal of Production Economics, Elsevier, vol. 141(1), pages 34-44.
    10. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2011. "A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery," European Journal of Operational Research, Elsevier, vol. 211(2), pages 318-332, June.
    11. Yi, Wei & Ozdamar, Linet, 2007. "A dynamic logistics coordination model for evacuation and support in disaster response activities," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1177-1193, June.
    12. Ahn, Jaemyung & de Weck, Olivier & Geng, Yue & Klabjan, Diego, 2012. "Column generation based heuristics for a generalized location routing problem with profits arising in space exploration," European Journal of Operational Research, Elsevier, vol. 223(1), pages 47-59.
    13. Prodhon, Caroline, 2011. "A hybrid evolutionary algorithm for the periodic location-routing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 204-212, April.
    14. Sumanta Basu & Ghosh, Diptesh, 2008. "A review of the Tabu Search Literature on Traveling Salesman Problems," IIMA Working Papers WP2008-10-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    15. Wasner, Michael & Zapfel, Gunther, 2004. "An integrated multi-depot hub-location vehicle routing model for network planning of parcel service," International Journal of Production Economics, Elsevier, vol. 90(3), pages 403-419, August.
    16. Dupont, Lionel, 2008. "Branch and bound algorithm for a facility location problem with concave site dependent costs," International Journal of Production Economics, Elsevier, vol. 112(1), pages 245-254, March.
    17. Lin, C.K.Y. & Kwok, R.C.W., 2006. "Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1833-1849, December.
    18. Prodhon, Caroline & Prins, Christian, 2014. "A survey of recent research on location-routing problems," European Journal of Operational Research, Elsevier, vol. 238(1), pages 1-17.
    19. Wang, Shaojun & Sarker, Bhaba R. & Mann, Lawrence & Triantaphyllou, Evangelos, 2004. "Resource planning and a depot location model for electric power restoration," European Journal of Operational Research, Elsevier, vol. 155(1), pages 22-43, May.
    20. Balakrishnan, Anantaram & Banciu, Mihai & Glowacka, Karolina & Mirchandani, Prakash, 2013. "Hierarchical approach for survivable network design," European Journal of Operational Research, Elsevier, vol. 225(2), pages 223-235.
    21. Drexl, M. & Schneider, M., 2014. "A Survey of the Standard Location-Routing Problem," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 65940, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:91-103:10.1023/a:1018956213524. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.