IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v54y2017i1d10.1007_s12597-016-0271-8.html
   My bibliography  Save this article

A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights

Author

Listed:
  • B. Jayalakshmi

    (University of Hyderabad)

  • Alok Singh

    (University of Hyderabad)

Abstract

In the classical p-median problem, the objective is to find a set Y of p vertices on an undirected graph $$G=(V,E)$$ G = ( V , E ) in such a way that $$ Y \subseteq V$$ Y ⊆ V and the sum of distances from all the vertices to their respective closest vertices in Y is minimized. In this paper, we have considered the weighted case where every vertex in G has either a positive or a negative weight under two different objective functions, viz. the sum of the minimum weighted distances and the sum of the weighted minimum distances. In this paper, we have proposed a hybrid artificial bee colony (ABC) algorithm for the positive/negative weighted p-median problem where each solution generated by ABC algorithm is improved by an interchange based randomized local search. In addition, an interchange based exhaustive local search is applied on some of the best solutions obtained after the execution of ABC algorithm in a bid to further improve their quality. We have compared our approach with the state-of-the-art approaches available in the literature on the standard benchmark instances. Computational results demonstrate the effectiveness of our approach.

Suggested Citation

  • B. Jayalakshmi & Alok Singh, 2017. "A hybrid artificial bee colony algorithm for the p-median problem with positive/negative weights," OPSEARCH, Springer;Operational Research Society of India, vol. 54(1), pages 67-93, March.
    • Handle: RePEc:spr:opsear:v:54:y:2017:i:1:d:10.1007_s12597-016-0271-8
    DOI: 10.1007/s12597-016-0271-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-016-0271-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-016-0271-8?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. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    2. Alfred A. Kuehn & Michael J. Hamburger, 1963. "A Heuristic Program for Locating Warehouses," Management Science, INFORMS, vol. 9(4), pages 643-666, July.
    3. Rainer Burkard & Jafar Fathali, 2007. "A polynomial method for the pos/neg weighted 3-median problem on a tree," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 65(2), pages 229-238, April.
    4. Fernando Chiyoshi & Roberto Galvão, 2000. "A statistical analysis of simulated annealing applied to the p-median problem," Annals of Operations Research, Springer, vol. 96(1), pages 61-74, November.
    5. Fathali, J. & Kakhki, H. Taghizadeh, 2006. "Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases," European Journal of Operational Research, Elsevier, vol. 170(2), pages 440-462, April.
    6. 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.
    7. Michael B. Teitz & Polly Bart, 1968. "Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph," Operations Research, INFORMS, vol. 16(5), pages 955-961, October.
    8. Osman Alp & Erhan Erkut & Zvi Drezner, 2003. "An Efficient Genetic Algorithm for the p-Median Problem," Annals of Operations Research, Springer, vol. 122(1), pages 21-42, September.
    9. 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.
    10. Rosing, K. E. & ReVelle, C. S. & Schilling, D. A., 1999. "A gamma heuristic for the p-median problem," European Journal of Operational Research, Elsevier, vol. 117(3), pages 522-532, September.
    11. Jafar Fathali & Hossein Kakhki & Rainer Burkard, 2006. "An ant colony algorithm for the pos/neg weighted p-median problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 229-246, September.
    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. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    2. 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.
    3. Michael Brusco & Hans-Friedrich Köhn, 2009. "Exemplar-Based Clustering via Simulated Annealing," Psychometrika, Springer;The Psychometric Society, vol. 74(3), pages 457-475, September.
    4. Wangshu Mu & Daoqin Tong, 2020. "On solving large p-median problems," Environment and Planning B, , vol. 47(6), pages 981-996, July.
    5. Oded Berman & Zvi Drezner & Arie Tamir & George Wesolowsky, 2009. "Optimal location with equitable loads," Annals of Operations Research, Springer, vol. 167(1), pages 307-325, March.
    6. Antiopi Panteli & Basilis Boutsinas & Ioannis Giannikos, 2021. "On solving the multiple p-median problem based on biclustering," Operational Research, Springer, vol. 21(1), pages 775-799, March.
    7. Snežana Tadić & Mladen Krstić & Željko Stević & Miloš Veljović, 2023. "Locating Collection and Delivery Points Using the p -Median Location Problem," Logistics, MDPI, vol. 7(1), pages 1-17, February.
    8. Kim, Dong-Guen & Kim, Yeong-Dae, 2010. "A branch and bound algorithm for determining locations of long-term care facilities," European Journal of Operational Research, Elsevier, vol. 206(1), pages 168-177, October.
    9. 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.
    10. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F., 2012. "Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem," European Journal of Operational Research, Elsevier, vol. 222(1), pages 54-64.
    11. Jafar Fathali & Hossein Kakhki & Rainer Burkard, 2006. "An ant colony algorithm for the pos/neg weighted p-median problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 14(3), pages 229-246, September.
    12. 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.
    13. Yılmaz, Seren Bilge & Yücel, Eda, 2021. "Optimizing onboard catering loading locations and plans for airlines," Omega, Elsevier, vol. 99(C).
    14. Lim, Seow & Kuby, Michael, 2010. "Heuristic algorithms for siting alternative-fuel stations using the Flow-Refueling Location Model," European Journal of Operational Research, Elsevier, vol. 204(1), pages 51-61, July.
    15. Michael Brusco & J Dennis Cradit & Douglas Steinley, 2021. "A comparison of 71 binary similarity coefficients: The effect of base rates," PLOS ONE, Public Library of Science, vol. 16(4), pages 1-19, April.
    16. Zvi Drezner & Jack Brimberg & Nenad Mladenović & Said Salhi, 2016. "New local searches for solving the multi-source Weber problem," Annals of Operations Research, Springer, vol. 246(1), pages 181-203, November.
    17. Antunes, Antonio & Peeters, Dominique, 2001. "On solving complex multi-period location models using simulated annealing," European Journal of Operational Research, Elsevier, vol. 130(1), pages 190-201, April.
    18. Behrooz Alizadeh & Somayeh Bakhteh, 2017. "A modified firefly algorithm for general inverse p-median location problems under different distance norms," OPSEARCH, Springer;Operational Research Society of India, vol. 54(3), pages 618-636, September.
    19. 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.
    20. Francisco Casas & Claudio E. Torres & Ignacio Araya, 2022. "A heuristic search based on diversity for solving combinatorial problems," Journal of Heuristics, Springer, vol. 28(3), pages 287-328, June.

    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:spr:opsear:v:54:y:2017:i:1:d:10.1007_s12597-016-0271-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.