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

DOI10.1007/s12597-016-0271-8zbMath1375.90319OpenAlexW2469586870MaRDI QIDQ1684321

B. Jayalakshmi, Alok Singh

Publication date: 8 December 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-016-0271-8

zbMATH Keywords

\(p\)-median problemswarm intelligenceartificial bee colony algorithm\(p\)-median problem with positive/negative weights

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

Solving the \(p\)-median problem on regular and lattice networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-patch model for the optimal management of a fishing resource considering a marine protected area
• The \(p\)-median problem: a survey of metaheuristic approaches
• A genetic algorithm for the \(p\)-median problem with pos/neg weights
• A polynomial method for the pos/neg weighted 3-median problem on a tree
• An efficient tabu search procedure for the \(p\)-median problem
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• An efficient genetic algorithm for the \(p\)-median problem
• 2-medians in trees with pos/neg weights
• A statistical analysis of simulated annealing applied to the \(p\)-median problem
• A gamma heuristic for the \(p\)-median problem
• A hybrid heuristic for the \(p\)-median problem
• A comparative study of artificial bee colony algorithm
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• A fast swap-based local search procedure for location problems
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Variable neighborhood search for the p-median
• A new heuristic approach for the P-median problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights