A Bionomic Approach to the Capacitated p-Median Problem

Journal of Heuristics

Volumn 4, Issue 3, 1998, Pages 263-280

  Maniezzo, Vittorio ^a   Mingozzi, Aristide ^a   Baldacci, Roberto ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Bionomic algorithms; Local search; Location problems; Metaheuristics

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; EFFICIENCY; HEURISTIC METHODS; OPTIMIZATION;

BIONOMIC ALGORITHMS;

CONSTRAINT THEORY;

EID: 0032166751     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009665717611     Document Type: Article

References (24)

1. Aardal, K. (1994). "Capacitated Facility Location: Separation Algorithms and Computational Experience." Technical Report, Dept. of Econometrics, Tilburg University.
2. Back, T., F. Hoffmeister, and H.P. Schwefel. (1991). "A Survey of Evolution Strategies." Fourth International Conference on Genetic Algorithms. Morgan Kauffman.
3. 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.
4. Beasley, J.E. (1988). "An Algorithm for Solving Large Capacitated Warehouse Location Problems." European Journal of Operational Research 33, 314-325.
5. Christofides, N. (1994). "The Bionomic Algorithm." AIRO'94 Conference. Savona, Italy.
6. Christofides, N. and J.E. Beasley. (1983). "Extensions to a Lagrangean Relaxation Approach for the Capacitated Warehouse Location Problem." European Journal of Operational Research 12, 19-28.
7. Erlenkotter, D. (1978). "A Dual-Based Procedure for Uncapacitated Facility Location." Operations Research 26, 992-1009.
8. Fisher, M. (1981). "The Lagrangean Relaxation for Solving Integer Programming." Management Science 27,1-18.
9. Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co.
10. Glover, F. (1977). "Heuristics for Integer Programming Using Surrogate Constraints." Decision Sciences 8, 156-166.
11. 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.).
12. Golden, B. and C. Skiscim. (1986)."Using Simulated Annealing to Solve Routing and Location Problems." Naval Research Logistic Quarterly 33, 261-279.
13. Hansen, P., B. Jaumard, and E. Sanlaville. (1994). "Weight Constrained Minimum Sum-of-Star Clustering." Gerad Technical Report G-93-38.
14. Holland, J.H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press.
15. Leung, J.M.Y. and T.L. Magnanti. (1989). "Valid Inequalities and Facets of the Capacitated Plant Location Problem." Mathematical Programming 44, 271-291.
16. MacQueen, J.B. (1967). "Some Methods for Classification and Analysis of Multivariate Observations." 5th Berkeley Symposium on Mathematics, Statistics and Probability.
17. Martello, S. and P. Toth. (1990). Knapsack Problems, Algorithms and Computer Implementations. John Wiley.
18. Mulvey, J.M. and M.P. Beck. (1984). "Solving Capacitated Clustering Problems," European Journal of Operational Research 18, 339-348.
19. Neebe, A.W. and M.R. Rao. (1983). "An Algorithm for the Fixed Charge Assigning Users to Sources Problem." Journal of the Operational Research Society 34(11), 1107-1113.
20. Osman, I.H. and N. Christofides. (1994). "Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search." International Transactions in Operational Research 1(3), 317-336.
21. Osman, I.H. and G. Laporte. (1996). "Methaheuristics. A Bibliography." Annals of Operational Research 63, 513-628.
22. Pirkul, H. (1987). "Efficient Algorithms for the Capacitated Concentrator Location Problem." Computers and Operations Research 14(3), 197-208.
23. Rechenberg, I. (1973). Evolutionsstrategie. Fromman-Holzbog.
24. Van Roy, T.J. (1985). "A Cross Decomposition Algorithm for Capacitated Facility Location." Operations Research 34, 145-163.