IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v49y2015i3p433-451.html
   My bibliography  Save this article

Continuous Facility Location with Backbone Network Costs

Author

Listed:
  • John Gunnar Carlsson

    (Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455)

  • Fan Jia

    (Department of Industrial and Systems Engineering, University of Minnesota, Minneapolis, Minnesota 55455)

Abstract

We consider a continuous facility location problem in which our objective is to minimize the weighted sum of three costs: (1) fixed costs from installing the facilities, (2) backbone network costs incurred from connecting the facilities to each other, and (3) transportation costs incurred from providing services from the facilities to the service region. We first analyze the limiting behavior of this model and derive the two asymptotically optimal configurations of facilities: one of these configurations is the well studied honeycomb heuristic , and the other is an Archimedean spiral. We then give a fast constant-factor approximation algorithm for finding the placement of a set of facilities in any convex polygon that minimizes the sum of the three aforementioned costs.

Suggested Citation

  • John Gunnar Carlsson & Fan Jia, 2015. "Continuous Facility Location with Backbone Network Costs," Transportation Science, INFORMS, vol. 49(3), pages 433-451, August.
    • Handle: RePEc:inm:ortrsc:v:49:y:2015:i:3:p:433-451
    DOI: 10.1287/trsc.2013.0511
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2013.0511
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2013.0511?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. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    2. Miranda, Pablo A. & Garrido, Rodrigo A., 2004. "Incorporating inventory control decisions into a strategic distribution network design model with stochastic demand," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 40(3), pages 183-207, May.
    3. M. Haimovich & A. H. G. Rinnooy Kan, 1985. "Bounds and Heuristics for Capacitated Routing Problems," Mathematics of Operations Research, INFORMS, vol. 10(4), pages 527-542, November.
    4. T. L. Magnanti & R. T. Wong, 1984. "Network Design and Transportation Planning: Models and Algorithms," Transportation Science, INFORMS, vol. 18(1), pages 1-55, February.
    5. Newell, Gordon F. & Daganzo, Carlos F., 1986. "Design of multiple-vehicle delivery tours--I a ring-radial network," Transportation Research Part B: Methodological, Elsevier, vol. 20(5), pages 345-363, October.
    6. Daganzo, Carlos F., 1984. "The length of tours in zones of different shapes," Transportation Research Part B: Methodological, Elsevier, vol. 18(2), pages 135-145, April.
    7. van Bergeijk,Peter A. G. & Brakman,Steven (ed.), 2010. "The Gravity Model in International Trade," Cambridge Books, Cambridge University Press, number 9780521196154, January.
    8. Gérard P. Cachon, 2014. "Retail Store Density and the Cost of Greenhouse Gas Emissions," Management Science, INFORMS, vol. 60(8), pages 1907-1925, August.
    9. James F. Campbell, 1993. "One-to-Many Distribution with Transshipments: An Analytic Model," Transportation Science, INFORMS, vol. 27(4), pages 330-340, November.
    10. Melkote, Sanjay & Daskin, Mark S., 2001. "An integrated model of facility location and transportation network design," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(6), pages 515-538, July.
    11. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    12. John Gunnar Carlsson & Fan Jia & Ying Li, 2014. "An Approximation Algorithm for the Continuous k -Medians Problem in a Convex Polygon," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 280-289, May.
    13. Dimitris J. Bertsimas & David Simchi-Levi, 1996. "A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty," Operations Research, INFORMS, vol. 44(2), pages 286-304, 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. Shi, Jianmai & Chen, Wenyi & Verter, Vedat, 2023. "The joint impact of environmental awareness and system infrastructure on e-waste collection," European Journal of Operational Research, Elsevier, vol. 310(2), pages 760-772.
    2. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    3. Fontaine, Pirmin & Minner, Stefan & Schiffer, Maximilian, 2023. "Smart and sustainable city logistics: Design, consolidation, and regulation," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1071-1084.
    4. Pablo Adasme & Ali Dehghan Firoozabadi, 2019. "Facility Location with Tree Topology and Radial Distance Constraints," Complexity, Hindawi, vol. 2019, pages 1-29, November.

    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. John Gunnar Carlsson & Fan Jia, 2013. "Euclidean Hub-and-Spoke Networks," Operations Research, INFORMS, vol. 61(6), pages 1360-1382, December.
    2. John Gunnar Carlsson & Mehdi Behroozi & Raghuveer Devulapalli & Xiangfei Meng, 2016. "Household-Level Economies of Scale in Transportation," Operations Research, INFORMS, vol. 64(6), pages 1372-1387, December.
    3. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    4. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    5. del Castillo, Jose M., 1998. "A heuristic for the traveling salesman problem based on a continuous approximation," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 123-152, April.
    6. Ellegood, William A. & Campbell, James F. & North, Jeremy, 2015. "Continuous approximation models for mixed load school bus routing," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 182-198.
    7. Lei, Chao & Ouyang, Yanfeng, 2018. "Continuous approximation for demand balancing in solving large-scale one-commodity pickup and delivery problems," Transportation Research Part B: Methodological, Elsevier, vol. 109(C), pages 90-109.
    8. Jabali, Ola & Gendreau, Michel & Laporte, Gilbert, 2012. "A continuous approximation model for the fleet composition problem," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1591-1606.
    9. Carlos F. Daganzo & Karen R. Smilowitz, 2004. "Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems," Transportation Science, INFORMS, vol. 38(3), pages 343-356, August.
    10. Bergmann, Felix M. & Wagner, Stephan M. & Winkenbach, Matthias, 2020. "Integrating first-mile pickup and last-mile delivery on shared vehicle routes for efficient urban e-commerce distribution," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 26-62.
    11. Anna Franceschetti & Ola Jabali & Gilbert Laporte, 2017. "Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 413-433, October.
    12. Karen Smilowitz, 2017. "Comments on: Continuous approximation models in freight distribution management," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 440-442, October.
    13. Geunes, Joseph & Shen, Zuo-Jun Max & Emir, Akin, 2007. "Planning and approximation models for delivery route based services with price-sensitive demands," European Journal of Operational Research, Elsevier, vol. 183(1), pages 460-471, November.
    14. Contreras, Ivan & Fernández, Elena, 2012. "General network design: A unified view of combined location and network design problems," European Journal of Operational Research, Elsevier, vol. 219(3), pages 680-697.
    15. Hadas, Yuval & Laor, Amir, 2013. "Network design model with evacuation constraints," Transportation Research Part A: Policy and Practice, Elsevier, vol. 47(C), pages 1-9.
    16. Santos, Miguel Gueifão & Antunes, António Pais, 2015. "Long-term evolution of airport networks: Optimization model and its application to the United States," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 73(C), pages 17-46.
    17. Carlos Daganzo & Karen Smilowitz, 2006. "A note on asymptotic formulae for one-dimensional network flow problems," Annals of Operations Research, Springer, vol. 144(1), pages 153-160, April.
    18. Baller, Annelieke C. & Dabia, Said & Dullaert, Wout E.H. & Vigo, Daniele, 2019. "The Dynamic-Demand Joint Replenishment Problem with Approximated Transportation Costs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 1013-1033.
    19. Diana, Marco & Dessouky, Maged M. & Xia, Nan, 2006. "A model for the fleet sizing of demand responsive transportation services with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 40(8), pages 651-666, September.
    20. Li, Xiaopeng & Ouyang, Yanfeng, 2010. "A continuum approximation approach to reliable facility location design under correlated probabilistic disruptions," Transportation Research Part B: Methodological, Elsevier, vol. 44(4), pages 535-548, May.

    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:ortrsc:v:49:y:2015:i:3:p:433-451. 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.