Bee colony optimization for the \(p\)-center problem

DOI10.1016/j.cor.2010.12.002zbMath1208.90103OpenAlexW1998666917MaRDI QIDQ632685

Milica Šelmić, Dušan Teodorović, Dušan Ramljak, Tatjana Davidović

Publication date: 25 March 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.002

zbMATH Keywords

combinatorial optimizationmeta-heuristicslocation analysisbee colony optimization\(p\)-center problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items

A multi-objective model for locating search and rescue boats, Comparative study of type-2 fuzzy particle swarm, bee colony and bat algorithms in optimization of fuzzy controllers, GRASP and VNS for solving the \(p\)-next center problem, Bee colony optimization for scheduling independent tasks to identical processors, Data Exploration by Representative Region Selection: Axioms and Convergence, Automated non-monotonic reasoning in System \textbf{P}, Mathematical Models and Search Algorithms for the Capacitated p-Center Problem, Less is more approach in optimization: a road to artificial intelligence, Parallelization strategies for bee colony optimization based on message passing communication protocol, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF
• ABC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• Innovations in swarm intelligence.
• A note on solving large p-median problems
• Lexicographic local search and the \(p\)-center problem.
• Location analysis: a synthesis and survey
• Dominant, an algorithm for the \(p\)-center problem.
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
• Heuristic methods for thep-center problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Polynomially bounded algorithms for locatingp-centers on a tree
• The Centers and Medians of a Graph
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph