{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T23:09:56Z","timestamp":1720048196217},"reference-count":31,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,10]]},"abstract":"<jats:p>This article tackles the maximum clique problem MCP known as an NP-hard graph problem. The maximum clique problem consists in finding in an undirected graph a complete sub-graph (clique) of maximum cardinality. As the MCP is a classical graph problem extensively studied, the main contribution of this paper is to use for the first time particle swarm to solve it. A hybrid particle swarm optimization algorithm HPSOD is proposed. First a PSO algorithm is designed, based on a sub-graph extraction approach named circular-arc graph CAG, then a local search heuristic is integrated to enhance its performance. Experimental tests carried out on DIMACS benchmarks show a globally good performance of the proposed algorithm and that it outperforms many existent approaches.<\/jats:p>","DOI":"10.4018\/ijoris.2018100102","type":"journal-article","created":{"date-parts":[[2018,8,29]],"date-time":"2018-08-29T12:11:22Z","timestamp":1535544682000},"page":"21-35","source":"Crossref","is-referenced-by-count":1,"title":["Solving the Maximum Clique Problem using a Hybrid Particle Swarm Optimization Algorithm"],"prefix":"10.4018","volume":"9","author":[{"given":"Dalila","family":"Tayachi","sequence":"first","affiliation":[{"name":"Ecole Sup\u00e9rieure de Commerce de Tunis, Tunis, Tunisia"}]},{"given":"Marwa","family":"Khemiri","sequence":"additional","affiliation":[{"name":"Ecole Sup\u00e9rieure de Commerce de Tunis, Tunis, Tunisia"}]}],"member":"2432","reference":[{"key":"IJORIS.2018100102-0","doi-asserted-by":"publisher","DOI":"10.4018\/ijoris.2014010101"},{"key":"IJORIS.2018100102-1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.2.226"},{"key":"IJORIS.2018100102-2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415983"},{"key":"IJORIS.2018100102-3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009646528813"},{"key":"IJORIS.2018100102-4","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010074"},{"key":"IJORIS.2018100102-5","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.6.2.154"},{"key":"IJORIS.2018100102-6","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0868"},{"key":"IJORIS.2018100102-7","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"IJORIS.2018100102-8","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-012-9207-5"},{"key":"IJORIS.2018100102-9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36605-9_22"},{"key":"IJORIS.2018100102-10","author":"M. R.Garey","year":"1979","journal-title":"Computer and intractability: A guide to the NP-completeness"},{"key":"IJORIS.2018100102-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.06.009"},{"key":"IJORIS.2018100102-12","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/07"},{"key":"IJORIS.2018100102-13","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(04)80049-9"},{"key":"IJORIS.2018100102-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2003.09.012"},{"key":"IJORIS.2018100102-15","unstructured":"Johnson, D. S., & Trick, M. A. (Eds.). (1996). Cliques, coloring, and satisfiability: Second DIMACS implementation challenge. American Mathematical Society. Retrieved from http:\/\/iridia.ulb.ac.be\/~fmascia\/files\/DIMACS\/"},{"key":"IJORIS.2018100102-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.05.010"},{"key":"IJORIS.2018100102-17","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"key":"IJORIS.2018100102-18","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1609\/aaai.v24i1.7536","article-title":"An efficient branch and bound algorithm based on MaxSat for the maximum clique problem.","author":"C.Li","year":"2010","journal-title":"Proceedings of 24th AAAI Conference on Artificial Intelligence"},{"key":"IJORIS.2018100102-19","doi-asserted-by":"publisher","DOI":"10.4018\/ijoris.2015040102"},{"key":"IJORIS.2018100102-20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46004-7_12"},{"key":"IJORIS.2018100102-21","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.03.032"},{"key":"IJORIS.2018100102-22","first-page":"18","article-title":"Clique finding- a genetic approach.","author":"A. S.Murthy","year":"1994","journal-title":"Proceeding of 1st IEEE Conference of Evolutionary Computing"},{"key":"IJORIS.2018100102-23","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"},{"key":"IJORIS.2018100102-24","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-007-0002-0"},{"key":"IJORIS.2018100102-25","doi-asserted-by":"publisher","DOI":"10.4018\/ijoris.2015040101"},{"key":"IJORIS.2018100102-26","doi-asserted-by":"publisher","DOI":"10.4018\/joris.2012010102"},{"key":"IJORIS.2018100102-27","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026\/12"},{"key":"IJORIS.2018100102-28","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-006-9039-7"},{"key":"IJORIS.2018100102-29","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9437-8"},{"key":"IJORIS.2018100102-30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.09.064"}],"container-title":["International Journal of Operations Research and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=212674","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:25:17Z","timestamp":1693848317000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJORIS.2018100102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2018,10]]},"references-count":31,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.4018\/ijoris.2018100102","relation":{},"ISSN":["1947-9328","1947-9336"],"issn-type":[{"value":"1947-9328","type":"print"},{"value":"1947-9336","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10]]}}}