Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 353101, 10 pages
http://dx.doi.org/10.1155/2014/353101
Research Article

An Iterated Tabu Search Approach for the Clique Partitioning Problem

Faculty of Informatics, Kaunas University of Technology, Studentu Street 50-408, 51368 Kaunas, Lithuania

Received 8 November 2013; Accepted 15 January 2014; Published 4 March 2014

Academic Editors: S. Bureerat, N. Gulpinar, and W. Ogryczak

Copyright © 2014 Gintaras Palubeckis et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Z. P. Fan, Y. Chen, J. Ma, and S. Zeng, “A hybrid genetic algorithmic approach to the maximallydiverse grouping problem,” Journal of the Operational Research Society, vol. 62, no. 7, pp. 1423–1430, 2011. View at Google Scholar
  2. M. Gallego, M. Laguna, R. Martí, and A. Duarte, “Tabu search with strategic oscillation for the maximally diverse grouping problem,” Journal of the Operational Research Society, vol. 64, no. 5, pp. 724–734, 2013. View at Google Scholar
  3. G. Palubeckis, E. Karčiauskas, and A. Riškus, “Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem,” Information Technology and Control, vol. 40, no. 4, pp. 277–285, 2011. View at Google Scholar · View at Scopus
  4. J.-P. Barthélemy and B. Leclerc, “The median procedure for partitions,” in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, I. J. Cox, P. Hansen, and B. Julesz, Eds., vol. 19, pp. 3–34, 1995. View at Google Scholar
  5. J.-P. Barthélemy and B. Monjardet, “The median procedure in cluster analysis and social choice theory,” Mathematical Social Sciences, vol. 1, no. 3, pp. 235–267, 1981. View at Google Scholar · View at Scopus
  6. M. J. Brusco and H.-F. Köhn, “Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem,” Psychometrika, vol. 74, no. 4, pp. 685–703, 2009. View at Publisher · View at Google Scholar · View at Scopus
  7. A. Guénoche, “Consensus of partitions: a constructive approach,” Advances in Data Analysis and Classification, vol. 5, no. 3, pp. 215–229, 2011. View at Publisher · View at Google Scholar · View at Scopus
  8. U. Dorndorf, F. Jaehn, and E. Pesch, “Modelling robust flight-gate scheduling as a clique partitioning problem,” Transportation Science, vol. 42, no. 3, pp. 292–301, 2008. View at Publisher · View at Google Scholar · View at Scopus
  9. U. Dorndorf, F. Jaehn, and E. Pesch, “Flight gate scheduling with respect to a reference schedule,” Annals of Operations Research, vol. 194, no. 1, pp. 177–187, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, S. Perron, and L. Liberti, “Column generation algorithms for exact modularity maximization in networks,” Physical Review E, vol. 82, no. 4, Article ID 046112, 9 pages, 2010. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Kochenberger, F. Glover, B. Alidaee, and H. Wang, “Clustering of microarray data via clique partitioning,” Journal of Combinatorial Optimization, vol. 10, no. 1, pp. 77–92, 2005. View at Publisher · View at Google Scholar · View at Scopus
  12. P. Hansen and B. Jaumard, “Cluster analysis and mathematical programming,” Mathematical Programming, vol. 79, no. 1–3, pp. 191–215, 1997. View at Google Scholar · View at Scopus
  13. G. Kettleborough and V. J. Rayward-Smith, “Optimising sum-of-squares measures for clustering multisets defined over a metric space,” Discrete Applied Mathematics, vol. 161, no. 16-17, pp. 2499–2513, 2013. View at Google Scholar
  14. M. Oosten, J. H. G. C. Rutten, and F. C. R. Spieksma, “The clique partitioning problem: facets and patching facets,” Networks, vol. 38, no. 4, pp. 209–226, 2001. View at Publisher · View at Google Scholar · View at Scopus
  15. H. Wang, B. Alidaee, F. Glover, and G. Kochenberger, “Solving group technology problems via clique partitioning,” International Journal of Flexible Manufacturing Systems, vol. 18, no. 2, pp. 77–97, 2006. View at Publisher · View at Google Scholar · View at Scopus
  16. M. Grötschel and Y. Wakabayashi, “A cutting plane algorithm for a clustering problem,” Mathematical Programming, vol. 45, no. 1–3, pp. 59–96, 1989. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Grötschel and Y. Wakabayashi, “Facets of the clique partitioning polytope,” Mathematical Programming, vol. 47, no. 1–3, pp. 367–387, 1990. View at Publisher · View at Google Scholar · View at Scopus
  18. U. Dorndorf and E. Pesch, “Fast clustering algorithms,” ORSA Journal on Computing, vol. 6, no. 2, pp. 141–153, 1994. View at Google Scholar
  19. G. Palubeckis, “A branch-and-bound approach using polyhedral results for a clustering problem,” INFORMS Journal on Computing, vol. 9, no. 1, pp. 30–42, 1997. View at Google Scholar · View at Scopus
  20. A. Mehrotra and M. A. Trick, “Cliques and clustering: a combinatorial approach,” Operations Research Letters, vol. 22, no. 1, pp. 1–12, 1998. View at Google Scholar · View at Scopus
  21. N. Sukegawa, Y. Yamamoto, and L. Zhang, “Lagrangian relaxation and pegging test for the clique partitioning problem,” Advances in Data Analysis and Classification, vol. 7, no. 4, pp. 363–391, 2013. View at Google Scholar
  22. F. Jaehn and E. Pesch, “New bounds and constraint propagation techniques for the clique partitioning problem,” Discrete Applied Mathematics, vol. 161, no. 13-14, pp. 2025–2037, 2013. View at Google Scholar
  23. S. Régnier, “Sur quelques aspects mathématiques des problèmes de classification automatique,” I.C.C. Bulletin, vol. 4, pp. 175–191, 1965. View at Google Scholar
  24. J. F. Marcotorchino and P. Michaud, “Heuristic approach to the similarity aggregation problem,” Methods of Operations Research, vol. 43, pp. 395–404, 1981. View at Google Scholar
  25. S. G. de Amorim, J.-P. Barthélemy, and C. C. Ribeiro, “Clustering and clique partitioning: simulated annealing and tabu search approaches,” Journal of Classification, vol. 9, no. 1, pp. 17–41, 1992. View at Publisher · View at Google Scholar · View at Scopus
  26. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Google Scholar
  27. I. Charon and O. Hudry, “Noising methods for a clique partitioning problem,” Discrete Applied Mathematics, vol. 154, no. 5, pp. 754–769, 2006. View at Publisher · View at Google Scholar · View at Scopus
  28. N. Bilal, P. Galinier, and F. Guibault, “An iterated-tabu-search heuristic for a variant of the partial set covering problem,” Journal of Heuristics, 2014. View at Publisher · View at Google Scholar
  29. J.-F. Cordeau, G. Laporte, and F. Pasin, “Iterated tabu search for the car sequencing problem,” European Journal of Operational Research, vol. 191, no. 3, pp. 945–956, 2008. View at Publisher · View at Google Scholar · View at Scopus
  30. Z. Fu, W. Huang, and Z. Lü, “Iterated tabu search for the circular open dimension problem,” European Journal of Operational Research, vol. 225, no. 2, pp. 236–243, 2013. View at Google Scholar
  31. X. Lai and Z. Lü, “Multistart iterated tabu search for bandwidth coloring problem,” Computers and Operations Research, vol. 40, no. 5, pp. 1401–1409, 2013. View at Google Scholar
  32. A. Misevicius, “An implementation of the iterated tabu search algorithm for the quadratic assignment problem,” OR Spectrum, vol. 34, no. 3, pp. 665–690, 2012. View at Publisher · View at Google Scholar · View at Scopus
  33. G. Palubeckis, “Iterated tabu search for the maximum diversity problem,” Applied Mathematics and Computation, vol. 189, no. 1, pp. 371–383, 2007. View at Publisher · View at Google Scholar · View at Scopus
  34. G. Palubeckis and D. Rubliauskas, “A branch-and-bound algorithm for the minimum cut linear arrangement problem,” Journal of Combinatorial Optimization, vol. 24, no. 4, pp. 540–563, 2012. View at Publisher · View at Google Scholar · View at Scopus
  35. F. Glover, “Heuristics for integer programming using surrogate constraints,” Decision Sciences, vol. 8, no. 1, pp. 156–166, 1977. View at Google Scholar
  36. F. Glover, “Future paths for integer programming and links to artificial intelligence,” Computers and Operations Research, vol. 13, no. 5, pp. 533–549, 1986. View at Google Scholar · View at Scopus