{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:24:56Z","timestamp":1725575096759},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1109\/imcsit.2010.5679734","type":"proceedings-article","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T02:53:32Z","timestamp":1418439212000},"page":"887-891","source":"Crossref","is-referenced-by-count":0,"title":["ACO with semi-random start applied on MKP"],"prefix":"10.1109","author":[{"given":"S","family":"Fidanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P","family":"Marinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K","family":"Atanassov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/b99492","author":"dorigo","year":"2004","journal-title":"Ant Colony Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"key":"ref10","first-page":"163","article-title":"ACO Algorithm for the Traveling Salesman Problem","author":"stutzle","year":"1999","journal-title":"Evolutionary Algorithms in Engineering and Computer Science"},{"key":"ref6","first-page":"498","article-title":"Ant colony optimization and multiple knapsack problem","author":"fidanova","year":"2006","journal-title":"Handbook of Research on Nature-Inspired Computing for Economics and Management"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-739X(00)00043-1"},{"key":"ref5","article-title":"Evolutionary Algorithm for Multiple Knapsack Problem","author":"fidanova","year":"0","journal-title":"Int Conference Parallel Problems Solving from Nature Real World Optimization Using Evolutionary Computing"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISDA.2006.83"},{"key":"ref8","first-page":"1","article-title":"A Hybrid ACO algorithm for the Capacitate Minimum Spanning Tree Problem","author":"reiman","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.30.6.765"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.27.3.503"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195131581.001.0001","author":"bonabeau","year":"1999","journal-title":"Swarm Intelligence From Natural to Artificial Systems"}],"event":{"name":"2010 International Multiconference on Computer Science and Information Technology (IMCSIT 2010)","start":{"date-parts":[[2010,10,18]]},"location":"Wisla","end":{"date-parts":[[2010,10,20]]}},"container-title":["Proceedings of the International Multiconference on Computer Science and Information Technology"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5676244\/5679615\/05679734.pdf?arnumber=5679734","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,24]],"date-time":"2022-04-24T10:42:05Z","timestamp":1650796925000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5679734\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/imcsit.2010.5679734","relation":{},"subject":[],"published":{"date-parts":[[2010,10]]}}}