IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v116y1999i1p51-68.html
   My bibliography  Save this article

A repeated matching heuristic for the single-source capacitated facility location problem

Author

Listed:
  • Ronnqvist, Mikael
  • Tragantalerngsak, Suda
  • Holt, John

Abstract

No abstract is available for this item.

Suggested Citation

  • Ronnqvist, Mikael & Tragantalerngsak, Suda & Holt, John, 1999. "A repeated matching heuristic for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 51-68, July.
    • Handle: RePEc:eee:ejores:v:116:y:1999:i:1:p:51-68
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(98)00045-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. John G. Klincewicz & Hanan Luss & Martha G. Pilcher, 1990. "Fleet Size Planning when Outside Carrier Services Are Available," Transportation Science, INFORMS, vol. 24(3), pages 169-182, August.
    2. Wark, Peter & Holt, John & Ronnqvist, Mikael & Ryan, David, 1997. "Aircrew schedule generation using repeated matching," European Journal of Operational Research, Elsevier, vol. 102(1), pages 21-35, October.
    3. Donald Erlenkotter, 1978. "A Dual-Based Procedure for Uncapacitated Facility Location," Operations Research, INFORMS, vol. 26(6), pages 992-1009, December.
    4. Sridharan, R., 1986. "A heuristic Lagrangean algorithm for the capacitated plant location problem -- A comment," European Journal of Operational Research, Elsevier, vol. 23(2), pages 264-265, February.
    5. Barcelo, J. & Casanovas, J., 1984. "A heuristic lagrangean algorithm for the capacitated plant location problem," European Journal of Operational Research, Elsevier, vol. 15(2), pages 212-226, February.
    6. Beasley, J. E., 1993. "Lagrangean heuristics for location problems," European Journal of Operational Research, Elsevier, vol. 65(3), pages 383-399, March.
    7. Kemal Altinkemer & Bezalel Gavish, 1991. "Parallel Savings Based Heuristics for the Delivery Problem," Operations Research, INFORMS, vol. 39(3), pages 456-469, June.
    8. Sridharan, R., 1993. "A Lagrangian heuristic for the capacitated plant location problem with single source constraints," European Journal of Operational Research, Elsevier, vol. 66(3), pages 305-312, May.
    9. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Boffey, Brian & Galvao, Roberto & Espejo, Luis, 2007. "A review of congestion models in the location of facilities with immobile servers," European Journal of Operational Research, Elsevier, vol. 178(3), pages 643-662, May.
    2. Guastaroba, G. & Speranza, M.G., 2014. "A heuristic for BILP problems: The Single Source Capacitated Facility Location Problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 438-450.
    3. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    4. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    5. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    6. Eveborn, Patrik & Flisberg, Patrik & Ronnqvist, Mikael, 2006. "Laps Care--an operational system for staff planning of home care," European Journal of Operational Research, Elsevier, vol. 171(3), pages 962-976, June.
    7. Dong, Zhijie & Turnquist, Mark A., 2015. "Combining service frequency and vehicle routing for managing supplier shipments," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 231-243.
    8. 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.
    9. Mohammad Nezhad, Ali & Manzour, Hasan & Salhi, Said, 2013. "Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 713-723.
    10. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    11. van der Gaast, J.P. & Rietveld, C.A. & Gabor, A.F. & Zhang, Y., 2011. "A Local Search Algorithm for Clustering in Software as a Service Networks," ERIM Report Series Research in Management ERS-2011-004-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    12. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Holmberg, Kaj & Ronnqvist, Mikael & Yuan, Di, 1999. "An exact algorithm for the capacitated facility location problems with single sourcing," European Journal of Operational Research, Elsevier, vol. 113(3), pages 544-559, March.
    2. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 1997. "Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 102(3), pages 611-625, November.
    3. Drexl, Andreas & Klose, Andreas, 2001. "Facility location models for distribution system design," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 546, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Cortinhal, Maria Joao & Captivo, Maria Eugenia, 2003. "Upper and lower bounds for the single source capacitated location problem," European Journal of Operational Research, Elsevier, vol. 151(2), pages 333-351, December.
    5. Klose, Andreas & Drexl, Andreas, 2005. "Facility location models for distribution system design," European Journal of Operational Research, Elsevier, vol. 162(1), pages 4-29, April.
    6. Klose, Andreas, 2000. "A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 126(2), pages 408-421, October.
    7. Samir Elhedhli & Jean-Louis Goffin, 2005. "Efficient Production-Distribution System Design," Management Science, INFORMS, vol. 51(7), pages 1151-1164, July.
    8. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    9. Iván Contreras & Juan Díaz, 2008. "Scatter search for the single source capacitated facility location problem," Annals of Operations Research, Springer, vol. 157(1), pages 73-89, January.
    10. Bülent Çatay & Ş. Selçuk Erengüç & Asoo J. Vakharia, 2005. "Capacity allocation with machine duplication in semiconductor manufacturing," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(7), pages 659-667, October.
    11. Torbjörn Larsson & Nils-Hassan Quttineh & Ida Åkerholm, 2024. "A Lagrangian bounding and heuristic principle for bi-objective discrete optimization," Operational Research, Springer, vol. 24(2), pages 1-34, June.
    12. Yang, Zhen & Chu, Feng & Chen, Haoxun, 2012. "A cut-and-solve based algorithm for the single-source capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 221(3), pages 521-532.
    13. R. K. Ahuja & J. B. Orlin & S. Pallottino & M. P. Scaparra & M. G. Scutellà, 2004. "A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem," Management Science, INFORMS, vol. 50(6), pages 749-760, June.
    14. 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.
    15. Mohammad Nezhad, Ali & Manzour, Hasan & Salhi, Said, 2013. "Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem," International Journal of Production Economics, Elsevier, vol. 145(2), pages 713-723.
    16. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "An improved cut-and-solve algorithm for the single-source capacitated facility location problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 1-27, March.
    17. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    18. 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.
    19. Klose, Andreas & Gortz, Simon, 2007. "A branch-and-price algorithm for the capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1109-1125, June.
    20. Monabbati, Ehsan & Kakhki, Hossein Taghizadeh, 2015. "On a class of subadditive duals for the uncapacitated facility location problem," Applied Mathematics and Computation, Elsevier, vol. 251(C), pages 118-131.

    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:eee:ejores:v:116:y:1999:i:1:p:51-68. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.