{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T09:23:08Z","timestamp":1789723388897,"version":"4.0.1"},"reference-count":33,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301255"],"award-info":[{"award-number":["11301255"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["MYK15005"],"award-info":[{"award-number":["MYK15005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Science and Technology Project ofMinjiangUniversity, China","award":["11301255"],"award-info":[{"award-number":["11301255"]}]},{"name":"Science and Technology Project ofMinjiangUniversity, China","award":["MYK15005"],"award-info":[{"award-number":["MYK15005"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Intelligence and Neuroscience"],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:p>The max-cut problem is NP-hard combinatorial optimization problem with many real world applications. In this paper, we propose an integrated method based on particle swarm optimization and estimation of distribution algorithm (PSO-EDA) for solving the max-cut problem. The integrated algorithm overcomes the shortcomings of particle swarm optimization and estimation of distribution algorithm. To enhance the performance of the PSO-EDA, a fast local search procedure is applied. In addition, a path relinking procedure is developed to intensify the search. To evaluate the performance of PSO-EDA, extensive experiments were carried out on two sets of benchmark instances with 800 to 20000 vertices from the literature. Computational results and comparisons show that PSO-EDA significantly outperforms the existing PSO-based and EDA-based algorithms for the max-cut problem. Compared with other best performing algorithms, PSO-EDA is able to find very competitive results in terms of solution quality.<\/jats:p>","DOI":"10.1155\/2016\/3420671","type":"journal-article","created":{"date-parts":[[2016,2,18]],"date-time":"2016-02-18T18:09:49Z","timestamp":1455818989000},"page":"1-13","source":"Crossref","is-referenced-by-count":8,"title":["An Integrated Method Based on PSO and EDA for the Max-Cut Problem"],"prefix":"10.1155","volume":"2016","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[{"name":"Department of Mathematics, Minjiang University, Fuzhou 350108, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jian","family":"Guan","sequence":"additional","affiliation":[{"name":"Modern Educational Technology Center, Minjiang University, Fuzhou 350108, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.026"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9189-8"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623400382467"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000090033"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.12.006"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1080.0275"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-012-1133-2"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.05.060"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74769-7_33"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.07.012"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2012.09.001"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.04.033"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-007-9050-z"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1504\/ijbic.2015.069557"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIC.2014.066965"},{"key":"18","year":"2002"},{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/s13748-011-0005-3"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2013.05.018"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2010.07.014"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.02.032"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2010.12.014"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.09.104"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.02.032"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.12.010"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.11.012"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.08.051"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2012.06.001"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.11.058"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tc.2013.7"},{"key":"32","year":"1997"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1137\/s1052623497328987"},{"key":"34","year":"2005"}],"container-title":["Computational Intelligence and Neuroscience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2016\/3420671.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2016\/3420671.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/cin\/2016\/3420671.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T10:13:45Z","timestamp":1469528025000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.hindawi.com\/journals\/cin\/2016\/3420671\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":33,"alternative-id":["3420671","3420671"],"URL":"https:\/\/doi.org\/10.1155\/2016\/3420671","relation":{},"ISSN":["1687-5265","1687-5273"],"issn-type":[{"value":"1687-5265","type":"print"},{"value":"1687-5273","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}