Skip to main content
SpringerLink
Log in

Density Based Problem Space Search for the Capacitated Clustering p-Median Problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In the Capacitated Clustering Problem (CCP), a given set of n weighted points is to be partitioned into p clusters such that, the total weight of the points in each cluster does not exceed a given cluster capacity. The objective is to find a set of p centers that minimises total scatter of points allocated to them. In this paper a new constructive method, a general framework to improve the performance of greedy constructive heuristics, and a problem space search procedure for the CCP are proposed. The constructive heuristic finds patterns of natural subgrouping in the input data using concept of density of points. Elements of adaptive computation and periodic construction–deconstruction concepts are implemented within the constructive heuristic to develop a general framework for building efficient heuristics. The problem-space search procedure is based on perturbations of input data for which a controlled perturbation strategy, intensification and diversification strategies are developed. The implemented algorithms are compared with existing methods on a standard set of bench-marks and on new sets of large-sized instances. The results illustrate the strengths of our algorithms in terms of solution quality and computational efficiency.

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

  • Ahmad, I. and M.K. Dhodhi. (1995). “Task Assignment Using a Problem-Space Genetic Algorithm.” Concurrency: Practice and Experience 7, 411-428.

    Google Scholar 

  • Ahmadi, S. (1998). “Metaheuristics for the Capacitated Clustering Problem.” Ph.D. Thesis, University of Kent at Canterbury, UK.

    Google Scholar 

  • 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.

  • 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.

    Article  Google Scholar 

  • Baxter, J. (1981). “Local Optima Avoidance in Depot Location.” Journal of the Operational Research Society 32, 815-819.

    Google Scholar 

  • Beck, M.P. and J.M. Mulvey. (1982). “Constructing Optimal Index Funds.” Technical Report, Princeton University Report No. EES-82-1.

  • 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.

  • Captivo, M.E. (1991). “Fast Primal and Dual Heuristics for the p-Median Location Problem.” European Journal of Operational Research 52, 65-74.

    Google Scholar 

  • Chhajed, D., R.L. Francis, and T.J. Lowe. (1993). “Contributionss of Operations Research to Location Analysis.” Location Science 1, 263-287.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • Gendreau, M., A. Hertz, and G. Laporte. (1992). “New Insertion and Postoptimization Procedures for the Traveling Salesman Problem.” Operations Research 40, 1086-1094.

    Google Scholar 

  • Glover, F.,M. Lagunai, and R. Marti. (2000). “Fundamentals of Scatter Search and Path Relinking.” Control and Cybernetics 29, 653-684.

    Google Scholar 

  • Hansen, P. and B. Jaumard. (1997). “Cluster Analysis and Mathematical Programming.” Mathematical Programming 79, 191-215.

    Article  Google Scholar 

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

  • 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.

    Article  Google Scholar 

  • Karimi, J. (1986). “An Automated Software Design Methodology Using Capo.” Journal of Management Information Systems, 3, 71-100.

    Google Scholar 

  • Klein, K. and J.E. Aronson. (1991). “Optimal Clustering: A Model and Method.” Naval Research Logistics 38, 447-461.

    Google Scholar 

  • Koskosidis, Y.A. and W.B. Powell. (1992). “Clustering Algorithms for Consolidation of Customer Orders into Vehicle Shipments.” Transportation Research 26B, 365-379.

    Google Scholar 

  • Leon, V.J. and R. Balakrishnan. (1995). “Strength and Adaptability of Problem-Space Based Neighborhoods for Resource-Constrained Scheduling.” OR Spektrum 17, 173-182.

    Article  Google Scholar 

  • Leon, V.J. and R. Balakrishnan. (1997). “An Adaptable Problem-Space-Based Search Method for Flexible Flow Line Scheduling.” IEEE Transactions 29, 115-125.

    Google Scholar 

  • Liu, G.L. (1968). Introduction to Combinatorial Mathematics. New York: McGraw-Hill.

    Google Scholar 

  • Maniezzo, V., A. Mingozzi, and R. Baldacci. (1998). “A Bionomic Approach to the Capacitated p-Median Problem.” Journal of Heuristics 4, 263-280.

    Article  Google Scholar 

  • Mirzaian, A. (1985). “Lagrangian Relaxation for the Start-Star Concentrator Location Problem: Approximation Algorithms and Bounds.” Networks 15, 1-20.

    Google Scholar 

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

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Article  Google Scholar 

  • Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience.

    Google Scholar 

  • Osman, I.H. (1995a). “Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches.” OR Spektrum 17, 211-225.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Osman, I.H. (2003). “Meta-Heuristics: Models, Analysis, and Directions.” A tutorial paper presented at the joint EURO/INFORMS Meeting, Istanbul, July 6-10.

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Osman, I.H. and G. Laporte. (1996). “Metaheuristics: A Bibliography.” Annals of Operations Research 63, 513-623.

    Article  Google Scholar 

  • Ribeiro, C.C. and P. Hansen. (2002). Essays and Surveys on Metaheuristics. Boston: Kluwer Academic.

    Google Scholar 

  • Russell, R.A. (1995). “Hybrid Heuristics for the Vehicle Routing Problem with Time Windows.” Transportation Science 29, 156.

    Google Scholar 

  • 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.

  • 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.

    Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Wong, M.A. (1982). “A Hybrid Clustering Method for Identifying High-Density Clusters.” Journal of American Statistical Association 77, 841-847.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, De Montfort University, The Gateway, Leicester, LE1 9BH, UK

    Samad Ahmadi

  2. Center for Advanced Mathematical Studies Olayan School of Business, American University of Beirut, Lebanon

    Ibrahim H. Osman

Authors
  1. Samad Ahmadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ibrahim H. Osman
    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

Ahmadi, S., Osman, I.H. Density Based Problem Space Search for the Capacitated Clustering p-Median Problem. Ann Oper Res 131, 21–43 (2004). https://doi.org/10.1023/B:ANOR.0000039511.61195.21

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:ANOR.0000039511.61195.21

Search

Navigation