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

B. Jayalakshmi () and Alok Singh ()
Additional contact information
B. Jayalakshmi: University of Hyderabad
Alok Singh: University of Hyderabad

OPSEARCH, 2017, vol. 54, issue 1, No 4, 67-93

Abstract: 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.

Keywords: Artificial bee colony algorithm; Swarm intelligence; p-Median problem; p-Median problem with positive/negative weights (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-016-0271-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:54:y:2017:i:1:d:10.1007_s12597-016-0271-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-016-0271-8

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().