Greedy random adaptive memory programming search for the capacitated clustering problem

European Journal of Operational Research

Volumn 162, Issue 1, 2005, Pages 30-44

  Ahmadi, Samad ^a   Osman, Ibrahim H ^b  

^a DE MONTFORT UNIVERSITY   (United Kingdom)

^b AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

Adaptive memory programming; Ant colony optimization; Capacitated clustering (p median) problem; Density search; Greedy randomized adaptive search procedure; Guided construction search metaheuristic

Indexed keywords

COMPUTATIONAL COMPLEXITY; INFORMATION TECHNOLOGY; LEARNING SYSTEMS; OPTIMIZATION; PROBABILITY; SEARCH ENGINES; SET THEORY;

ADAPTIVE MEMORY PROGRAMMING; ANT COLONY OPTIMIZATION; CAPACITATED CLUSTERING (P-MEDIAN) PROBLEM; DENSITY SEARCH; GREEDY RANDOMIZED ADAPTIVE SEARCH PROCEDURE;

PROBLEM SOLVING;

EID: 8444233302     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.08.066     Document Type: Conference Paper

References (39)

1. Ahmadi, S., 1998. Metaheuristics for the capacitated clustering problem. PhD thesis, University of Kent at Canterbury, UK.
2. Ahmadi, S., Osman, I.H., 2004. Density based problem space search for the capacitated clustering problem. In: Derigs, U., Voss S. (Eds.), Annals of Operations Research on Metaheuristics (special issue), forthcoming.
3. Aiex, R.M., Resende, M.G.C., Pardalos, P.M., Toraldo. G., 2003. GRASP with path relinking for the three-index assignment problem. INFORMS Journal on Computing, forthcoming.
4. Baldacci R., Hadjiconstantinou E., Maniezzo V., Mingozzi A. A new method for solving capacitated location problems based on a set partitioning approach. Computers & Operations Research. 29(4):2002;365-386.
5. Beck, M.P., Mulvey, J.M., 1982. Constructing optimal index funds. Technical report, Princeton University Report No. EES-82-1.
6. Brücker P. On the complexity of clustering problems. Henn R., Korte B., Oettli W. Optimization and Operations Research: Proceedings of a Workshop Held at the University of Bonn, 2-8 October. 1977;45-54 Springer Verlag.
7. Chhajed D., Francis R.L., Lowe T.J. Contributions of operations research to location analysis. Location Science. 1:1993;263-287.
8. Dongarra, J.J., 2001. Performance of various computers using standard linear equations software. Technical report, Computer Science Dept., University of Tennessee, Knoxville. Available from « http://www.netlib.org/benchmark/ performance.ps».
9. Dorigo M., Maniezzo V., Colorni A. The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B. 26(1):1996;29-41.
10. Feo T.A., Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters. 8:1989;67-71.
11. Festa P., Resende M.G.C. Grasp: An annotated bibliography. Hansen P., Ribeiro C.C. Essays and Surveys on Metaheuristics. 2001;Kluwer Academic Publishers.
12. Fleurent C., Glover F. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing. 11:1999;198-204.
13. Franca P.M., Sosa N.G., Pureza V.M. An adaptive tabu search approach for solving the capacitated clustering problem. International Transactions in Operational Research. 6:1999;665-678.
14. Glover F. Heuristics for integer programming using surrogate constraints. Decision Sciences. 8(1):1977;156-166.
15. Glover F. Tabu search and adaptive memory programming-advances, applications and challenges. Barr R.S., Helgason R.V., Kennington J.L. Advances in Metaheuristics, Optimization, and Stochastic Modeling Technologies. 1997;1-75 Kluwer, Boston, MA.
16. Glover F., Laguna M., Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics. 29:2000;653-684.
17. Golden B.L., Laporte G., Taillard E.D. An adaptive memory heuristic for a class of vehicle routing problems with minmax objective. Computers & Operations Research. 24:1997;445-452.
18. Hansen P., Jaumard B. Cluster analysis and mathematical programming. Mathematical Programming. 79:1997;191-215.
19. Hansen P., Ribeiro C.C. Essays and Surveys on Metaheuristics. 2002;Kluwer Academic Publishers.
20. Hansen, P., Jaumard, B., Sanlaville, E., 1993. Weight constrained minimum sum-of-stars clustering. Technical report, Gerad Technical Report G-93-38.
21. Hansen P., Pedrosa E.D., Ribeiro C.C. Modeling location and sizing of offshore platforms. European Journal of Operational Research. 72:1994;602-606.
22. Karimi J. An automated software design methodology using capo. Journal of Management Information Systems. 3:1986;71-100.
23. Klein K., Aronson J.E. Optimal clustering: A model and method. Naval Research Logistics. 38:1991;447-461.
24. Koskosidis Y.A., Powell W.B. Clustering algorithms for consolidation of customer orders into vehicle shipments. Transportation Research. 26B:1992;365-379.
25. Laguna M., Marti R. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing. 11(1):1999;44-52.
26. Maniezzo V., Mingozzi A., Baldacci R. A bionomic approach to the capacitated. p -median problem Journal of Heuristics. 4:1998;263-280.
27. Mirzaian A. Lagrangian relaxation for the start-star concentrator location problem: Approximation algorithms and bounds. Networks. 15:1985;1-20.
28. Mulvey J.M., Beck M.P. Solving capacitated clustering problems. European Journal of Operational Research. 18:1984;339-348.
29. Osman I.H. An introduction to metaheuristics. Lawrence M., Wilsdon C. Operational Research Tutorial Papers. 1995;92-122 Operational Research Society Press, Birmingham.
30. Osman, I.H., 1999. A Unified-Metaheuristic Framework. Lecture Notes in Artificial Intelligence, vol. 1611, pp. 11-12.
31. Osman, I.H., 2003. Meta-heuristics: Models, analysis, and directions. In: A tutorial paper presented at the joint EURO/INFORMS meeting, Istanbul, 6-10 July.
32. Osman, I.H., Ahmadi, S., 2002. Guided construction search for the capacitated p -median problem. Working paper, School of Business, American University of Beirut, Lebanon.
33. Osman I.H., Christofides N. Capacitated clustering problems by hybrid simulated annealing and tabu search. Internatinoal Transactions in Operational Research. 1:1994;317-336.
34. Osman I.H., Kelly J.P. Metaheuristics: An overview. Osman I.H., Kelly J.P. Metaheuristics, Theory and Applications. 1996;Kluwer Academic Publishers, Boston.
35. Osman I.H., Laporte G. Metaheuristics: A bibliography. Annals of Operations Research. 63:1996;513-623.
36. Pitsoulis L.S., Resende M.G.C. Greedy randomized adaptive search procedures. Pardalos P.M., Resende M.G.C. Handbook of Applied Optimization. 2001;Oxford University Press.
37. Rochat Y., Taillard É.D. Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics. 1:1995;147-167.
38. Vakharia A.J., Mahajan J. Clustering of objects and attributes for manufacturing and marketing applications. European Journal of Operational Research. 123:2000;640-651.
39. Voss S., Martello S., Osman I.H., Roucairol C. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. 1998;Kluwer Academic Publishers.