Bee colony optimization for the p-center problem
DOI10.1016/J.COR.2010.12.002zbMATH Open1208.90103OpenAlexW1998666917MaRDI QIDQ632685FDOQ632685
Authors: Tatjana Davidović, Dušan Ramljak, Milica Šelmić, Dušan Teodorović 
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
Recommendations
combinatorial optimizationmeta-heuristicslocation analysisbee colony optimization\(p\)-center problem
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- A note on solving large p-median problems
- Ant colony optimization.
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- Title not available (Why is that?)
- Title not available (Why is that?)
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Location analysis: a synthesis and survey
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Polynomially bounded algorithms for locatingp-centers on a tree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Routing and wavelength assignment in all-optical networks based on the bee colony optimization
- The Centers and Medians of a Graph
- Innovations in swarm intelligence.
- Lexicographic local search and the \(p\)-center problem.
- Dominant, an algorithm for the \(p\)-center problem.
- Heuristic methods for thep-center problem
Cited In (16)
- GRASP and VNS for solving the \(p\)-next center problem
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Bee Colony Optimization - part I: The algorithm overview
- Fighting terrorism: how to position rapid response teams?
- Data exploration by representative region selection: axioms and convergence
- Application of the cohort-intelligence optimization method to three selected combinatorial optimization problems
- 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
- Automated non-monotonic reasoning in System \textbf{P}
- Title not available (Why is that?)
- Title not available (Why is that?)
- Less is more approach in optimization: a road to artificial intelligence
- Bee colony optimization for the \(p\)-center problem
- Parallelization strategies for bee colony optimization based on message passing communication protocol
- Bee colony optimization for scheduling independent tasks to identical processors
Uses Software
This page was built for publication: Bee colony optimization for the \(p\)-center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632685)
