Skip to main content
SpringerLink
Log in

A Bionomic Approach to the Capacitated p-Median Problem

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

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

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Aardal, K. (1994). “Capacitated Facility Location: Separation Algorithms and Computational Experience.” Technical Report, Dept. of Econometrics, Tilburg University.

  • Bäck, T., F. Hoffmeister, and H.P. Schwefel. (1991). “A Survey of Evolution Strategies.” Fourth International Conference on Genetic Algorithms. Morgan Kauffman.

  • Baldacci, R., V. Maniezzo, A. Mingozzi, and S. Ricciardelli. (1995). “Exact Algorithms for Single Source Capacitated Location Problems.” 14th European Conference on Operational Research. Jerusalem, Israel.

  • Beasley, J.E. (1988). “An Algorithm for Solving Large Capacitated Warehouse Location Problems.” European Journal of Operational Research33, 314-325.

    Google Scholar 

  • Christofides, N. (1994). “The Bionomic Algorithm.” AIRO'94 Conference. Savona, Italy.

  • Christofides, N. and J.E. Beasley. (1983). “Extensions to a Lagrangean Relaxation Approach for the Capacitated Warehouse Location Problem.” European Journal of Operational Research12, 19-28.

    Google Scholar 

  • Erlenkotter, D. (1978). “A Dual-Based Procedure for Uncapacitated Facility Location.” Operations Research26, 992-1009.

    Google Scholar 

  • Fisher, M. (1981). “The Lagrangean Relaxation for Solving Integer Programming.” Management Science27, 1-18.

    Google Scholar 

  • Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co.

  • Glover, F. (1977). “Heuristics for Integer Programming Using Surrogate Constraints.” Decision Sciences8, 156- 166.

    Google Scholar 

  • Glover, F. (1997). “A Template for Scatter Search and Path Relinking.” To appear in Lecture Notes in Computer Science, J.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snjers (Eds.).

  • Golden, B. and C. Skiscim. (1986).“Using Simulated Annealing to Solve Routing and Location Problems.” Naval Research Logistic Quarterly33, 261-279.

    Google Scholar 

  • Hansen, P., B. Jaumard, and E. Sanlaville. (1994). “Weight Constrained Minimum Sum-of-Star Clustering.” Gerad Technical Report G-93-38.

  • Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.

  • Leung, J.M.Y. and T.L. Magnanti. (1989). “Valid Inequalities and Facets of the Capacitated Plant Location Problem.” Mathematical Programming44, 271-291.

    Google Scholar 

  • MacQueen, J.B. (1967). “Some Methods for Classification and Analysis of Multivariate Observations.” 5th Berkeley Symposium on Mathematics, Statistics and Probability.

  • Martello, S. and P. Toth. (1990). Knapsack Problems, Algorithms and Computer Implementations. John Wiley.

  • Mulvey, J.M. and M.P. Beck. (1984). “Solving Capacitated Clustering Problems,” European Journal of Operational Research18, 339-348.

    Google Scholar 

  • Neebe, A.W. and M.R. Rao. (1983). “An Algorithm for the Fixed Charge Assigning Users to Sources Problem.” Journal of the Operational Research Society34(11), 1107-1113.

    Google Scholar 

  • Osman, I.H. and N. Christofides. (1994). “Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search.” International Transactions in Operational Research1(3), 317-336.

    Google Scholar 

  • Osman, I.H. and G. Laporte. (1996). “Methaheuristics. A Bibliography.” Annals of Operational Research63, 513-628.

    Google Scholar 

  • Pirkul, H. (1987). “Efficient Algorithms for the Capacitated Concentrator Location Problem.” Computers and Operations Research14(3), 197-208.

    Google Scholar 

  • Rechenberg, I. (1973). Evolutionsstrategie. Fromman-Holzbog.

  • Van Roy, T.J. (1985). “A Cross Decomposition Algorithm for Capacitated Facility Location.” Operations Research34, 145-163.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Scienze dell'Informazione, Universitá di Bologna, Contrada Sacchi, 3, 47023, Cesena, Italy

    Vittorio Maniezzo, Aristide Mingozzi & Roberto Baldacci

Authors
  1. Vittorio Maniezzo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aristide Mingozzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roberto Baldacci
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Maniezzo, V., Mingozzi, A. & Baldacci, R. A Bionomic Approach to the Capacitated p-Median Problem. Journal of Heuristics 4, 263–280 (1998). https://doi.org/10.1023/A:1009665717611

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009665717611

Search

Navigation