Skip to main content
SpringerLink
Log in

A reactive GRASP with path relinking for capacitated clustering

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper presents a greedy randomized adaptive search procedure (GRASP) coupled with path relinking (PR) to solve the problem of clustering n nodes in a graph into p clusters. The objective is to maximize the sum of the edge weights within each cluster such that the sum of the corresponding node weights does not exceed a fixed capacity. In phase I, both a heaviest weight edge (HWE) algorithm and a constrained minimum cut algorithm are used to select seeds for initializing the p clusters. Feasible solutions are obtained with the help of a self-adjusting restricted candidate list that sequentially guides the assignment of the remaining nodes. At each major GRASP iteration, the list length is randomly set based on a probability density function that is updated dynamically to reflect the solution quality realized in past iterations. In phase II, three neighborhoods, each defined by common edge and node swaps, are explored to attain local optimality. The following exploration strategies are investigated: cyclic neighborhood search, variable neighborhood descent, and randomized variable neighborhood descent (RVND). The best solutions found are stored in an elite pool.

In a post-processing step, PR is applied to the pool members to cyclically generate paths between each pair. As new solutions are uncovered, a systematic attempt is made to improve a subset of them with local search. Should a better solution be found, it is saved temporally and placed in the pool after all the pairs are investigated and the bottom member is removed. The procedure ends when no further improvement is possible. Extensive computational testing was done to evaluate the various combinations of construction and local search strategies. For instances with up to 40 nodes and 5 clusters, the reactive GRASP with PR found optimal solutions within a negligible amount of time compared to CPLEX. In general, the HWE algorithm in the construction phase, RVND in the local search phase, and the use of PR provided the best results. The largest instances solved involved 82 nodes and 8 clusters.

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

  • Al-Sultan, K.S., Khan, M.M.: Computational experience on four algorithms for the hard clustering problem. Pattern Recogn. Lett. 173, 295–308 (1996)

    Article  Google Scholar 

  • Ahmadi, S., Osman, I.H.: Greedy random adaptive memory programming search for the capacitated clustering problem. Eur. J. Oper. Res. 162(1), 30–44 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  • Bard, J.F., Jarrah, A.I.: Large-scale constrained clustering for rationalizing pickup and delivery operations. Transp. Res. Part B: Methodol. 43(5), 542–561 (2009)

    Article  Google Scholar 

  • Barreto, S., Ferreira, C., Paixao, J., Santos, B.S.: Using clustering analysis in a capacitated location-routing problem. Eur. J. Oper. Res. 179, 968–977 (2006)

    Article  Google Scholar 

  • Boudia, M., Louly, M.A.O., Prins, C.: A reactive GRASP and path relinking for a combined production-distribution problem. Comput. Oper. Res. 34(11), 3402–3419 (2006)

    Article  Google Scholar 

  • Brucker, J.: On the Complexity of Clustering Problem. Lecture Notes in Economics and Mathematical Systems, vol. 157, pp. 45–54. Springer, Berlin/Heidelberg (1978)

    Google Scholar 

  • Cano, J.R., Cardon, O., Herrera, F., Sanchez, L.: A greedy randomized adaptive search procedure applied to the clustering problem as an initialization process using k-means as a local search procedure. J. Intell. Fuzzy Syst. 12, 235–242 (2002)

    MATH  Google Scholar 

  • Chiou, Y.-C., Lan, L.W.: Genetic clustering algorithms. Eur. J. Oper. Res. 135(2), 413–427 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Daganzo, C.F.: Logistics System Analysis, 4th edn. Springer, Berlin (2005)

    Google Scholar 

  • Deng, Y.: Combining mathematical programming and metaheuristics: an application to semiconductor manufacturing. Ph.D. dissertation, Graduate Program in Operations Research & Industrial Engineering, University of Texas, Austin (2009)

  • Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedure. J. Glob. Optim. 2, 1–27 (1995)

    MathSciNet  Google Scholar 

  • Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81(2), 229–256 (1998)

    Article  MATH  Google Scholar 

  • Frank, A.: On the edge-connectivity algorithm of Nagamochi and Ibaraki. Working paper, ARTEMIS-IMAG, Université de Grenoble, Grenoble, France (1994)

  • Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path relinking. Control Cybern. 29(3), 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

  • Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62(1), 133–151 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  • Hansen, P., Mladenovic, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34(2), 405–413 (2001)

    Article  MATH  Google Scholar 

  • Hu, B., Leitner, M., Raidl, G.R.: Combining variable neighborhood search with integer linear programming for the generalized minimum spanning tree problem. J. Heuristics 14(5), 473–499 (2008)

    Article  MATH  Google Scholar 

  • Kaufman, L., Roussweuw, P.: Finding Groups in Data: An Introductory to Cluster Analysis. Wiley, New York (1990)

    Google Scholar 

  • Karger, D.R., Stein, C.: A new approach to the minimum cut problem. J. ACM 43(4), 601–640 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  • Kontoravdis, G., Bard, J.F.: A GRASP for the vehicle routing problem with time windows. ORSA J. Comput. 7(1), 10–23 (1995)

    MATH  Google Scholar 

  • Laporte, S., Chapleau, S., Landry, P.-E., Mercure, H.: An algorithm for the design of mailbox collection routes in urban areas. Transp. Res. Part B: Methodol. 23(4), 271–280 (1989)

    Article  Google Scholar 

  • Lorena, L.A.N., Senne, E.L.F.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863–876 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  • Mehrotra, A., Trick, M.A.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22(1), 1–12 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  • Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  • Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18(3), 339–48 (1984)

    Article  MATH  Google Scholar 

  • Nagmochi, H., Ibaraki, T.: Computing edge-connectivity in multigraphs and capaciated graphs. SIAM J. Discrete Math. 5(1), 54–66 (1992)

    Article  MathSciNet  Google Scholar 

  • Negreiros, M., Palhano, A.: The capacitated centered clustering problem. Comput. Oper. Res. 33(6), 1639–1663 (2005)

    Article  Google Scholar 

  • Newell, G.F., Daganzo, C.F.: Design of multiple-vehicle delivery tours—I: a ring-radial network. Transp. Res. Part B: Methodol. 20B(5), 345–363 (1986)

    Article  Google Scholar 

  • Osman, I.H., Ahmadi, S.: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint. J. Oper. Res. Soc. 58(1), 100–114 (2007)

    Article  MATH  Google Scholar 

  • Ouyang, Y.: Design of vehicle routing zones for large-scale distribution systems. Transp. Res. Part B: Methodol. 41(10), 1079–1093 (2007)

    Article  Google Scholar 

  • Prais, M., Ribeiro, C.C.: Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12(3), 164–176 (1999)

    Article  MathSciNet  Google Scholar 

  • Rojanasoonthon, S., Bard, J.F.: A GRASP for parallel machine scheduling with time windows. INFORMS J. Comput. 17(1), 32–51 (2005)

    Article  MathSciNet  Google Scholar 

  • Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396–1407 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate Program in Operations Research and Industrial Engineering, The University of Texas, Austin, TX, 78712-0292, USA

    Yumin Deng & Jonathan F. Bard

Authors
  1. Yumin Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jonathan F. Bard
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jonathan F. Bard.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Deng, Y., Bard, J.F. A reactive GRASP with path relinking for capacitated clustering. J Heuristics 17, 119–152 (2011). https://doi.org/10.1007/s10732-010-9129-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-010-9129-z

Keywords

Search

Navigation