{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T14:51:55Z","timestamp":1744210315554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030787424"},{"type":"electronic","value":"9783030787431"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78743-1_29","type":"book-chapter","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T23:07:50Z","timestamp":1625612870000},"page":"322-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Slime Mold Fractional-Order Ant Colony Optimization Algorithm for\u00a0Travelling Salesman Problems"],"prefix":"10.1007","author":[{"given":"Ziheng","family":"Rong","sequence":"first","affiliation":[]},{"given":"Xiaoling","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Xiangyu","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,7]]},"reference":[{"key":"29_CR1","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. 2(23), 555\u2013565 (1979)"},{"issue":"2","key":"29_CR2","first-page":"193","volume":"4","author":"G Gutin","year":"2007","unstructured":"Gutin, G., Punnen, A.: The traveling salesman problem and its variations. Paradigms Comb. Optim. Probl. 4(2), 193\u2013205 (2007)","journal-title":"Paradigms Comb. Optim. Probl."},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Arigliano, A., Calogiuri, T., Ghiani, G.: A branch-and-bound algorithm for the time-dependent travelling salesman problem. Networks 72(3) (2018)","DOI":"10.1002\/net.21830"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-319-96151-4_21","volume-title":"Combinatorial Optimization","author":"H Hern\u00e1ndez-P\u00e9rez","year":"2018","unstructured":"Hern\u00e1ndez-P\u00e9rez, H., Salazar-Gonz\u00e1lez, J.J.: An exact algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem. In: Lee, J., Rinaldi, G., Mahjoub, A.R. (eds.) ISCO 2018. LNCS, vol. 10856, pp. 241\u2013252. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96151-4_21"},{"issue":"11","key":"29_CR5","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1049\/el:20050373","volume":"41","author":"HQ Wang","year":"2005","unstructured":"Wang, H.Q., Huang, D.S., Wang, B.: Optimisation of radial basis function classifiers using simulated annealing algorithm for cancer classification. Electron. Lett. 41(11), 630\u2013632 (2005)","journal-title":"Electron. Lett."},{"issue":"22","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1049\/el:20031021","volume":"39","author":"L Guo","year":"2003","unstructured":"Guo, L., Huang, D.S., Zhao, W.: Combining genetic optimisation with hybrid learning algorithm for radial basis function neural networks. Electron. Lett. 39(22), 1600\u20131601 (2003)","journal-title":"Electron. Lett."},{"key":"29_CR7","first-page":"1","volume":"99","author":"GG Wang","year":"2017","unstructured":"Wang, G.G.: Improving metaheuristic algorithms with information feedback models. IEEE Trans. Cybern. 99, 1\u201314 (2017)","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"29_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.2118\/199357-PA","volume":"25","author":"G Chen","year":"2020","unstructured":"Chen, G., Zhang, K., Zhang, L.: Global and local surrogate-model-assisted differential evolution for waterflooding production optimization. SPE J. 25(1), 105\u2013118 (2020)","journal-title":"SPE J."},{"issue":"5","key":"29_CR9","doi-asserted-by":"publisher","first-page":"2729","DOI":"10.2118\/201237-PA","volume":"25","author":"X Ma","year":"2020","unstructured":"Ma, X., Zhang, K., Yao, C.: Multiscale-network structure inversion of fractured media based on a hierarchical-parameterization and data-driven evolutionary-optimization method. SPE J. 25(5), 2729\u20132748 (2020)","journal-title":"SPE J."},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Zhao, M., Zhang, K., Chen, G.: A classification-based surrogate-assisted multiobjective evolutionary algorithm for production optimization under geological uncertainty. SPE J. 25(5) (2020)","DOI":"10.2118\/201229-PA"},{"key":"29_CR11","unstructured":"Dorigo, M.: Optimization, learning and natural algorithms. Ph.d. thesis Politecnico Di Milano (1992)"},{"key":"29_CR12","unstructured":"Stutzle, T., Hoos, H.: MAX-MIN Ant System and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation (ICEC 97). IEEE (2002)"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Dahan, H.E., Mathkour: Dynamic flying ant colony optimization (DFACO) for solving the traveling salesman problem. Sensors 19(8) (2019)","DOI":"10.3390\/s19081837"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Hgarwal, P., Sourabh, M., Sachdeva, R.: Recommending Optimal Tour for Groups Using Ant Colony Optimization. IEEE Computer Society (2018)","DOI":"10.1109\/IC3.2018.8530523"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Gong, X., Rong, Z., Gao, T.: An improved ant colony optimization algorithm based on fractional order memory for traveling salesman problems. In 2019 IEEE Symposium Series on Computational Intelligence, SSCI (2020)","DOI":"10.1109\/SSCI44817.2019.9003009"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Pu, Y.F., Siarry, P., Wang, J., Zhang, N.: Fractional-order ant colony algorithm: a fractional long term memory based cooperative learning approach. Swarm Evol. Comput. (2021)","DOI":"10.1016\/j.swevo.2021.101014"},{"issue":"6","key":"29_CR17","doi-asserted-by":"publisher","first-page":"068","DOI":"10.1103\/PhysRevLett.99.068104","volume":"99","author":"T Nakagaki","year":"2007","unstructured":"Nakagaki, T., Iima, M., Ueda, T.: Minimum-risk path finding by an adaptive amoebal network. Phys. Rev. Lett. 99(6), 068\u2013104 (2007)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"29_CR18","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jtbi.2006.07.015","volume":"244","author":"A Tero","year":"2007","unstructured":"Tero, A., Kobayashi, R., Nakagaki, T.: A mathematical model for adaptive transport network in path finding by true slime mold. J. Theor. Biol. 244(4), 553\u2013564 (2007)","journal-title":"J. Theor. Biol."},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"6803","DOI":"10.1038\/35035159","volume":"407","author":"T Nakagaki","year":"2000","unstructured":"Nakagaki, T., Yamada, H.: T\u00f3th.: Maze-solving by an amoeboid organism. Nature 407, 6803 (2000)","journal-title":"Nature"},{"issue":"5964","key":"29_CR20","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1126\/science.1177894","volume":"327","author":"T Atsushi","year":"2010","unstructured":"Atsushi, T., Seiji, T., Tetsu, S.: Rules for biologically inspired adaptive network design. Science 327(5964), 439\u2013442 (2010)","journal-title":"Science"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"LiuY., Feng, X., Yu, H., Luo, L.: Physarum Dynamic Optimization Algorithm Based on Energy Mechanism (2017)","DOI":"10.1007\/s00500-017-2796-z"},{"key":"29_CR22","series-title":"Emergence, Complexity and Computation","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-26662-6_26","volume-title":"Advances in Physarum Machines","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Gao, C., Deng, Y., Zhang, Z.: Slime mould inspired applications on graph-optimization problems. In: Adamatzky, A. (ed.) Advances in Physarum Machines. ECC, vol. 21, pp. 519\u2013562. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-26662-6_26"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/978-3-319-57454-7_57","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Liang","year":"2017","unstructured":"Liang, M., Gao, C., Li, X., Zhang, Z.: A Physarum-inspired ant colony optimization for community mining. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 737\u2013749. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57454-7_57"},{"key":"29_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.ssci.2012.12.003","volume":"54","author":"X Zhang","year":"2013","unstructured":"Zhang, X., Zhang, Z., Zhang, Y.: Route selection for emergency logistics management: a bio-inspired algorithm. Saf. Sci. 54, 87\u201391 (2013)","journal-title":"Saf. Sci."},{"key":"29_CR25","unstructured":"Jiang, S., Wen, S.: A modified Physarum-inspired model for the user equilibrium traffic assignment problem. Appl. Math. Modelling (2018)"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Gao, C., Chen, S., Li, X.: A physarum -inspired optimization algorithm for load-shedding problem. Appl. Soft Comput. 61 (2017)","DOI":"10.1016\/j.asoc.2017.07.043"},{"issue":"1","key":"29_CR27","first-page":"224","volume":"55","author":"X Zhang","year":"2016","unstructured":"Zhang, X., Chan, F.T.S., Adamatzky, A.: An intelligent physarum solver for supply chain network design under profit maximization and oligopolistic competition. Int. J. Prod. Res. 55(1), 224\u2013263 (2016)","journal-title":"Int. J. Prod. Res."},{"key":"29_CR28","unstructured":"Burchett, J., Elek, O.: Slime Mold Simulations Used to Map Dark Matter Holding Universe Together (2020)"},{"issue":"247","key":"29_CR29","first-page":"396","volume":"56","author":"KB Oldham","year":"1974","unstructured":"Oldham, K.B., Spanier, J.: The fractional calculus. Math. Gazette 56(247), 396\u2013400 (1974)","journal-title":"Math. Gazette"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Wang, Y., Xu, J., Yang, C.: Fluid inhomogeneity within nanoslits and deviation from Hagen-Poiseuille flow. AIChE J. (2016)","DOI":"10.1002\/aic.15409"},{"key":"29_CR31","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TPS.2003.820958","volume":"316","author":"PM Robitaille","year":"2003","unstructured":"Robitaille, P.M.: On the validity of Kirchhoff\u2019s law of thermal emission. IEEE Trans. Plasma Sci. 316, 1263\u20131267 (2003)","journal-title":"IEEE Trans. Plasma Sci."},{"key":"29_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-38703-6_35","volume-title":"Advances in Swarm Intelligence","author":"T Qian","year":"2013","unstructured":"Qian, T., Zhang, Z., Gao, C., Wu, Y., Liu, Y.: An ant colony system based on the Physarum network. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013. LNCS, vol. 7928, pp. 297\u2013305. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38703-6_35"},{"key":"29_CR33","unstructured":"G\u00fclc\u00fc, A., Mahi, M.: A parallel cooperative hybrid method based on ant colony optimization and 3-Opt algorithm for solving traveling salesman problem. Soft Computing A Fusion of Foundations Methodologies (2018)"},{"key":"29_CR34","doi-asserted-by":"crossref","unstructured":"Tuani, A.F., Keedwell, E., Collett, M.: Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem. Appl. Soft Comput. 97 (2020)","DOI":"10.1016\/j.asoc.2020.106720"},{"key":"29_CR35","doi-asserted-by":"crossref","unstructured":"Peker, M., En, B., Kumru, P.Y: An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method. Turkish J. Electr. Eng. Comput. Sci. 21, 2015\u20132036 (2013)","DOI":"10.3906\/elk-1109-44"},{"key":"29_CR36","doi-asserted-by":"crossref","unstructured":"G\u00fcnd\u00fcz, M., Kiran, M.S., \u00d6zceylan, E.: A hierarchic approach based on swarm intelligence to solve the traveling salesman problem. Mathematics 23(1), 215\u2013235 (2015)","DOI":"10.3906\/elk-1210-147"},{"key":"29_CR37","first-page":"36","volume":"283","author":"M Couceiro","year":"2016","unstructured":"Couceiro, M., Sivasundaram, S.: Novel fractional order particle swarm optimization. Appl. Math. 283, 36\u201354 (2016)","journal-title":"Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Advances in Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78743-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T02:24:01Z","timestamp":1672712641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78743-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030787424","9783030787431"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78743-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Swarm Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qingdao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"swarm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iasei.org\/icsi2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"177","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":"104","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":"59% - 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,5","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":"4-5","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)"}}]}}