An adaptive tabu search algorithm for the capacitated clustering problem

International Transactions in Operational Research

Volumn 6, Issue 6, 1999, Pages 665-678

  Franca P M ^a   Sosa, N M ^b   Pureza, V ^c  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b UNIVERSIDAD NACIONAL DEL ALTIPLANO   (Peru)

^c FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

Author keywords

Capacitated clustering problems; Metaheuristics; Tabu search

Indexed keywords

EID: 1142272634     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.1999.tb00180.x     Document Type: Article

References (28)

1. Aarts, E.H.L., Lenstra, J.K., 1997. Local Search in Combinatorial Optimization. Wiley, Chichester.
2. Beasley, J.E., 1990. OR-library: distributing test problems by electronic mail. Journal of the Operational Research Society 41 (11), 1069-1072.
3. Bourjolly, J.M., Laporte, G., Rousseau, J.M., 1981. Political districting by computer application to the island of Montreal. Infer. 19 (2), 113-124.
4. Bramel, J., Simchi-Levi, D., 1995. A location based heuristic for general routing problem. Operations Research 43 (4), 649-660.
5. Cerny, V., 1985. A thermodynamical approach to the travelling salesman problem: an efficient simulated annealing algorithm. Journal of Optimization Theory and Applications 45, 41-51.
6. Chakrapani, J., Skorin-Kapov, J., 1993. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research 41, 327-341.
7. Connolly, D., 1990. An improved annealing scheme for the QAP. European Journal of Operational Research 46, 93-100.
8. Connolly, D., 1992. General purpose simulated annealing. Journal of the Operational Research Society 43, 494-505.
9. Everitt, B.S., 1993. Cluster Analysis. Wiley, New York.
10. Feo, T.A., Resende, M.G.C., 1989. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67-71.
11. Fisher, M.L., Jaikumar, R., 1981. A generalized assignment heuristic for the vehicle routing problem. Networks 11 (2), 109-124.
12. França, P.M., Gendreau, M., Laporte, G., Müller, P.M., 1995. The m-traveling salesman problem with minmax objective. Transportation Science 29 (3), 267-275.
13. França, P.M., Gendreau, M., Laporte, G., Müller, P.M., 1996. A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times. International Journal of Production Economics 43, 79-89.
14. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
15. Gendreau, M., Hertz, A., Laporte, G., 1994. A tabu search heuristic for the vehicle routing problem. Management Science 40, 1276-1290.
16. Glover, F., Kochenberger, G., Alidaee, B., Amini, M., 1999. Tabu search with critical event memory: an enhanced application for binary quadratic programs. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (Eds.), Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Boston, pp. 93-110.
17. Glover, F., Laguna, M., 1997. Tabu Search. Kluwer Academic Publishers, Boston.
18. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
19. Hübscher, R., Glover, F., 1992. Applying tabu search with influential diversification to multiprocessor scheduling, private communication.
20. Jaw, J.-J., Odoni, A.R., Psaraftis, H.N., Wilson, N.H.M., 1986. A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research B 20, 243-257.
21. Kaufman, L., Rousseeuw, P., 1990. Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York.
22. Koskosidis, Y.A., Powell, W.B., 1992. Clustering algorithms for consolidation of customer orders into vehicle shipments. Transportation Research B 26, 365-379.
23. Kirkpatrick, S., Gelatt, C.D., Vecchi, P.M., 1983. Optimization by simulated annealing. Science 220, 671-680.
24. Laporte, G., Osman, I.H., 1994. Metaheuristics: a bibliography. In: Laporte, G., Osman, I.H. (Eds.), Metaheuristic in Combinatorial Optimization, Annals of Operations Research 63.
25. Maniezzo, V., Mingozzi, A., Baldacci, R., 1998. A bionomic approach to the capacitated P-median problem. Journal of Heuristics 4 (3), 263-280.
26. Mulvey, J.M., Beck, M.P., 1984. Solving capacitated clustering problems. European Journal of Operational Research 18, 339-348.
27. Osman, I.H., Christofides, N., 1994. Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research 1 (3), 317-336.
28. Pureza, V.M., França, P.M., 1996. An adaptive tabu search approach based on the topology of the solution space. In: Proceedings of the II ALIO/EURO Workshop on Practical Combinatorial Optimization, Valparaiso, Chile, 233-249.