A Bionomic Approach to the Capacitated p-Median Problem

Authors:
Vittorio Maniezzo;Aristide Mingozzi;Roberto Baldacci
Affiliations:
Scienze dell‘Informazione, Universitá di Bologna, Contrada Sacchi, 3, 47023 Cesena, Italy;Scienze dell‘Informazione, Universitá di Bologna, Contrada Sacchi, 3, 47023 Cesena, Italy;Scienze dell‘Informazione, Universitá di Bologna, Contrada Sacchi, 3, 47023 Cesena, Italy
Venue:
Journal of Heuristics
Year:
1998

Citing 6
Cited 13

A cross decomposition algorithm for capacitated facility location

Operations Research
Efficient algorithms for the capacitated concentrator location problem

Computers and Operations Research
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution

Budget constrained location problem with opening and closing of facilities

Computers and Operations Research
The Ant Colony Optimization paradigm for combinatorial optimization

Advances in evolutionary computing
A column generation approach to capacitated p-median problems

Computers and Operations Research
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation
The structure of local search diversity

Math'04 Proceedings of the 5th WSEAS International Conference on Applied Mathematics
Optimal switch location in mobile communication networks using hybrid genetic algorithms

Applied Soft Computing
Search intensity versus search diversity: a false trade off?

Applied Intelligence
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
A novel grouping heuristic algorithm for the switch location problem based on a hybrid dual harmony search technique

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem

Computers and Industrial Engineering
A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

Computers and Operations Research
A multi-objective grouping Harmony Search algorithm for the optimal distribution of 24-hour medical emergency units

Expert Systems with Applications: An International Journal
A hybrid metaheuristic approach for the capacitated p-median problem

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper advocates the use of the bionomicalgorithm, a recently proposed metaheuristic technique, as aneffective method to solve capacitated p-median problems (CPMP). Bionomic algorithms already proved to be an effective frameworkfor finding good solutions to combinatorial optimizationproblems, when good local optimization algorithms are available.The paper also presents an effective local search technique forthe CPMP. Computational results show the effectiveness of theproposed approach, when compared to the best performingheuristics so far presented in the literature.