IDEAS home Printed from https://ideas.repec.org/a/bpj/jossai/v2y2014i5p451-460n6.html
   My bibliography  Save this article

Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem

Author

Listed:
  • Zhu Jianming

    (College of Engineering and Information Technology, University of Chinese Academy of Sciences, Beijing100049, China)

Abstract

In this paper, a new location analysis method is presented. Given a connected graph G = (V, E)with nonnegative edge cost ce for each edge e ∊ E, dij is the cost of the shortest path between vertices i and j in the graph. The Connected p-facility Location Problem (CpLP) is to choose p vertices from V so as to minimize the total cost of shortest path of pair-wise of these p vertices. This problem is proved to be NP-hard and non-linear integer programming is formulated. Then, two algorithms are designed for solving the CpLP. One is a heuristic algorithm based on classical maximum clique approach, while the second one is genetic algorithm. Finally, computational results show the comparison between these two algorithms.

Suggested Citation

  • Zhu Jianming, 2014. "Non-linear Integer Programming Model and Algorithms for Connected p-facility Location Problem," Journal of Systems Science and Information, De Gruyter, vol. 2(5), pages 451-460, October.
  • Handle: RePEc:bpj:jossai:v:2:y:2014:i:5:p:451-460:n:6
    DOI: 10.1515/JSSI-2014-0451
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/JSSI-2014-0451
    Download Restriction: no

    File URL: https://libkey.io/10.1515/JSSI-2014-0451?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. Constantine Toregas & Ralph Swain & Charles ReVelle & Lawrence Bergman, 1971. "The Location of Emergency Service Facilities," Operations Research, INFORMS, vol. 19(6), pages 1363-1373, October.
    3. Leon Cooper, 1963. "Location-Allocation Problems," Operations Research, INFORMS, vol. 11(3), pages 331-343, June.
    4. S. L. Hakimi, 1964. "Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph," Operations Research, INFORMS, vol. 12(3), pages 450-459, June.
    5. E. C. Sewell, 1998. "A Branch and Bound Algorithm for the Stability Number of a Sparse Graph," INFORMS Journal on Computing, INFORMS, vol. 10(4), pages 438-447, November.
    6. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    Full references (including those not matched with items on IDEAS)

    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. H K Smith & G Laporte & P R Harper, 2009. "Locational analysis: highlights of growth to maturity," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 140-148, May.
    2. 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.
    3. Lei He & Ziang Xie, 2022. "Optimization of Urban Shelter Locations Using Bi-Level Multi-Objective Location-Allocation Model," IJERPH, MDPI, vol. 19(7), pages 1-18, April.
    4. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
    5. Eliş, Haluk & Tansel, Barbaros & Oğuz, Osman & Güney, Mesut & Kian, Ramez, 2021. "On guarding real terrains: The terrain guarding and the blocking path problems," Omega, Elsevier, vol. 102(C).
    6. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    7. P. Daniel Wright & Matthew J. Liberatore & Robert L. Nydick, 2006. "A Survey of Operations Research Models and Applications in Homeland Security," Interfaces, INFORMS, vol. 36(6), pages 514-529, December.
    8. Jiwon Baik & Alan T. Murray, 2022. "Locating a facility to simultaneously address access and coverage goals," Papers in Regional Science, Wiley Blackwell, vol. 101(5), pages 1199-1217, October.
    9. Xin Feng & Alan T. Murray, 2018. "Allocation using a heterogeneous space Voronoi diagram," Journal of Geographical Systems, Springer, vol. 20(3), pages 207-226, July.
    10. S. A. MirHassani & R. Ebrazi, 2013. "A Flexible Reformulation of the Refueling Station Location Problem," Transportation Science, INFORMS, vol. 47(4), pages 617-628, November.
    11. Knight, V.A. & Harper, P.R. & Smith, L., 2012. "Ambulance allocation for maximal survival with heterogeneous outcome measures," Omega, Elsevier, vol. 40(6), pages 918-926.
    12. Milosav Georgijevic & Sanja Bojic & Dejan Brcanov, 2013. "The location of public logistic centers: an expanded capacity-limited fixed cost location-allocation modeling approach," Transportation Planning and Technology, Taylor & Francis Journals, vol. 36(2), pages 218-229, April.
    13. 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.
    14. Amir Hossein Sadeghi & Ziyuan Sun & Amirreza Sahebi-Fakhrabad & Hamid Arzani & Robert Handfield, 2023. "A Mixed-Integer Linear Formulation for a Dynamic Modified Stochastic p-Median Problem in a Competitive Supply Chain Network Design," Logistics, MDPI, vol. 7(1), pages 1-24, March.
    15. Widener, Michael J. & Horner, Mark W., 2011. "A hierarchical approach to modeling hurricane disaster relief goods distribution," Journal of Transport Geography, Elsevier, vol. 19(4), pages 821-828.
    16. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    17. Emre Tokgöz & Samir Alwazzi & Theodore Trafalis, 2015. "A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces," Computational Management Science, Springer, vol. 12(3), pages 397-415, July.
    18. Zhi-Chun Li & Qian Liu, 2020. "Optimal deployment of emergency rescue stations in an urban transportation corridor," Transportation, Springer, vol. 47(1), pages 445-473, February.
    19. Zvi Drezner & Vladimir Marianov & George O. Wesolowsky, 2016. "Maximizing the minimum cover probability by emergency facilities," Annals of Operations Research, Springer, vol. 246(1), pages 349-362, November.
    20. Comber, Alexis & Dickie, Jennifer & Jarvis, Claire & Phillips, Martin & Tansey, Kevin, 2015. "Locating bioenergy facilities using a modified GIS-based location–allocation-algorithm: Considering the spatial distribution of resource supply," Applied Energy, Elsevier, vol. 154(C), pages 309-316.

    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:bpj:jossai:v:2:y:2014:i:5:p:451-460:n:6. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.