{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:51:49Z","timestamp":1725576709176},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184659"},{"type":"electronic","value":"9783642184666"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18466-6_29","type":"book-chapter","created":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T21:38:15Z","timestamp":1296077895000},"page":"248-255","source":"Crossref","is-referenced-by-count":9,"title":["Start Strategies of ACO Applied on Subset Problems"],"prefix":"10.1007","author":[{"given":"Stefka","family":"Fidanova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krassimir","family":"Atanassov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pencho","family":"Marinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-36","author":"W. Diffe","year":"1976","unstructured":"Diffe, W., Hellman, M.E.: New direction in cryptography. IEEE Trans. Inf. Theory\u00a0IT-36, 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"29_CR3","unstructured":"Fidanova, S.: Evolutionary algorithm for multiple knapsack problem. In: Int. Conference Parallel Problems Solving from Nature, Real World Optimization Using Evolutionary Computing, Granada, Spain (2002) ISB 0-9543481-0-9"},{"key":"29_CR4","first-page":"498","volume-title":"Handbook of Research on Nature Inspired Computing for Economics ad Management","author":"S. Fidanova","year":"2006","unstructured":"Fidanova, S.: Ant colony optimization and multiple knapsack problem. In: Renard, J.P. (ed.) Handbook of Research on Nature Inspired Computing for Economics ad Management, pp. 498\u2013509. Idea Grup Inc., USA (2006)"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Lessing, L., Dumitrescu, I., Stutzle, T.: A comparison between ACO algorithms for the set covering problem. In: ANTS Workshop, pp. 1\u201312 (2004)","DOI":"10.1007\/978-3-540-28646-2_1"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/mnsc.30.6.765","volume":"30","author":"S. Martello","year":"1984","unstructured":"Martello, S., Toth, P.: A mixtures of dynamic programming and branch-and-bound for the subset-sum problem. Management Science\u00a030, 756\u2013771 (1984)","journal-title":"Management Science"},{"key":"29_CR7","unstructured":"Reiman, M., Laumanns, M.: A hybrid ACO algorithm for the capacitate minimum spanning tree problem. In: Workshop on Hybrid Metahuristics, Valencia, Spain, pp. 1\u201310 (2004)"},{"key":"29_CR8","first-page":"503","volume":"27","author":"A. Sinha","year":"1979","unstructured":"Sinha, A., Zoltner, A.A.: The multiple-choice knapsack problem. J. Operational Research\u00a027, 503\u2013515 (1979)","journal-title":"J. Operational Research"},{"key":"29_CR9","first-page":"163","volume-title":"Evolutionary Algorithms in Engineering and Computer Science","author":"T. Stutzle","year":"1999","unstructured":"Stutzle, T., Dorigo, M.: ACO algorithm for the traveling salesman problem. In: Miettinen, K., Makela, M., Neittaanmaki, P., Periaux, J. (eds.) Evolutionary Algorithms in Engineering and Computer Science, pp. 163\u2013183. Wiley, Chichester (1999)"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1109\/ISDA.2006.83","volume-title":"Conference on Intelligent Systems Design and Applications","author":"T. Zhang","year":"2006","unstructured":"Zhang, T., Wang, S., Tian, W., Zhang, Y.: ACO-VRPTWRV: A new algorithm for the vehicle routing problems with time windows and re-used vehicles based on ant colony optimization. In: Conference on Intelligent Systems Design and Applications, pp. 390\u2013395. IEEE press, Los Alamitos (2006)"}],"container-title":["Lecture Notes in Computer Science","Numerical Methods and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18466-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T21:14:33Z","timestamp":1553375673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18466-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184659","9783642184666"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18466-6_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}