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

An adaptive multiphase approach for large unconditional and conditional p-median problems

Author

Listed:
  • Irawan, Chandra Ade
  • Salhi, Said
  • Scaparra, Maria Paola

Abstract

A multiphase approach that incorporates demand points aggregation, Variable Neighbourhood Search (VNS) and an exact method is proposed for the solution of large-scale unconditional and conditional p-median problems. The method consists of four phases. In the first phase several aggregated problems are solved with a “Local Search with Shaking” procedure to generate promising facility sites which are then used to solve a reduced problem in Phase 2 using VNS or an exact method. The new solution is then fed into an iterative learning process which tackles the aggregated problem (Phase 3). Phase 4 is a post optimisation phase applied to the original (disaggregated) problem. For the p-median problem, the method is tested on three types of datasets which consist of up to 89,600 demand points. The first two datasets are the BIRCH and the TSP datasets whereas the third is our newly geometrically constructed dataset that has guaranteed optimal solutions. The computational experiments show that the proposed approach produces very competitive results. The proposed approach is also adapted to cater for the conditional p-median problem with interesting results.

Suggested Citation

  • Irawan, Chandra Ade & Salhi, Said & Scaparra, Maria Paola, 2014. "An adaptive multiphase approach for large unconditional and conditional p-median problems," European Journal of Operational Research, Elsevier, vol. 237(2), pages 590-605.
  • Handle: RePEc:eee:ejores:v:237:y:2014:i:2:p:590-605
    DOI: 10.1016/j.ejor.2014.01.050
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221714000897
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2014.01.050?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.

    References listed on IDEAS

    as
    1. Richard Church, 2003. "COBRA: A New Formulation of the Classic p-Median Location Problem," Annals of Operations Research, Springer, vol. 122(1), pages 103-120, September.
    2. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    3. Hansen, Pierre & Mladenovic, Nenad, 2001. "Variable neighborhood search: Principles and applications," European Journal of Operational Research, Elsevier, vol. 130(3), pages 449-467, May.
    4. Mauricio Resende & Renato Werneck, 2007. "A fast swap-based local search procedure for location problems," Annals of Operations Research, Springer, vol. 150(1), pages 205-230, March.
    5. L Bach, 1981. "The Problem of Aggregation and Distance for Analyses of Accessibility and Access Opportunity in Location-Allocation Models," Environment and Planning A, , vol. 13(8), pages 955-978, August.
    6. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    7. Frank Plastria, 2001. "On the choice of aggregation points for continuousp-median problems: A case for the gravity centre," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 217-242, December.
    8. S. Salhi & M.D.H. Gamal, 2003. "A Genetic Algorithm Based Approach for the Uncapacitated Continuous Location–Allocation Problem," Annals of Operations Research, Springer, vol. 123(1), pages 203-222, October.
    9. R. Francis & T. Lowe & M. Rayco & A. Tamir, 2009. "Aggregation error for location models: survey and analysis," Annals of Operations Research, Springer, vol. 167(1), pages 171-208, March.
    10. Qi, Lian & Shen, Zuo-Jun Max, 2010. "Worst-case analysis of demand point aggregation for the Euclidean p-median problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 434-443, April.
    11. R. L. Francis & T. J. Lowe & Arie Tamir, 2000. "Aggregation Error Bounds for a Class of Location Models," Operations Research, INFORMS, vol. 48(2), pages 294-307, April.
    12. M. Hodgson, 2002. "Data Surrogation Error in p-Median Models," Annals of Operations Research, Springer, vol. 110(1), pages 153-165, February.
    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. Chandra Ade Irawan & Dylan Jones, 2019. "Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities," Annals of Operations Research, Springer, vol. 272(1), pages 41-67, January.
    2. Chandra Ade Irawan & Said Salhi & Zvi Drezner, 2016. "Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems," Journal of Heuristics, Springer, vol. 22(4), pages 507-537, August.
    3. Zhizhu Lai & Qun Yue & Zheng Wang & Dongmei Ge & Yulong Chen & Zhihong Zhou, 2022. "The min-p robust optimization approach for facility location problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1134-1160, September.
    4. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.
    5. Chandra Ade Irawan & Said Salhi & Kusmaningrum Soemadi, 2020. "The continuous single-source capacitated multi-facility Weber problem with setup costs: formulation and solution methods," Journal of Global Optimization, Springer, vol. 78(2), pages 271-294, October.
    6. Duran-Mateluna, Cristian & Ales, Zacharie & Elloumi, Sourour, 2023. "An efficient benders decomposition for the p-median problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 84-96.
    7. Ramirez-Marquez, José Emmanuel & Li, Qing, 2018. "Locating and protecting facilities from intentional attacks using secrecyAuthor-Name: Zhang, Chi," Reliability Engineering and System Safety, Elsevier, vol. 169(C), pages 51-62.

    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. Chandra Irawan & Said Salhi, 2015. "Solving large $$p$$ p -median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search," Journal of Global Optimization, Springer, vol. 63(3), pages 537-554, November.
    2. R. Francis & T. Lowe & M. Rayco & A. Tamir, 2009. "Aggregation error for location models: survey and analysis," Annals of Operations Research, Springer, vol. 167(1), pages 171-208, March.
    3. Kenneth Carling & Mengjie Han & Johan Håkansson, 2012. "Does Euclidean distance work well when the p-median model is applied in rural areas?," Annals of Operations Research, Springer, vol. 201(1), pages 83-97, December.
    4. Richard Francis & Timothy Lowe, 2014. "Comparative error bound theory for three location models: continuous demand versus discrete demand," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 144-169, April.
    5. Wangshu Mu & Daoqin Tong, 2020. "On solving large p-median problems," Environment and Planning B, , vol. 47(6), pages 981-996, July.
    6. Santi, Éverton & Aloise, Daniel & Blanchard, Simon J., 2016. "A model for clustering data from heterogeneous dissimilarities," European Journal of Operational Research, Elsevier, vol. 253(3), pages 659-672.
    7. Mladenovic, Nenad & Brimberg, Jack & Hansen, Pierre & Moreno-Perez, Jose A., 2007. "The p-median problem: A survey of metaheuristic approaches," European Journal of Operational Research, Elsevier, vol. 179(3), pages 927-939, June.
    8. Qi, Lian & Shen, Zuo-Jun Max, 2010. "Worst-case analysis of demand point aggregation for the Euclidean p-median problem," European Journal of Operational Research, Elsevier, vol. 202(2), pages 434-443, April.
    9. Patricia Domínguez-Marín & Stefan Nickel & Pierre Hansen & Nenad Mladenović, 2005. "Heuristic Procedures for Solving the Discrete Ordered Median Problem," Annals of Operations Research, Springer, vol. 136(1), pages 145-173, April.
    10. R.L. Francis & T.J. Lowe & M.B. Rayco & A. Tamir, 2003. "Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(6), pages 614-637, September.
    11. Ade Irawan, Chandra & Starita, Stefano & Chan, Hing Kai & Eskandarpour, Majid & Reihaneh, Mohammad, 2023. "Routing in offshore wind farms: A multi-period location and maintenance problem with joint use of a service operation vessel and a safe transfer boat," European Journal of Operational Research, Elsevier, vol. 307(1), pages 328-350.
    12. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    13. Marinakis, Yannis & Migdalas, Athanasios & Sifaleras, Angelo, 2017. "A hybrid Particle Swarm Optimization – Variable Neighborhood Search algorithm for Constrained Shortest Path problems," European Journal of Operational Research, Elsevier, vol. 261(3), pages 819-834.
    14. Zhang, Ying & Snyder, Lawrence V. & Ralphs, Ted K. & Xue, Zhaojie, 2016. "The competitive facility location problem under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 453-473.
    15. Amaldi, Edoardo & Coniglio, Stefano, 2013. "A distance-based point-reassignment heuristic for the k-hyperplane clustering problem," European Journal of Operational Research, Elsevier, vol. 227(1), pages 22-29.
    16. Irawan, Chandra Ade & Song, Xiang & Jones, Dylan & Akbari, Negar, 2017. "Layout optimisation for an installation port of an offshore wind farm," European Journal of Operational Research, Elsevier, vol. 259(1), pages 67-83.
    17. Alexander Biele & Lars Mönch, 2018. "Hybrid approaches to optimize mixed-model assembly lines in low-volume manufacturing," Journal of Heuristics, Springer, vol. 24(1), pages 49-81, February.
    18. Nevena Čolić & Pavle Milošević & Ivana Dragović & Miljan S. Ćeranić, 2024. "IBA-VNS: A Logic-Based Machine Learning Algorithm and Its Application in Surgery," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    19. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
    20. Robert Aboolian & Oded Berman & Dmitry Krass, 2012. "Profit Maximizing Distributed Service System Design with Congestion and Elastic Demand," Transportation Science, INFORMS, vol. 46(2), pages 247-261, 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:eee:ejores:v:237:y:2014:i:2:p:590-605. 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.