Density based problem space search for the capacitated clustering p-median problem

Annals of Operations Research

Volumn 131, Issue 1-4, 2004, Pages 21-43

  Ahmadi, Samad ^a   Osman, Ibrahim H ^b  

^a DE MONTFORT UNIVERSITY   (United Kingdom)

^b AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

Author keywords

capacitated clustering (p median) problem; greedy density search; guided construction search method; metaheuristics; problem space search

Indexed keywords

EID: 4444247308     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/B:ANOR.0000039511.61195.21     Document Type: Article

References (45)

1. Ahmad, I. and M.K. Dhodhi. (1995). "Task Assignment Using a Problem-Space Genetic Algorithm." Concurrency: Practice and Experience 7, 411-428.
2. Ahmadi, S. (1998). "Metaheuristics for the Capacitated Clustering Problem." Ph.D. Thesis, University of Kent at Canterbury, UK.
3. Ahmadi, S. and I.H. Osman. (2004). "Greedy Random Adaptive Memory Programming Search for the Capacitated Clustering Problem." European Journal of Operational Research, available online January 2004. Special Issue on Logistics.
4. Baldacci, R., E. Hadjiconstantinou, V. Maniezzo, and A. Mingozzi. (2002). "A New Method for Solving Capacitated Location Problems Based on a Set Partitioning Approach." Computers & Operations Research 29(4), 365-386.
5. Baxter, J. (1981). "Local Optima Avoidance in Depot Location." Journal of the Operational Research Society 32, 815-819.
6. Beck, M.P. and J.M. Mulvey. (1982). "Constructing Optimal Index Funds." Technical Report, Princeton University Report No. EES-82-1.
7. P. Brücker. (1977). "On the Complexity of Clustering Problems." In R. Henn, B. Korte, and W. Oettli (eds.), Optimization and Operations Research: Proceedings of a Workshop, University of Bonn, October 2-8. Springer, pp. 45-54.
8. Captivo, M.L. (1991). "Fast Primal and Dual Heuristics for the p-Median Location Problem." European Journal of Operational Research 52, 65-74.
9. Chhajed, D., R.L. Francis, and T.J. Lowe. (1993). "Contributionss of Operations Research to Location Analysis." Location Science 1, 263-287.
10. Dhodhi, M.K., F.H. Hielscher, R.H. Storer, and J. Bhasker. (1995). "Datapath Synthesis Using a Problem-Space Genetic Algorithm." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14, 934-944.
11. 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
12. Franca, P.M., N.G. Sosa, and V.M. Pureza. (1999). "An Adaptive Tabu Search Approach for Solving the Capacitated Clustering Problem." International Transactions in Operational Research 6, 665-678.
13. Franco, J., J. Crossa, J. Villasenor, S. Taba, and S.A. Eberhart. (1997). "Classifying Mexican Maize Accessions Using Hierarchical and Density Search Methods." Crop Science 37, 972-980.
14. Gendreau, M., A. Hertz, and G. Laporte. (1992). "New Insertion and Postoptimization Procedures for the Traveling Salesman Problem." Operations Research 40, 1086-1094.
15. Glover, F., M. Lagunai, and R. Marti. (2000). "Fundamentals of Scatter Search and Path Relinking." Control and Cybernetics 29, 653-684.
16. Hansen, P. and B. Jaumard. (1997). "Cluster Analysis and Mathematical Programming." Mathematical Programming 79, 191-215.
17. Hansen, P., B. Jaumard, and E. Sanlaville. (1993). "Weight Constrained Minimum Sum-of-Stars Clustering." Technical Report, Gerad Technical Report G-93-38.
18. Hansen, P., E.D. Pedrosa, and C.C. Ribeiro. (1994). "Modeling Location and Sizing of Offshore Platforms." European Journal of Operational Research 72, 602-606.
19. Karimi, J. (1986). "An Automated Software Design Methodology Using Capo." Journal of Management Information Systems, 3, 71-100.
20. Klein, K. and J.E. Aronson. (1991). "Optimal Clustering: A Model and Method." Naval Research Logistics 38, 447-461.
21. Koskosidis, Y.A. and W.B. Powell. (1992). "Clustering Algorithms for Consolidation of Customer Orders into Vehicle Shipments." Transportation Research 26B, 365-379.
22. Leon, V.J. and R. Balakrishnan. (1995). "Strength and Adaptability of Problem-Space Based Neighborhoods for Resource-Constrained Scheduling." OR Spektrum 17, 173-182.
23. Leon, V.J. and R. Balakrishnan. (1997). "An Adaptable Problem-Space-Based Search Method for Flexible Flow Line Scheduling." IEEE Transactions 29, 115-125.
24. Liu, G.L. (1968). Introduction to Combinatorial Mathematics. New York: McGraw-Hill.
25. Maniezzo, V., A. Mingozzi, and R. Baldacci. (1998). "A Bionomic Approach to the Capacitated p-Median Problem." Journal of Heuristics 4, 263-280.
26. Mirzaian, A. (1985). "Lagrangian Relaxation for the Start-Star Concentrator Location Problem: Approximation Algorithms and Bounds." Networks 15, 1-20.
27. Mulvey, J.M. and M.P. Beck. (1984). "Solving Capacitated Clustering Problems." European Journal of Operational Research 18, 339-348.
28. Muralidhar, K. and D. Batra. (1995). "An Investigation of the Effectiveness of Statistical Distributions for Additive Fixed Data Perturbation." Computers and Operations Research 22, 701-713.
29. Naphade, K., S.D. Wu, and R.H. Storer. (1997). "A Problem Space Search Method for the Resource Constrained Project Scheduling Problem." Annals of Operations Research 70, Special Volume on Scheduling: Theory and Applications, 307-326.
30. Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience.
31. Osman, I.H. (1995a). "Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches." OR Spektrum 17, 211-225.
32. Osman, I.H. (1995b). "An Introduction to Metaheuristics." In M. Lawrence and C. Wilsdon (eds.), Operational Research Tutorial Papers. Birmingham: Operational Research Society Press, pp. 92-122.
33. Osman, I.H. (2003). "Meta-Heuristics: Models, Analysis, and Directions." A tutorial paper presented at the joint EURO/INFORMS Meeting, Istanbul, July 6-10.
34. Osman, I.H. and S. Ahmadi. (2002). "Guided Construction Search for the Capacitated p-Median Problem." Working paper, School of Business, American University of Beirut, Lebanon.
35. Osman, I.H. and N. Christofides. (1994). "Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search." International Transactions in Operational Research 1, 317-336.
36. Osman, I.H. and J.P. Kelly. (1996). "Metaheuristics. An Overview." In I.H. Osman and J.P. Kelly (eds.), Metaheuristics, Theory and Applications. Boston: Kluwer Academic.
37. Osman, I.H. and G. Laporte. (1996). "Metaheuristics: A Bibliography." Annals of Operations Research 63, 513-623.
38. Ribeiro, C.C. and P. Hansen. (2002). Essays and Surveys on Metaheuristics. Boston: Kluwer Academic.
39. Russell, R.A. (1995). "Hybrid Heuristics for the Vehicle Routing Problem with Time Windows." Transportation Science 29, 156.
40. Steiglitz, K. and P. Weiner. (1968). "Some Improved Algorithms for Computer Solution of the Traveling Salesman Problem." In R.T. Chien and T.N. Trick (eds.), Proceedings of the 6th Annual Allerton Conference on Circuit Theory, New York, pp. 814-821.
41. Storer, R.H., S.D. Wu, and I. Park. (1993). "Genetic Algorithms in Problem Space for Sequencing Problems." In G. Fandel, T. Gulledge, and A. Jones (eds.), Operations Research in Production Planning and Control. Berlin: Springer.
42. Storer, R.H., S.D. Wu, and R. Vaccari. (1992). "New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling." Management Science 38, 1495-1509.
43. Vakharia, A.J. and J. Mahajan. (2000). "Clustering of Objects and Attributes for Manufacturing and Marketing Applications." European Journal of Operational Research 123, 640-651.
44. Voss, S., S. Martello, I.H. Osman, and C. Roucairol. (1998). Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer Academic.
45. Wong, M.A. (1982). "A Hybrid Clustering Method for Identifying High-Density Clusters." Journal of American Statistical Association 77, 841-847.