{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:02:45Z","timestamp":1762430565414},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238567"},{"type":"electronic","value":"9783642238574"}],"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-23857-4_38","type":"book-chapter","created":{"date-parts":[[2011,9,23]],"date-time":"2011-09-23T23:46:40Z","timestamp":1316821600000},"page":"393-403","source":"Crossref","is-referenced-by-count":112,"title":["Evolutionary Discrete Firefly Algorithm for Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Gilang Kusuma","family":"Jati","sequence":"first","affiliation":[]},{"family":"Suyanto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"38_CR1","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"B. Luciana","year":"2004","unstructured":"Luciana, B., Fran\u00e7a, P.M., Pablo, M.: A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem. Journal of Heuristics\u00a010(5), 483\u2013506 (2004)","journal-title":"Journal of Heuristics"},{"key":"38_CR2","unstructured":"Lukasik, S., \u017bak, S.: Firefly algorithm for Continuous Constrained Optimisation Tasks. Systems Research Institute, Polish. Academy of Sciences, pp. 1\u201310 (2010)"},{"key":"38_CR3","doi-asserted-by":"crossref","unstructured":"Niasar, N.S., Shanbezade, J., Perdam, M.M.: Discrete Fuzzy Particle Swarm Optimization for Solving Travelling Salesman Problem. In: Proceedingsof International Conference on Information and Financial Engineering, pp. 162\u2013165 (2009)","DOI":"10.1109\/ICIFE.2009.37"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45724-0_28","volume-title":"Ant Algorithms","author":"M.L. Pilat","year":"2002","unstructured":"Pilat, M.L., White, T.: Using Genetic Algorithms to Optimize ACS-TSP. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 12\u201314. Springer, Heidelberg (2002)"},{"issue":"1","key":"38_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5267\/j.ijiec.2010.01.001","volume":"1","author":"M.K. Sayadi","year":"2010","unstructured":"Sayadi, M.K.: A Discrete Meta-Heuristic With Local Search for Makespan Minimization in Permutation Flow Shop Scheduling Problems. International Journal of Industrial Engineering Computation\u00a01(1), 1\u201310 (2010)","journal-title":"International Journal of Industrial Engineering Computation"},{"key":"38_CR6","unstructured":"TSPLIB95: Ruprecht - Karls - Universitat Heildelberg (2011), http:\/\/www.iwr.uini-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"},{"key":"38_CR7","unstructured":"Yang, X.S.: Nature-inspired Metaheuristic Algorithm. Luniver Press (2008)"},{"key":"38_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-04944-6_14","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"X.S. Yang","year":"2009","unstructured":"Yang, X.S.: Firefly Algorithms for Multimodal Optimization. In: Watanabe, O., Zeugmann, T. (eds.) SAGA 2009. LNCS, vol.\u00a05792, pp. 169\u2013178. Springer, Heidelberg (2009)"},{"key":"38_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470640425","volume-title":"Engineering Optimization: An Introduction with Metaheuristic Applications","author":"X.S. Yang","year":"2010","unstructured":"Yang, X.S.: Engineering Optimization: An Introduction with Metaheuristic Applications. Wiley, Chichester (2010)"},{"key":"38_CR10","doi-asserted-by":"crossref","unstructured":"Tsai, H., Yang, J., Tsai, Y., Kao, C.: An Evolutionary Algorithm for Large Traveling Salesman Problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 1718\u20131729 (2004)","DOI":"10.1109\/TSMCB.2004.828283"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Wong, L., Chong, C.S.: An Efficient Bee Colony Optimization Algorithm for Travelling Salesman Problem Using Frequency-Based Pruning. In: Proceedings of 7th IEEE International Conference on Industrial Informatics, pp. 775\u2013782 (2009)","DOI":"10.1109\/INDIN.2009.5195901"}],"container-title":["Lecture Notes in Computer Science","Adaptive and Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23857-4_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T09:12:02Z","timestamp":1560676322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23857-4_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238567","9783642238574"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23857-4_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}