{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T12:52:21Z","timestamp":1726059141793},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_14","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"202-218","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o P.","family":"Schmitt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael S.","family":"Parpinelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano","family":"Baldo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"key":"14_CR1","unstructured":"Ant Colony Optimization. \nhttp:\/\/www.aco-metaheuristic.org\/\n\n. Accessed 8 Feb 2019"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","volume":"99","author":"K Braekers","year":"2016","unstructured":"Braekers, K., Ramaekers, K., Van Nieuwenhuyse, I.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99, 300\u2013313 (2016)","journal-title":"Comput. Ind. Eng."},{"key":"14_CR3","first-page":"368","volume":"6","author":"S Chowdhury","year":"2018","unstructured":"Chowdhury, S., Marufuzzaman, M., Tunc, H., Bian, L., Bullington, W.: A modified ant colony optimization algorithm to solve a dynamic traveling salesman problem: a case study with drones for wildlife surveillance. J. Comput. Des. Eng. 6, 368\u2013386 (2018)","journal-title":"J. Comput. Des. Eng."},{"key":"14_CR4","volume-title":"Introduction to Algorithms","author":"T Cormen","year":"2009","unstructured":"Cormen, T.: Introduction to Algorithms. MIT Press, Cambridge (2009)"},{"key":"14_CR5","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1290.001.0001","volume-title":"Ant Colony Optimization","author":"M Dorigo","year":"2004","unstructured":"Dorigo, M., Stutzle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"29","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 (Cybern.) 26, 29\u201341 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B (Cybern.)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New insertion and postoptimization procedures for the traveling salesman problem. Oper. Res. 40, 1086\u20131094 (1992)","journal-title":"Oper. Res."},{"key":"14_CR8","series-title":"Combinatorial Optimization","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/0-306-48213-4_10","volume-title":"The Traveling Salesman Problem and Its Variations, Combinatorial Optimization","author":"D Johnson","year":"2007","unstructured":"Johnson, D., Gutin, G., McGeoch, L., Yeo, A., Zhang, W., Zverovitch, A.: Experimental analysis of heuristics for the ATSP. In: Gutin, G., Punnen, A.P. (eds.) The Traveling Salesman Problem and Its Variations, Combinatorial Optimization. Combinatorial Optimization, vol. 12, pp. 445\u2013487. Springer, Boston (2007). \nhttps:\/\/doi.org\/10.1007\/0-306-48213-4_10"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0167-6377(83)90048-2","volume":"2","author":"R Jonker","year":"1983","unstructured":"Jonker, R., Volgenant, T.: Transforming asymmetric into symmetric traveling salesman problems. Oper. Res. Lett. 2, 161\u2013163 (1983)","journal-title":"Oper. Res. Lett."},{"key":"14_CR10","unstructured":"Larsen, A.: The dynamic vehicle routing problem. Ph.D. thesis, Technical University of Denmark, Kongens, Lyngby, Denmark (2000)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TCYB.2016.2556742","volume":"47","author":"M Mavrovouniotis","year":"2017","unstructured":"Mavrovouniotis, M., Muller, F., Yang, S.: Ant colony optimization with local search for dynamic traveling salesman problems. IEEE Trans. Cybern. 47, 1743\u20131756 (2017)","journal-title":"IEEE Trans. Cybern."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-642-20525-5_33","volume-title":"Applications of Evolutionary Computation","author":"M Mavrovouniotis","year":"2011","unstructured":"Mavrovouniotis, M., Yang, S.: Memory-based immigrants for ant colony optimization in changing environments. In: Di Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6624, pp. 324\u2013333. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-20525-5_33"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Mavrovouniotis, M., Yang, S.: Interactive and non-interactive hybrid immigrants schemes for ant algorithms in dynamic environments. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 1542\u20131549 (2014)","DOI":"10.1109\/CEC.2014.6900481"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1016\/j.asoc.2013.05.022","volume":"13","author":"M Mavrovouniotis","year":"2013","unstructured":"Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes for the dynamic travelling salesman problem with traffic factors. Appl. Soft Comput. 13, 4023\u20134037 (2013)","journal-title":"Appl. Soft Comput."},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-642-15871-1_38","volume-title":"Parallel Problem Solving from Nature, PPSN XI","author":"M Mavrovouniotis","year":"2010","unstructured":"Mavrovouniotis, M., Yang, S.: Ant colony optimization with immigrants schemes in dynamic environments. In: Schaefer, R., Cotta, C., Ko\u0142odziej, J., Rudolph, G. (eds.) PPSN 2010. LNCS, vol. 6239, pp. 371\u2013380. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15871-1_38"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJBIC.2019.097731","volume":"13","author":"RS Parpinelli","year":"2019","unstructured":"Parpinelli, R.S., Plichoski, G.F., Silva, R., Narloch, P.H.: A review of techniques for on-line control of parameters in swarm intelligence and evolutionary computation algorithms. Int. J. Bio-Inspired Comput. 13(1), 1\u201320 (2019)","journal-title":"Int. J. Bio-Inspired Comput."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.: A review of dynamic vehicle routing problems. Eur. J. Oper. Res. 225, 1\u201311 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Pedro Schmitt, J., Baldo, F., Stubs Parpinelli, R.: A MAX-MIN ant system with short-term memory applied to the dynamic and asymmetric traveling salesman problem. In: 2018 7th Brazilian Conference on Intelligent Systems (BRACIS), pp. 1\u20136 (2018)","DOI":"10.1109\/BRACIS.2018.00009"},{"key":"14_CR20","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min - ant system. Future Gener. Comput. Syst. 16, 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"14_CR21","unstructured":"Stutzle, T., Hoos, H.: MAX-MIN ant system and local search for the traveling salesman problem. In: Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 309\u2013314 (1997)"},{"key":"14_CR22","unstructured":"TSPLIB. \nhttps:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/\n\n. Accessed 8 Feb 2019"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Wu, Y., Weise, T., Chiong, R.: Local search for the traveling salesman problem: a comparative study. In: 2015 IEEE 14th International Conference on Cognitive Informatics & Cognitive Computing (ICC&ICC), pp. 213\u2013220 (2015)","DOI":"10.1109\/ICCI-CC.2015.7259388"}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:09:10Z","timestamp":1573700950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}