IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v48y2000i5p671-685.html
   My bibliography  Save this article

The Uncapacitated Facility Location Problem with Client Matching

Author

Listed:
  • Éric Gourdin

    (SMG and ISRO, Université Libre de Bruxelles, Boulevard du Triomphe, CP210/01, B-1050 Brussels, Belgium)

  • Martine Labbé

    (SMG and ISRO, Université Libre de Bruxelles, Boulevard du Triomphe, CP210/01, B-1050 Brussels, Belgium)

  • Gilbert Laporte

    (Centre de Recherche sur les Transports, Université de Montréal, Case Postale 6128, Succursale “Centre-ville,” Montreal, Canada H3C 3J7)

Abstract

The Uncapacitated Facility Location Problem with Client Matching (LCM) is an extension of the Uncapacitated Facility Location Problem (UFLP), where two clients allocated to a facility can be matched. As in the UFLP, facilities can be opened at any of m predefined locations with given fixed costs, and n clients have to be allocated to the open facilities. In classical location models, the allocation cost is the distance between a client and an open facility. In the LCM, the allocation cost is either the cost of a return trip between the facility and the client, or the length of a tour containing the facility and two clients. The similarities of the LCM with the classical UFLP and the matching problem are exploited to derive valid inequalities, optimality cuts, and polyhedral results. A greedy heuristic and a branch-and-cut algorithm are developed, and several separation procedures are described. Computational experiments confirm the efficiency of the proposed approach.

Suggested Citation

  • Éric Gourdin & Martine Labbé & Gilbert Laporte, 2000. "The Uncapacitated Facility Location Problem with Client Matching," Operations Research, INFORMS, vol. 48(5), pages 671-685, October.
  • Handle: RePEc:inm:oropre:v:48:y:2000:i:5:p:671-685
    DOI: 10.1287/opre.48.5.671.12410
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.48.5.671.12410
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.48.5.671.12410?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
    ---><---

    References listed on IDEAS

    as
    1. Current, John & Weber, Charles, 1994. "Application of facility location modeling constructs to vendor selection problems," European Journal of Operational Research, Elsevier, vol. 76(3), pages 387-392, August.
    2. Labbé, M. & Peeters, D. & Thisse, J.-F., 1995. "Location on Network. Network Routing," LIDAM Reprints CORE 1182, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    3. labbe, M. & Peeters, D. & Thisse, J.F., 1992. "Location on Networks," Papers 9216, Universite Libre de Bruxelles - C.E.M.E..
    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. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    2. Huang, Sen & Liu, Kanglin & Zhang, Zhi-Hai, 2023. "Column-and-constraint-generation-based approach to a robust reverse logistic network design for bike sharing," Transportation Research Part B: Methodological, Elsevier, vol. 173(C), pages 90-118.
    3. Amiri, Ali, 2006. "Designing a distribution network in a supply chain system: Formulation and efficient solution procedure," European Journal of Operational Research, Elsevier, vol. 171(2), pages 567-576, June.
    4. 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.
    5. Bahman Naderi & Kannan Govindan & Hamed Soleimani, 2020. "A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network," Annals of Operations Research, Springer, vol. 291(1), pages 685-705, August.
    6. Sheu, Jiuh Biing & Kundu, Tanmoy, 2018. "Forecasting time-varying logistics distribution flows in the One Belt-One Road strategic context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 117(C), pages 5-22.
    7. C. Archetti & R. Mansini & M. G. Speranza, 2005. "Complexity and Reducibility of the Skip Delivery Problem," Transportation Science, INFORMS, vol. 39(2), pages 182-187, May.
    8. F J Vasko & D D Newhart & K L Stott & F E Wolf, 2003. "A large-scale application of the partial coverage uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(1), pages 11-20, January.
    9. 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.
    10. 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.

    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. de Palma, André & Lindsey, Robin, 2001. "Optimal timetables for public transportation," Transportation Research Part B: Methodological, Elsevier, vol. 35(8), pages 789-813, September.
    2. J Brimberg & P Hansen & G Laporte & N Mladenović & D Urošević, 2008. "The maximum return-on-investment plant location problem with market share," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 399-406, March.
    3. Jacques-Francois Thisse, 2014. "The New Science of Cities by Michael Batty: The Opinion of an Economist," Journal of Economic Literature, American Economic Association, vol. 52(3), pages 805-819, September.
    4. C. Arbib & F. Marinelli, 2009. "Exact and Asymptotically Exact Solutions for a Class of Assortment Problems," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 13-25, February.
    5. Eiselt, H. A. & Laporte, Gilbert, 1997. "Sequential location problems," European Journal of Operational Research, Elsevier, vol. 96(2), pages 217-231, January.
    6. Sáez-Aguado, Jesús & Trandafir, Paula Camelia, 2012. "Some heuristic methods for solving p-median problems with a coverage constraint," European Journal of Operational Research, Elsevier, vol. 220(2), pages 320-327.
    7. Rath, Kali P. & Zhao, Gongyun, 2001. "Two stage equilibrium and product choice with elastic demand," International Journal of Industrial Organization, Elsevier, vol. 19(9), pages 1441-1455, November.
    8. Peitz, Martin, 1997. "Models a la Lancaster and a la Hotelling: when they are the same," Economics Letters, Elsevier, vol. 54(2), pages 147-154, February.
    9. Marti­n, Juan Carlos & Román, Concepción, 2003. "Hub location in the South-Atlantic airline market: A spatial competition game," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(10), pages 865-888, December.
    10. V.I. Norkin & G.C. Pflug & A. Ruszczynski, 1996. "A Branch and Bound Method for Stochastic Global Optimization," Working Papers wp96065, International Institute for Applied Systems Analysis.
    11. Mulder, H.M. & Novick, B., 2011. "A simple axiomatization of the median procedure on median graphs," Econometric Institute Research Papers EI2011-25, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    12. Dominique Peeters & Jacques Thisse & Isabelle Thomas, 1998. "Transportation networks and the location of human activities," ERSA conference papers ersa98p268, European Regional Science Association.
    13. Alberto Ceselli & Federico Liberatore & Giovanni Righini, 2009. "A computational evaluation of a general branch-and-price framework for capacitated network location problems," Annals of Operations Research, Springer, vol. 167(1), pages 209-251, March.
    14. Stuart, Harborne Jr., 2004. "Efficient spatial competition," Games and Economic Behavior, Elsevier, vol. 49(2), pages 345-362, November.
    15. Ellis, Christopher J. & Silva, Emilson C. D., 1998. "British Bus Deregulation: Competition and Demand Coordination," Journal of Urban Economics, Elsevier, vol. 43(3), pages 336-361, May.
    16. Ali Ekici & Baṣak Altan & Okan Örsan Özener, 2016. "Pricing decisions in a strategic single retailer/dual suppliers setting under order size constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 54(7), pages 1887-1898, April.
    17. Avella, P. & Benati, S. & Canovas Martinez, L. & Dalby, K. & Di Girolamo, D. & Dimitrijevic, B. & Ghiani, G. & Giannikos, I. & Guttmann, N. & Hultberg, T. H. & Fliege, J. & Marin, A. & Munoz Marquez, , 1998. "Some personal views on the current state and the future of locational analysis," European Journal of Operational Research, Elsevier, vol. 104(2), pages 269-287, January.
    18. Sune Lauth Gadegaard & Andreas Klose & Lars Relund Nielsen, 2018. "A bi-objective approach to discrete cost-bottleneck location problems," Annals of Operations Research, Springer, vol. 267(1), pages 179-201, August.
    19. 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.
    20. Baye, Michael R. & Morgan, John, 1999. "A folk theorem for one-shot Bertrand games," Economics Letters, Elsevier, vol. 65(1), pages 59-65, October.

    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:inm:oropre:v:48:y:2000:i:5:p:671-685. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.