{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:50:41Z","timestamp":1750308641243,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319590592"},{"type":"electronic","value":"9783319590608"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59060-8_58","type":"book-chapter","created":{"date-parts":[[2017,5,23]],"date-time":"2017-05-23T08:42:30Z","timestamp":1495528950000},"page":"645-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A DSS Based on Hybrid Ant Colony Optimization Algorithm for the TSP"],"prefix":"10.1007","author":[{"given":"Islem","family":"Kaabachi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorra","family":"Jriji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saoussen","family":"Krichen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,24]]},"reference":[{"key":"58_CR1","unstructured":"Lawler, E.L., Lenstra, J.K., Kan Rinnooy, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, vol. 11, pp. 201\u2013209. Wiley, Chichester (1985)"},{"key":"58_CR2","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeoch, L.A.: The Travelling Salesman Problem: A Case Study in Local Optimization. In: Aarts, E.H.L., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. Wiley (1997)","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"58_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"The Traveling Salesman: Computational Solutions for TSP Applications","author":"G Reinelt","year":"1994","unstructured":"Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. LNCS, vol. 840. Springer, Heidelberg (1994)"},{"key":"58_CR4","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, USA (2007)"},{"key":"58_CR5","unstructured":"Arananayakgi, A.: Reduce total distance and time using genetic algorithm in Traveling Salesman Problem. Int. J. Comput. Sci. Eng. Technol. 5(08) (2014). ISSN 2229\u20133345"},{"key":"58_CR6","doi-asserted-by":"crossref","unstructured":"Zhong, W.L., Zhang, J., Chen, W.N.: A novel discrete particle swarm optimization to solve traveling salesman problem. In: IEEE Congress on Evolutionary Computation, pp. 3283\u20133287 (2007)","DOI":"10.1109\/CEC.2007.4424894"},{"key":"58_CR7","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1016\/0305-0548(94)90016-7","volume":"21","author":"J Knox","year":"1994","unstructured":"Knox, J.: Tabu search performance on the symmetric traveling salesman problem. Comput. Oper. Res. 21, 867\u2013876 (1994)","journal-title":"Comput. Oper. Res."},{"key":"58_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0377-2217(97)00289-0","volume":"106","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Laporte, G., Semet, F.: A tabu search heuristic for the undirected selective travelling salesman problem. Eur. J. Oper. Res. 106, 539\u2013545 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"58_CR9","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0167-8191(89)90106-3","volume":"10","author":"JRA Allwright","year":"1989","unstructured":"Allwright, J.R.A., Carpenter, D.B.: A distributed implementation of simulated annealing for the traveling salesman problem. Parallel Comput. 10, 335\u2013338 (1989)","journal-title":"Parallel Comput."},{"key":"58_CR10","doi-asserted-by":"publisher","first-page":"3680","DOI":"10.1016\/j.asoc.2011.01.039","volume":"11","author":"X Geng","year":"2011","unstructured":"Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11, 3680\u20133689 (2011)","journal-title":"Appl. Soft Comput."},{"key":"58_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0360-8352(02)00179-1","volume":"44","author":"H Ghaziri","year":"2003","unstructured":"Ghaziri, H., Osman, I.H.: A neural network algorithm for the traveling salesman problem with backhauls. Comput. Ind. Eng. 44, 267\u2013281 (2003)","journal-title":"Comput. Ind. Eng."},{"key":"58_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.neucom.2004.02.006","volume":"62","author":"KS Leung","year":"2004","unstructured":"Leung, K.S., Jin, H.D., Xu, Z.B.: An expanding self-organizing neural network for the traveling salesman problem. Neurocomputing 62, 267\u2013292 (2004)","journal-title":"Neurocomputing"},{"key":"58_CR13","unstructured":"Pang, W., Wang, K.P., Zhou, C.G., Dong, L.J., Liu, M., Zhang, H.Y., Wang, J.Y.: Modified particle swarm optimization based on space transformation for solving traveling salesman problem. In: Proceedings of the 33rd International Conference on Machine Learning and Cybernetics, pp. 2342\u20132346 (2004)"},{"key":"58_CR14","doi-asserted-by":"crossref","unstructured":"Wang, C., Zhang, J., Yang, J., Hu, C., Liu, J.: A modified particle swarm optimization algorithm and its application for solving traveling salesman problem. In: International Conference on Neural Networks and Brain, vol. 2, pp. 689\u2013694 (2005)","DOI":"10.1109\/ICNNB.2005.1614723"},{"key":"58_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","volume":"103","author":"XH Shi","year":"2007","unstructured":"Shi, X.H., Liang, Y.C., Lee, H.P., Lu, C., Wang, Q.X.: Particle swarm optimization based algorithms for TSP and generalized TSP. Inf. Process. Lett. 103, 169\u2013176 (2007)","journal-title":"Inf. Process. Lett."},{"key":"58_CR16","doi-asserted-by":"crossref","unstructured":"Stutzle, T., Hoos, H.H.: Improvements on the ant system: introducing the MAX-MIN ant system. In Albrecht, R.F., Smith, G.D., Steele, N.C. (eds.) Artificial Neural Networks and Genetic Algorithms, pp. 245\u2013249. Springer, Wien (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"58_CR17","doi-asserted-by":"crossref","unstructured":"Gambardella L. and M. Dorigo. Ant-Q: A Reinforcement Learning approach to the traveling salesman problem. In: Prieditis, A., Russell, S. (eds.) Proceedings of Twelfth International Conference on Machine Learning, ML 1995, Tahoe City, CA, pp. 252\u2013260. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50039-6"},{"issue":"1","key":"58_CR18","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 Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"58_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B 26(1), 1\u201313 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"58_CR20","doi-asserted-by":"publisher","first-page":"2015","DOI":"10.3906\/elk-1109-44","volume":"21","author":"M Peker","year":"2013","unstructured":"Peker, M., Sen, B., Kumru, P.Y.: An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method. Turk. J. Electr. Eng. Comput. 21, 2015\u20132036 (2013)","journal-title":"Turk. J. Electr. Eng. Comput."},{"key":"58_CR21","doi-asserted-by":"publisher","DOI":"10.3906\/elk-1210-147","author":"M Gunduz","year":"2014","unstructured":"Gunduz, M., Kiran, M.S., Ozceylan, E.: A hierarchic approach based on swarm intelligence to solve traveling salesman problem. Turk. J. Electr. Eng. Comput. Sci. (2014). doi:10.3906\/elk-1210-147","journal-title":"Turk. J. Electr. Eng. Comput. Sci."},{"key":"58_CR22","doi-asserted-by":"publisher","first-page":"1454","DOI":"10.1016\/j.ins.2008.12.016","volume":"179","author":"TAS Masutti","year":"2009","unstructured":"Masutti, T.A.S., de Castro, L.N.: A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem. Inf. Sci. 179, 1454\u20131468 (2009)","journal-title":"Inf. Sci."},{"key":"58_CR23","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.egypro.2012.02.101","volume":"17","author":"K Jun-man","year":"2012","unstructured":"Jun-man, K., Yi, Z.: Application of an improved ant colony optimization on generalized traveling salesman problem. Energy Proc. 17, 319\u2013325 (2012)","journal-title":"Energy Proc."},{"issue":"1","key":"58_CR24","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.ejor.2006.03.041","volume":"180","author":"C Garcia-Martinez","year":"2007","unstructured":"Garcia-Martinez, C., Cordon, O., Herrera, F.: A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP. Eur. J. Oper. Res. 180(1), 116\u2013148 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"58_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-15871-1_53","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"J Tavares","year":"2010","unstructured":"Tavares, J., Pereira, F.B.: Evolving strategies for updating pheromone trails: a case study with the TSP. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 523\u2013532. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-15871-1_53"},{"key":"58_CR26","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1080\/00207540600597088","volume":"44","author":"HD Pour","year":"2006","unstructured":"Pour, H.D., Nosraty, M.: Solving the facility layout and location problem by ant-colony optimization-meta heuristic. Int. J. Prod. Res. 44, 5187\u20135196 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"58_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11892960_50","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"L Bouhafs","year":"2006","unstructured":"Bouhafs, L., hajjam, A., Koukam, A.: A combination of simulated annealing and ant colony system for the capacitated location-routing problem. In: Gabrys, B., Howlett, R.J., Jain, L.C. (eds.) KES 2006. LNCS, vol. 4251, pp. 409\u2013416. Springer, Heidelberg (2006). doi:10.1007\/11892960_50"},{"key":"58_CR28","doi-asserted-by":"crossref","unstructured":"Altiparmak, F., Karaoglan, I.: A genetic ant colony optimization approach for concave cost transportation problems. In: IEEE Congress on Evolutionary Computation, CEC 2007, pp. 1685\u20131692 (2007)","DOI":"10.1109\/CEC.2007.4424676"},{"key":"58_CR29","unstructured":"TSPLIB. http:\/\/www.iwr.uniheidelberg.de\/groups\/comopt\/software\/TSPLIB95\/"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59060-8_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:15:59Z","timestamp":1750274159000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59060-8_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319590592","9783319590608"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59060-8_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"24 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}