{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T18:26:19Z","timestamp":1649010379904},"reference-count":26,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T00:00:00Z","timestamp":1564358400000},"content-version":"vor","delay-in-days":28,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2018,6,19]]},"published-print":{"date-parts":[[2019,7]]},"abstract":"<jats:p>We study here the application of the \u201cdescent with mutations\u201d metaheuristic to a problem arising from the field of classification and cluster analysis (dealing more precisely with the aggregation of symmetric relations) and which can be represented as a clique partitioning of a weighted graph. In this problem, we deai with a complete undirected graphe <jats:italic>G<\/jats:italic>; the edges of <jats:italic>G<\/jats:italic> have weights which can be positive, negative or equal to 0; the aim is to partition the vertices of <jats:italic>G<\/jats:italic> into disjoint cliques (whose number depends on <jats:italic>G<\/jats:italic> in order to minimize the sum of the weights of the edges with their two extremities in a same clique; this problem is NP-hard. The \u201cdescent with mutations\u201d is a local search metaheuristic, of which the design is very simple and is based on local transformation. It consists in randomly performing random elementary transformations, irrespective improvement or worsening with respect to the objective function. We compare it with another very efficient metaheuristic, which is a simulated annealing method improved by the addition of some ingredients coming from the noising methods. Experiments show that the descent with mutations is at least as efficient for the studied problem as this improved simulated annealing, usually a little better, while it is much easier to design and to tune.<\/jats:p>","DOI":"10.1051\/ro\/2018048","type":"journal-article","created":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T07:48:28Z","timestamp":1529912908000},"page":"1083-1095","source":"Crossref","is-referenced-by-count":2,"title":["Application of the \u201cdescent with mutations\u201d metaheuristic to a clique partitioning problem"],"prefix":"10.1051","volume":"53","author":[{"given":"Olivier","family":"Hudry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2019,7,29]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"de Amorim","year":"1992","journal-title":"J. Classif."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Arabie P., Hubert L.J. and de Soete G., Clustering and Classification. World Scientific Publishers, Singapore and River Edge, NJ (1996).","DOI":"10.1142\/1930"},{"key":"R3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1090\/dimacs\/019\/01","volume":"19","author":"Barth\u00e9lemy","year":"1995","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0165-4896(81)90041-X","volume":"1","author":"Barth\u00e9lemy","year":"1981","journal-title":"Math. Soc. Sci."},{"key":"R5","unstructured":"Brossier G., Les \u00e9l\u00e9ments fondamentaux de la classification. In: Analyse des donn\u00e9es, edited by Govaert G.. Herm\u00e8s Lavoisier, Paris (2003)."},{"key":"R6","unstructured":"Brucker F. and Barth\u00e9lemy J.-P., \u00c9l\u00e9ments de classification. Herm\u00e8s, Paris (2007)."},{"key":"R7","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90023-A","volume":"14","author":"Charon","year":"1993","journal-title":"Oper. Res. Lett."},{"key":"R8","unstructured":"Charon I. and Hudry O., Mixing different components of metaheuristics. In: Metaheuristics: Theory and Applications, edited by Osman I.H. and Kelly J.P.. Kluwer Academic Publishers, Boston (1996) 589\u2013603."},{"key":"R9","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018976217274","volume":"80","author":"Charon","year":"1998","journal-title":"Ann. Oper. Res."},{"key":"R10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(99)00457-9","volume":"125","author":"Charon","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/02331930902944911","volume":"58","author":"Charon","year":"2009","journal-title":"Optimization"},{"key":"R12","unstructured":"Charon I. and Hudry O., The noising methods. In: Heuristics: Theory and Applications, edited by Siarry P.. Nova Publishers, New York, NY (2013) 1\u201330."},{"key":"R13","unstructured":"Dowsland K.A., Simulated annealing. In: Modern Heuristic Techniques for Combinatorial Problems, edited by Reeves C.. McGraw-Hill, London (1995) 20\u201369."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Everitt B.S., Landau S., Leese M. and Stahl D., Cluster Analysis. Wiley, Hoboken, NJ (2011).","DOI":"10.1002\/9780470977811"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Gendreau M. and Potvin J.-Y., Handbook of Metaheuristics. Springer, Berlin (2010).","DOI":"10.1007\/978-1-4419-1665-5"},{"key":"R16","first-page":"83","volume":"197","author":"Hudry","year":"2012","journal-title":"Math. Soc. Sci."},{"key":"R17","unstructured":"Hudry O., Descent with mutations applied to the linear order problem. In: Book of Abstracts of the 5th International Symposium on Combinatorial Optimization, ISCO 2018 (2018) 86\u201387."},{"key":"R18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BF00289116","volume":"23","author":"Krivanek","year":"1986","journal-title":"Acta Inf."},{"key":"R19","unstructured":"Luke S., Essentials of Metaheuristics. 2nd edition. Available at: http:\/\/cs.gmu.edu\/sean\/book\/metaheuristics\/. Lulu Press (2013)."},{"key":"R20","first-page":"175","volume":"4","author":"R\u00e9gnier","year":"1965","journal-title":"ICC Bull."},{"key":"R21","unstructured":"Romesburg C., Cluster Analysis for Researchers. Lulu Press, Morrisville, NC (2004)."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"Siarry P. (ed.), Metaheuristics. Springer, Berlin (2016).","DOI":"10.1007\/978-3-319-45403-0"},{"key":"R23","doi-asserted-by":"crossref","unstructured":"Talbi E.-G., Metaheuristics: From Design to Implementation. Wiley, Hoboken, NJ, 2009.","DOI":"10.1002\/9780470496916"},{"key":"R24","unstructured":"Wakabayashi Y., Aggregation of binary relations: algorithmic and polyhedral investigations. Ph.D. thesis, Augsbourg (1986)."},{"key":"R25","first-page":"323","volume":"3","author":"Wakabayashi","year":"1998","journal-title":"Resenhas"},{"key":"R26","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0112071","volume":"12","author":"Zahn","year":"1964","journal-title":"SIAM J. Appl. Math."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018048\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T07:45:52Z","timestamp":1584690352000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2018048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":26,"journal-issue":{"issue":"3"},"alternative-id":["ro170153"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2018048","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]}}}