{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T15:55:05Z","timestamp":1765382105719,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319694559"},{"type":"electronic","value":"9783319694566"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69456-6_34","type":"book-chapter","created":{"date-parts":[[2017,10,18]],"date-time":"2017-10-18T14:04:34Z","timestamp":1508335474000},"page":"409-425","source":"Crossref","is-referenced-by-count":3,"title":["Swap-Based Discrete Firefly Algorithm for\u00a0Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"How Siang","family":"Chuah","sequence":"first","affiliation":[]},{"given":"Li-Pei","family":"Wong","sequence":"additional","affiliation":[]},{"given":"Fadratul Hafinaz","family":"Hassan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,19]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Wong, L.P., Low, M.Y.H., Chong, C.S.: Bee colony optimization with local search for traveling salesman problem. In: Proceedings of 6th IEEE International Conference on Industrial Informatics, INDIN 2008, pp. 1019\u20131025 (2008)","DOI":"10.1109\/INDIN.2008.4618252"},{"key":"34_CR2","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem. Princeton University Press, Princeton (2007)"},{"issue":"2","key":"34_CR3","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498\u2013516 (1973)","journal-title":"Oper. Res."},{"issue":"1","key":"34_CR4","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Firefly algorithms for multimodal optimization. In: Proceedings of 5th International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2009, pp. 169\u2013178 (2009)","DOI":"10.1007\/978-3-642-04944-6_14"},{"key":"34_CR6","volume-title":"Nature-Inspired Optimization Algorithms","author":"XS Yang","year":"2010","unstructured":"Yang, X.S.: Nature-Inspired Optimization Algorithms. Luniver Press, Bristol (2010)"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Yang, X.S.: Metaheuristic optimization: algorithm analysis and open problems. In: Proceedings of 10th International Symposium on Experimental Algorithms, SEA 2011, pp. 21\u201332 (2011)","DOI":"10.1007\/978-3-642-20662-7_2"},{"key":"34_CR8","doi-asserted-by":"publisher","unstructured":"Jati, G.K., Suyanto: Evolutionary discrete firefly algorithm for travelling salesman problem. In: Bouchachia, A. (ed.) ICAIS 2011. LNCS, vol. 6943, pp. 393\u2013403. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-23857-4_38","DOI":"10.1007\/978-3-642-23857-4_38"},{"issue":"2","key":"34_CR9","first-page":"53","volume":"2","author":"SN Kumbharana","year":"2013","unstructured":"Kumbharana, S.N., Pandey, G.M.: Solving travelling salesman problem using firefly algorithm. Int. J. Res. Sci. Adv. Technol. 2(2), 53\u201357 (2013)","journal-title":"Int. J. Res. Sci. Adv. Technol."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Jati, G.K., Manurung, R., Suyanto: Discrete firefly algorithm for traveling salesman problem: a new movement scheme. In: Yang, X.S., Cui, Z., Xiao, R., Gandomi, A.H., Karamanoglu, M. (eds.) Swarm Intelligence and Bio-Inspired Computation, pp. 295\u2013312. Elsevier, Amsterdam (2013)","DOI":"10.1016\/B978-0-12-405163-8.00013-2"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Osaba, E., Carballedo, R., Diaz, F., Onieva, E., Lopez, P., Perallos, A.: On the influence of using initialization functions on genetic algorithms solving combinatorial optimization problems: a first study on the TSP. In: Proceedings of IEEE Conference on Evolving and Adaptive Intelligent Systems, EAIS 2014, pp. 1\u20136 (2014)","DOI":"10.1109\/EAIS.2014.6867465"},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","volume":"30","author":"M Mahi","year":"2015","unstructured":"Mahi, M., Baykan, \u00d6.K., Kodaz, H.: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl. Soft Comput. 30, 484\u2013490 (2015)","journal-title":"Appl. Soft Comput."},{"key":"34_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ins.2015.07.023","volume":"325","author":"BO Alijla","year":"2015","unstructured":"Alijla, B.O., Wong, L.P., Lim, C.P., Khader, A.T., Al-Betar, M.A.: An ensemble of intelligent water drop algorithms and its application to optimization problems. Inf. Sci. 325, 175\u2013189 (2015)","journal-title":"Inf. Sci."},{"issue":"03","key":"34_CR14","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1142\/S0218213010000200","volume":"19","author":"LP Wong","year":"2010","unstructured":"Wong, L.P., Low, M.Y.H., Chong, C.S.: Bee colony optimization with local search for traveling salesman problem. Int. J. Artif. Intell. Tools 19(03), 305\u2013334 (2010)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"T\u00fc\u0171-Szab\u00f3, B., F\u00f6ldesi, P., K\u00f3czy, L.T.: Improved discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. In: Proceedings of Computational Intelligence in Information Systems Conference, CIIS 2016, pp. 27\u201338 (2017)","DOI":"10.1007\/978-3-319-48517-1_3"},{"issue":"8","key":"34_CR16","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1002\/int.21893","volume":"32","author":"LT K\u00f3czy","year":"2017","unstructured":"K\u00f3czy, L.T., F\u00f6ldesi, P., T\u00fc\u0171-Szab\u00f3, B.: An effective discrete bacterial memetic evolutionary algorithm for the traveling salesman problem. Int. J. Intell. Syst. 32(8), 862\u2013876 (2017)","journal-title":"Int. J. Intell. Syst."},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.swevo.2013.06.001","volume":"13","author":"I Fister","year":"2013","unstructured":"Fister, I., Fister, I., Yang, X.S., Brest, J.: A comprehensive review of firefly algorithms. Swarm Evol. Comput. 13, 34\u201346 (2013)","journal-title":"Swarm Evol. Comput."},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Wong, L.P., Low, M.Y.H., Chong, C.S.: An efficient bee colony optimization algorithm for traveling salesman problem using frequency-based pruning. In: Proceedings of 7th IEEE International Conference on Industrial Informatics, INDIN 2009, pp. 775\u2013782 (2009)","DOI":"10.1109\/INDIN.2009.5195901"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-21434-9_2","volume-title":"Autonomous Search","author":"AE Eiben","year":"2012","unstructured":"Eiben, A.E., Smit, S.K.: Evolutionary algorithm parameters and methods to tune them. In: Hamadi, Y., Monfroy, E., Saubion, F. (eds.) Autonomous Search, pp. 15\u201336. Springer, Berlin Heidelberg (2012). doi: 10.1007\/978-3-642-21434-9_2"},{"issue":"7","key":"34_CR20","doi-asserted-by":"crossref","first-page":"1659","DOI":"10.1007\/s00521-013-1402-2","volume":"24","author":"A Ouaarab","year":"2014","unstructured":"Ouaarab, A., Ahiod, B., Yang, X.S.: Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7), 1659\u20131669 (2014)","journal-title":"Neural Comput. Appl."},{"issue":"7","key":"34_CR21","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1007\/s00521-015-1978-9","volume":"27","author":"Y Saji","year":"2016","unstructured":"Saji, Y., Riffi, M.E.: A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput. Appl. 27(7), 1853\u20131866 (2016)","journal-title":"Neural Comput. Appl."},{"key":"34_CR22","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang, Y.: The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput. Ind. Eng. 70, 124\u2013133 (2014)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Multi-disciplinary Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69456-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T03:03:25Z","timestamp":1603163005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69456-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694559","9783319694566"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69456-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}