{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T03:06:45Z","timestamp":1743044805152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031180491"},{"type":"electronic","value":"9783031180507"}],"license":[{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,10,12]],"date-time":"2022-10-12T00:00:00Z","timestamp":1665532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-18050-7_9","type":"book-chapter","created":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T19:02:55Z","timestamp":1665514975000},"page":"89-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Hybrid Discrete Symbiotic Organisms Search Algorithm and List-Based Simulated Annealing Algorithm for Traveling Salesman Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9865-8529","authenticated-orcid":false,"given":"Vladimir","family":"Ilin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7392-9767","authenticated-orcid":false,"given":"Dragan","family":"Simi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5969-6821","authenticated-orcid":false,"given":"Marko","family":"Veli\u010dkovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3063-7593","authenticated-orcid":false,"given":"Nemanja","family":"Garunovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,12]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1080\/0305215X.2019.1579804","volume":"52","author":"U Boryczka","year":"2020","unstructured":"Boryczka, U., Szwarc, K.: An effective hybrid harmony search for the asymmetric travelling salesman problem. Eng. Optim. 52(2), 218\u2013234 (2020)","journal-title":"Eng. Optim."},{"issue":"15","key":"9_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"MY Cheng","year":"2014","unstructured":"Cheng, M.Y., Prayogo, D.: Symbiotic organisms search: a new metaheuristic optimization algorithm. Comput. Struct. 139(15), 98\u2013112 (2014)","journal-title":"Comput. Struct."},{"issue":"30","key":"9_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.eswa.2017.06.007","volume":"87","author":"AES Ezugwu","year":"2017","unstructured":"Ezugwu, A.E.S., Adewumi, A.O.: Discrete symbiotic organisms search algorithm for travel-ling salesman problem. Expert Syst. Appl. 87(30), 70\u201378 (2017)","journal-title":"Expert Syst. Appl."},{"key":"9_CR4","unstructured":"Ilin, V., Matijevic, L., Davidovic, T., Pardalos, P.M.: Asymmetric capacitated vehicle routing problem with time window. In: Proc. XLV Symposium on Operations Research, SYM-OP-IS 2018, pp. 174\u2013179. Faculty of Economics in Belgrade (2018)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ilin, V., Simi\u0107, D., Simi\u0107, D.S., Simi\u0107, S., Sauli\u0107, N., Calvo-Rolle, J.L.: A hybrid genetic al-gorithm, list-based simulated annealing algorithm, and different heuristic algorithms for travelling salesman problem, Log. J. IGPL (2022, in press)","DOI":"10.1093\/jigpal\/jzac028"},{"key":"9_CR6","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-57802-2_51","volume-title":"15th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2020)","author":"V Ilin","year":"2021","unstructured":"Ilin, V., Simi\u0107, D., Simi\u0107, S.D., Simi\u0107, S.: Hybrid genetic algorithms and tour construction and improvement algorithms used for optimizing the traveling salesman problem. In: Herrero, \u00c1., Cambra, C., Urda, D., Sedano, J., Quinti\u00e1n, H., Corchado, E. (eds.) SOCO 2020. AISC, vol. 1268, pp. 530\u2013539. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-57802-2_51"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-319-19644-2_53","volume-title":"Hybrid Artificial Intelligent Systems","author":"V Ilin","year":"2015","unstructured":"Ilin, V., Simi\u0107, D., Tepi\u0107, J., Stoji\u0107, G., Sauli\u0107, N.: A survey of hybrid artificial intelligence algorithms for dynamic vehicle routing problem. In: Onieva, E., Santos, I., Osaba, E., Quinti\u00e1n, H., Corchado, E. (eds.) HAIS 2015. LNCS (LNAI), vol. 9121, pp. 644\u2013655. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19644-2_53"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp, R.M.: On the computational complexity of combinatorial problems. Networks 5(1), 45\u201368 (1975)","journal-title":"Networks"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"107199","DOI":"10.1016\/j.knosys.2021.107199","volume":"227","author":"SK Rajesh Kanna","year":"2021","unstructured":"Rajesh Kanna, S.K., Sivakumar, K., Lingaraj, N.: Development of deer hunting linked earthworm optimization algorithm for solving large scale traveling salesman problem. Knowl-Based Syst. 227, 107199 (2021)","journal-title":"Knowl-Based Syst."},{"key":"9_CR10","unstructured":"Reinelt, G.: TSPLIB. http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/. Last Accessed 05 Apr 2022"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Rosenkrantz, D., Stearns, R., Lewis, P.: Approximate algorithms for the traveling salesper-son problem. In: Proceedings of the 15th Annual IEEE Symposium of Switching and Au-tomata Theory, pp. 33\u201342. IEEE (1974)","DOI":"10.1109\/SWAT.1974.4"},{"issue":"4","key":"9_CR12","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1504\/IJCSM.2015.071818","volume":"6","author":"CY Wang","year":"2015","unstructured":"Wang, C.Y., Lin, M., Zhong, Y.W., Zhang, H.: Solving travelling salesman problem using multiagent simulated annealing algorithm with instance-based sampling. Int. J. Comput. Sci. Math. 6(4), 336\u2013353 (2015)","journal-title":"Int. J. Comput. Sci. Math."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cie.2019.04.008","volume":"131","author":"Y Wang","year":"2019","unstructured":"Wang, Y., Wu, Y.W., Xu, N.: Discrete symbiotic organism search with excellence coeffi-cients and self-escape for traveling salesman problem. Comput. Ind. Eng. 131, 269\u2013281 (2019)","journal-title":"Comput. Ind. Eng."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2016\/1712630","volume":"2016","author":"SH Zhan","year":"2016","unstructured":"Zhan, S.H., Lin, J., Zhang, Z.J., Zhong, Y.W.: List-based simulated annealing algorithm for traveling salesman problem. Comput. Intell. Neurosci. 2016, 1\u201312 (2016)","journal-title":"Comput. Intell. Neurosci."}],"container-title":["Lecture Notes in Networks and Systems","17th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2022)"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-18050-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T19:04:02Z","timestamp":1665515042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-18050-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,12]]},"ISBN":["9783031180491","9783031180507"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-18050-7_9","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022,10,12]]},"assertion":[{"value":"12 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Soft Computing Models in Industrial and Environmental Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bilbao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"socomoin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2022.sococonference.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}