{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:53:00Z","timestamp":1743051180423,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417733"},{"type":"electronic","value":"9783031417740"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41774-0_39","type":"book-chapter","created":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T03:25:20Z","timestamp":1695266720000},"page":"495-507","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A New Ant Population Based Improvement Heuristic for\u00a0Solving Large Scale TSP"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6557-5794","authenticated-orcid":false,"given":"Samia","family":"Sammoud","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7037-3326","authenticated-orcid":false,"given":"Ines","family":"Alaya","sequence":"additional","affiliation":[]},{"given":"Moncef","family":"Tagina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,22]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Stutzle, S.: Ant colony optimization: overview and recent advances. In: Handbook of Metaheuristics, pp. 311\u2013351 (2019)","DOI":"10.1007\/978-3-319-91086-4_10"},{"key":"39_CR2","unstructured":"Li, D., Sun, H.X.: An application research of TSP based on genetic algorithm. In: Science Technology of Heilongjiang Province, vol. 13, p. 27 (2009)"},{"issue":"2","key":"39_CR3","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"LM Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, D., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167\u2013176 (1999). https:\/\/doi.org\/10.1057\/palgrave.jors.2600676","journal-title":"J. Oper. Res. Soc."},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R.F., Strauss, C.: An improved ant system algorithm for the vehicle routing problem. Ann. Oper. Res. 89, 319\u2013328 (1999). https:\/\/doi.org\/10.1023\/A:1018940026670","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"39_CR5","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s10589-014-9719-z","volume":"61","author":"P Balaprakash","year":"2015","unstructured":"Balaprakash, P., Birattari, M., Sttzle, T., Marco, D.: Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers. Comput. Optim. Appl. 61(2), 463\u2013487 (2015). https:\/\/doi.org\/10.1007\/s10589-014-9719-z","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"39_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L Bianchi","year":"2006","unstructured":"Bianchi, L., et al.: Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J. Math. Model. Algorithms 5(1), 91\u2013110 (2006). https:\/\/doi.org\/10.1007\/s10852-005-9033-y","journal-title":"J. Math. Model. Algorithms"},{"key":"39_CR7","doi-asserted-by":"publisher","unstructured":"Zouari, W., Alaya, I., Tagina, M.: A hybrid ant colony algorithm with a local search for the strongly correlated knapsack problem. In: IEEE\/ACS 14th International Conference on Computer Systems and Applications (AICCSA), pp. 527\u2013533 (2017). https:\/\/doi.org\/10.1109\/AICCSA.2017.61","DOI":"10.1109\/AICCSA.2017.61"},{"key":"39_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s12065-019-00222-9","volume":"12","author":"IB Mansour","year":"2019","unstructured":"Mansour, I.B., Alaya, I., Tagina, M.: A gradual weight-based ant colony approach for solving the multiobjective multidimensional knapsack problem. Evol. Intell. 12, 253\u2013272 (2019). https:\/\/doi.org\/10.1007\/s12065-019-00222-9","journal-title":"Evol. Intell."},{"key":"39_CR9","doi-asserted-by":"publisher","unstructured":"Alaya, I., Solnon, C., Ghedira, K.: Ant colony optimization for multi-objective optimization problems. In: IEEE 19th International Conference on Tools with Artificial Intelligence (ICTAI), pp. 450\u2013457 (2007). https:\/\/doi.org\/10.1109\/ICTAI.2007.108","DOI":"10.1109\/ICTAI.2007.108"},{"key":"39_CR10","doi-asserted-by":"publisher","unstructured":"Blum, C., Sampels, M.: Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002 (Cat. No.02TH8600), vol. 2, pp. 1558\u20131563 (2002). https:\/\/doi.org\/10.1109\/CEC.2002.1004474","DOI":"10.1109\/CEC.2002.1004474"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-09952-1_13","volume-title":"Swarm Intelligence","author":"S Fernandez","year":"2014","unstructured":"Fernandez, S., Alvarez, S., D\u00edaz, D., Iglesias, M., Ena, B.: Scheduling a galvanizing line by ant colony optimization. In: Dorigo, M., et al. (eds.) ANTS 2014. LNCS, vol. 8667, pp. 146\u2013157. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09952-1_13"},{"key":"39_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/3-540-45356-3_60","volume-title":"Parallel Problem Solving from Nature PPSN VI","author":"M den Besten","year":"2000","unstructured":"den Besten, M., St\u00fctzle, T., Dorigo, M.: Ant colony optimization for the total weighted tardiness problem. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 611\u2013620. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45356-3_60"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Reinelt, G.: Benchmark-TSPLIB: a traveling salesman problem library. ORSA J. Comput. (1991). http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/","DOI":"10.1287\/ijoc.3.4.376"},{"issue":"1","key":"39_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, M., Colorni, V.: The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. B 26(1), 1\u201313 (1996)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"issue":"8","key":"39_CR15","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Sttzle","year":"2000","unstructured":"Sttzle, T., Hoos, H.H.: MAX-MIN ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000). https:\/\/doi.org\/10.1016\/S0167-739X(00)00043-1","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"39_CR16","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). https:\/\/doi.org\/10.1109\/4235.585892","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"39_CR17","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791\u2013812 (1958). https:\/\/doi.org\/10.1287\/opre.6.6.791","journal-title":"Oper. Res."},{"key":"39_CR18","doi-asserted-by":"publisher","unstructured":"Sammoud, S., Alaya, I.: A new ant colony optimization metaheuristic based on pheromone guided local search instead of constructive approach. In: Genetic and Evolutionary Computation Conference (GECCO 2022), Boston, MA, USA, p. 9. ACM, New York (2022). https:\/\/doi.org\/10.1145\/3512290.3528733","DOI":"10.1145\/3512290.3528733"},{"key":"39_CR19","doi-asserted-by":"publisher","unstructured":"Kafadar, K., Sheskin, D.J.: Handbook of Parametric and Nonparametric Statistical Procedures, 5th edn. Chapman and Hall\/CRC (2007). https:\/\/doi.org\/10.1201\/9780429186196","DOI":"10.1201\/9780429186196"},{"key":"39_CR20","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-66939-7_9","volume-title":"Advances in Computational Intelligence Systems","author":"DM Chitty","year":"2018","unstructured":"Chitty, D.M.: Applying ACO to large scale TSP instances. In: Chao, F., Schockaert, S., Zhang, Q. (eds.) UKCI 2017. AISC, vol. 650, pp. 104\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-66939-7_9"},{"key":"39_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-319-41000-5_54","volume-title":"Advances in Swarm Intelligence","author":"JJ Xue","year":"2016","unstructured":"Xue, J.J., Wang, Y., Li, H., Xiao, J.Y.: Discrete fireworks algorithm for aircraft mission planning. In: Tan, Y., Shi, Y., Niu, B. (eds.) ICSI 2016. LNCS, vol. 9712, pp. 544\u2013551. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41000-5_54"}],"container-title":["Communications in Computer and Information Science","Advances in Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41774-0_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,21]],"date-time":"2023-09-21T06:35:10Z","timestamp":1695278110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41774-0_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417733","9783031417740"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41774-0_39","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Budapest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2023\/","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":"218","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":"59","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":"27% - 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":"3.01","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":"1.86","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)"}}]}}