{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T13:12:36Z","timestamp":1777036356668,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T00:00:00Z","timestamp":1646092800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With the rapid development of tourism in the economy, popular demand for tourism also increases. Unreasonable distribution arises a series of problems such as reduction of tourist satisfaction and decrease of the income in tourist attractions. Based on consideration of tourism route planning, a mathematical model which takes the maximization of the overall satisfaction of all tourist groups as the objective function is established by taking the age and preferences of tourists, the upper limits of the tourist carrying capacity in various tourism routes, etc. as constraints. It aims to maximize income in tourist attractions while improving tourist satisfaction. Based on the tourist data of a travel agency, the statistical ideas of hierarchical clustering and random sampling are utilized to process the acquired data to obtain the simulation examples in the article. Aiming at this model, a knowledge-based hybrid ant colony algorithm is designed. On this basis, the mechanism of bacterial foraging algorithm is introduced. It improves the performance of the algorithm and avoids the generation of local optimal solution. At the same time, two knowledge models are in addition to improve the solution quality of the algorithm. Typical simulation indicates that the improved ant colony algorithm can find the optimal solution at a higher efficiency when solving the tourism route planning problem. The model can also satisfy the economic benefit of enterprises and achieves favorable path optimization effect under different optional routes, thus further verifying the effect liveness of the model.<\/jats:p>","DOI":"10.1007\/s40747-021-00635-z","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T07:02:36Z","timestamp":1646118156000},"page":"3973-3988","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":44,"title":["Tourism route optimization based on improved knowledge ant colony algorithm"],"prefix":"10.1007","volume":"8","author":[{"given":"Sidi","family":"Li","sequence":"first","affiliation":[]},{"given":"Tianyu","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Ling","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Lining","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Teng","family":"Ren","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,1]]},"reference":[{"issue":"16","key":"635_CR1","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1080\/13683500.2016.1209162","volume":"20","author":"D Fodness","year":"2016","unstructured":"Fodness D (2016) The problematic nature of sustainable tourism: some implications for planners and managers. Curr Issue Tour 20(16):1671\u20131683","journal-title":"Curr Issue Tour"},{"key":"635_CR2","doi-asserted-by":"crossref","unstructured":"Ma D, Zhang C (2017) Study of the main social problems of tourism development in ethnic villages. In: 2017 6th international conference on energy and environmental protection, vol 143, pp 268\u2013271","DOI":"10.2991\/iceep-17.2017.47"},{"issue":"04","key":"635_CR3","first-page":"1108","volume":"26","author":"T Ren","year":"2020","unstructured":"Ren T, Chen Y, Xiang YC, Xing LN, Li SD (2020) Path optimization for low carbon cold chain vehicles considering customer satisfaction. Comput Integr Manuf Syst 26(04):1108\u20131117","journal-title":"Comput Integr Manuf Syst"},{"issue":"01","key":"635_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s40430-019-2074-3","volume":"42","author":"Y Du","year":"2020","unstructured":"Du Y, Xing L, Chen Y et al (2020) Integrated agile observation satellite scheduling problem considering different memory environments: a case study. J Braz Soc Mech Sci Eng 42(01):1\u201321","journal-title":"J Braz Soc Mech Sci Eng"},{"issue":"05","key":"635_CR5","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1080\/09669582.2019.1705315","volume":"28","author":"F Luo","year":"2020","unstructured":"Luo F, Moyle BD, Moyle CLJ et al (2020) Drivers of carbon emissions in China\u2019s tourism industry. J Sustain Tour 28(05):747\u2013770","journal-title":"J Sustain Tour"},{"issue":"03","key":"635_CR6","first-page":"29","volume":"14","author":"T Ren","year":"2020","unstructured":"Ren T, Li SX, Xu HB, Li SD (2020) Research on the efficiency evaluation and improvement countermeasures of regional eco-economic system from the perspective of ecological priority. J Cent South Univ For Technol (Soc Sci) 14(03):29\u201337","journal-title":"J Cent South Univ For Technol (Soc Sci)"},{"key":"635_CR7","doi-asserted-by":"crossref","first-page":"106592","DOI":"10.1016\/j.asoc.2020.106592","volume":"96","author":"F Wang","year":"2020","unstructured":"Wang F, Li YX, Liao FS, Yan HY (2020) An ensemble learning based prediction strategy for dynamic multi-objective optimization. Appl Soft Comput 96:106592","journal-title":"Appl Soft Comput"},{"issue":"02","key":"635_CR8","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1002\/jtr.2402","volume":"23","author":"SE Hiamey","year":"2021","unstructured":"Hiamey SE, Amenumey EK, Mensah I (2021) Critical success factors for food tourism destinations: a socio-cultural perspective. Int J Tour Res 23(02):192\u2013205","journal-title":"Int J Tour Res"},{"issue":"10","key":"635_CR9","doi-asserted-by":"crossref","first-page":"104098","DOI":"10.1016\/j.tourman.2020.104098","volume":"79","author":"I Egger","year":"2020","unstructured":"Egger I, Lei SL, Digital P (2020) Digital free tourism \u2013 an exploratory study of tourist motivations. Tour Manag 79(10):104098","journal-title":"Tour Manag"},{"key":"635_CR10","doi-asserted-by":"publisher","DOI":"10.16381\/j.cnki.issn1003-207x.2020.0080","author":"T Ren","year":"2020","unstructured":"Ren T, Li SX, Zhou ZB, Li SD, Xiao HL (2020) Study on efficiency evaluation of regional sustainable development system based on BLP-DEA and satisfaction degree. Chin J Manag Sci. https:\/\/doi.org\/10.16381\/j.cnki.issn1003-207x.2020.0080","journal-title":"Chin J Manag Sci"},{"issue":"20","key":"635_CR11","first-page":"16","volume":"46","author":"Y Zhou","year":"2010","unstructured":"Zhou Y (2010) Research and application of bacterial foraging optimization algorithm. Comput Eng Appl 46(20):16\u201321","journal-title":"Comput Eng Appl"},{"issue":"05","key":"635_CR12","first-page":"1647","volume":"28","author":"J Hu","year":"2011","unstructured":"Hu J, Qi H, Dong F, Wang H (2011) An improved ant colony algorithm is proposed to study and solve the problem of tourist scenic spot path planning. Comput Appl Res 28(05):1647\u20131650","journal-title":"Comput Appl Res"},{"issue":"2019","key":"635_CR13","first-page":"1","volume":"132","author":"JL Li","year":"2019","unstructured":"Li JL, Qin H, Shen HX et al (2019) The unilateral transportation problem. Transp Res Part E Logist Transp Rev 132(2019):1\u201329","journal-title":"Transp Res Part E Logist Transp Rev"},{"key":"635_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106515","author":"HX Shen","year":"2019","unstructured":"Shen HX, Shu SS, Qin H et al (2019) An exact algorithm for the multi-period inspector scheduling problem. Comput Ind Eng. https:\/\/doi.org\/10.1016\/j.cie.2020.106515","journal-title":"Comput Ind Eng"},{"issue":"06","key":"635_CR15","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1109\/TEVC.2016.2521175","volume":"20","author":"R Wang","year":"2016","unstructured":"Wang R, Zhang QF, Zhang T (2016) Decomposition-based algorithms using Pareto adaptive scalarizing methods. IEEE Trans Evol Comput 20(06):821\u2013837","journal-title":"IEEE Trans Evol Comput"},{"key":"635_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2019.01.047","author":"AP Lin","year":"2019","unstructured":"Lin AP, Sun W, Yu HS et al (2019) Adaptive comprehensive learning particle swarm optimization with cooperative archive. Appl Soft Comput. https:\/\/doi.org\/10.1016\/j.asoc.2019.01.047","journal-title":"Appl Soft Comput"},{"issue":"02","key":"635_CR17","doi-asserted-by":"crossref","first-page":"100808","DOI":"10.1016\/j.swevo.2020.100808","volume":"60","author":"F Wang","year":"2021","unstructured":"Wang F, Zhang H, Zhou A (2021) A particle swarm optimization algorithm for mixed-variable optimization problems. Swarm Evolut Comput 60(02):100808","journal-title":"Swarm Evolut Comput"},{"issue":"01","key":"635_CR18","first-page":"90","volume":"42","author":"W Ma","year":"2020","unstructured":"Ma W, Wang R, Gu Y et al (2020) Deployment and scheduling strategy of microservice composition based on evolutionary multi-objective optimization. Syst Eng Electron 42(01):90\u2013100","journal-title":"Syst Eng Electron"},{"issue":"11","key":"635_CR19","first-page":"274","volume":"40","author":"X Li","year":"2020","unstructured":"Li X, Chen X, Wu G et al (2020) The scheduling model and heuristic algorithm of the relay satellite are considered. Acta Aeronaut Astronaut Sin 40(11):274\u2013289","journal-title":"Acta Aeronaut Astronaut Sin"},{"issue":"01","key":"635_CR20","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/TEVC.2016.2611642","volume":"22","author":"R Wang","year":"2018","unstructured":"Wang R, Zhou ZB, Ishibuchi H et al (2018) Localized weighted sum method for many-objective optimization. IEEE Trans Evol Comput 22(01):3\u201318","journal-title":"IEEE Trans Evol Comput"},{"key":"635_CR21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2977661","author":"KW Li","year":"2020","unstructured":"Li KW, Zhang T, Wang R (2020) Deep reinforcement learning for multiobjective optimization. IEEE Trans Cybern. https:\/\/doi.org\/10.1109\/TCYB.2020.2977661","journal-title":"IEEE Trans Cybern"},{"issue":"4","key":"635_CR22","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1287\/trsc.2017.0791","volume":"52","author":"N Agatz","year":"2018","unstructured":"Agatz N, Bouman P, Schmidt M (2018) Optimization approaches for the traveling salesman problem with drone. Transp Sci 52(4):965\u2013981","journal-title":"Transp Sci"},{"key":"635_CR23","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.trc.2017.11.015","volume":"86","author":"QM Ha","year":"2018","unstructured":"Ha QM, Deville Y, Pham QD et al (2018) On the min-cost traveling salesman problem with drone. Transp Res Part C Emerg Technol 86:597\u2013621","journal-title":"Transp Res Part C Emerg Technol"},{"key":"635_CR24","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.asoc.2016.02.021","volume":"43","author":"J Wang","year":"2016","unstructured":"Wang J, Ersoy OK, He M et al (2016) Multi-offspring genetic algorithm and its application to the traveling salesman problem. Appl Soft Comput 43:415\u2013423","journal-title":"Appl Soft Comput"},{"issue":"4","key":"635_CR25","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/TITS.2017.2706720","volume":"19","author":"X Meng","year":"2017","unstructured":"Meng X, Li J, Dai X et al (2017) Variable neighborhood search for a colored traveling salesman problem. IEEE Trans Intell Transp Syst 19(4):1018\u20131026","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"3","key":"635_CR26","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1016\/j.ejor.2019.11.046","volume":"283","author":"V Cacchiani","year":"2020","unstructured":"Cacchiani V, Contreras-Bolton C, Toth P (2020) Models and algorithms for the traveling salesman problem with time-dependent service times. Eur J Oper Res 283(3):825\u2013843","journal-title":"Eur J Oper Res"},{"key":"635_CR27","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.omega.2017.01.005","volume":"74","author":"E Malaguti","year":"2018","unstructured":"Malaguti E, Martello S, Santini A (2018) The traveling salesman problem with pickups, deliveries, and draft limits. Omega 74:50\u201358","journal-title":"Omega"},{"issue":"1","key":"635_CR28","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/TSMC.2018.2867496","volume":"49","author":"S Kim","year":"2018","unstructured":"Kim S, Moon I (2018) Traveling salesman problem with a drone station. IEEE Trans Syst Man Cybern Syst 49(1):42\u201352","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"635_CR29","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.trc.2015.03.005","volume":"54","author":"CC Murray","year":"2015","unstructured":"Murray CC, Chu AG (2015) The flying sidekick traveling salesman problem: optimization of drone-assisted parcel delivery. Transp Res Part C Emerg Technol 54:86\u2013109","journal-title":"Transp Res Part C Emerg Technol"},{"key":"635_CR30","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.cor.2016.09.003","volume":"78","author":"F Carrabs","year":"2017","unstructured":"Carrabs F, Cerrone C, Cerulli R et al (2017) A novel discretization scheme for the close enough traveling salesman problem. Comput Oper Res 78:163\u2013171","journal-title":"Comput Oper Res"},{"issue":"2","key":"635_CR31","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1016\/j.ejor.2017.11.063","volume":"267","author":"R Bernardino","year":"2018","unstructured":"Bernardino R, Paias A (2018) Solving the family traveling salesman problem. Eur J Oper Res 267(2):453\u2013466","journal-title":"Eur J Oper Res"},{"key":"635_CR32","doi-asserted-by":"crossref","first-page":"368","DOI":"10.1016\/j.trc.2019.11.003","volume":"110","author":"CC Murray","year":"2020","unstructured":"Murray CC, Raj R (2020) The multiple flying sidekicks traveling salesman problem: parcel delivery with multiple drones. Transp Res Part C Emerg Technol 110:368\u2013398","journal-title":"Transp Res Part C Emerg Technol"},{"key":"635_CR33","doi-asserted-by":"crossref","first-page":"105170","DOI":"10.1016\/j.cor.2020.105170","volume":"129","author":"JC Pina-Pardo","year":"2021","unstructured":"Pina-Pardo JC, Silva DF, Smith AE (2021) The traveling salesman problem with release dates and drone resupply. Comput Oper Res 129:105170","journal-title":"Comput Oper Res"},{"key":"635_CR34","doi-asserted-by":"crossref","first-page":"153134","DOI":"10.1109\/ACCESS.2020.3010420","volume":"8","author":"X Zhou","year":"2020","unstructured":"Zhou X, Sun B, Li S, Liu SY (2020) Tour route planning algorithm based on precise interested tourist sight data mining. IEEE Access 8:153134\u2013153168","journal-title":"IEEE Access"},{"key":"635_CR35","doi-asserted-by":"publisher","DOI":"10.2112\/SI106-151.1","author":"J Yang","year":"2020","unstructured":"Yang J (2020) Application of Floyd algorithm in the design of a coastal tourism route optimization system. J Coast Res. https:\/\/doi.org\/10.2112\/SI106-151.1","journal-title":"J Coast Res"},{"key":"635_CR36","doi-asserted-by":"publisher","DOI":"10.2112\/SI106-062.1","author":"XJ Zhou","year":"2020","unstructured":"Zhou XJ (2020) Path planning of coastal tourism based on the improved firefly algorithm. J Coast Res. https:\/\/doi.org\/10.2112\/SI106-062.1","journal-title":"J Coast Res"},{"key":"635_CR37","unstructured":"Xu F, Du J (2009) Study on the application of improved ant colony algorithm in tourism path planning. Comput Eng Appl 45(23):193\u2013195+226"},{"key":"635_CR38","doi-asserted-by":"publisher","DOI":"10.2112\/SI103-226.1","author":"Y Zhu","year":"2020","unstructured":"Zhu Y, Lan SL (2020) Key route planning models of natural hot spring tourism in coastal cities. J Coast Res. https:\/\/doi.org\/10.2112\/SI103-226.1","journal-title":"J Coast Res"},{"issue":"23","key":"635_CR39","first-page":"193","volume":"45","author":"F Xu","year":"2009","unstructured":"Xu F, Du JP (2009) Study on travel route planning based on improved ant colony algorithm. Comput Eng Appl 45(23):193\u2013195","journal-title":"Comput Eng Appl"},{"key":"635_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.tourman.2019.103956","author":"W Zheng","year":"2020","unstructured":"Zheng W, Ji H, Wang W, Yu B (2020) Using a heuristic approach to design personalized urban tourism itineraries with hotel selection. Tour Manag. https:\/\/doi.org\/10.1016\/j.tourman.2019.103956","journal-title":"Tour Manag"},{"issue":"02","key":"635_CR41","first-page":"2270","volume":"35","author":"YM Xia","year":"2012","unstructured":"Xia YM, Chen B, Chen JL et al (2012) Service composition optimization based on improved ant colony algorithm. Chin J Comput 35(02):2270\u20132281","journal-title":"Chin J Comput"},{"key":"635_CR42","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceeding of the 1st European conference on artificial life, Paris, France"},{"issue":"01","key":"635_CR43","first-page":"29","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colomi A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst 26(01):29\u201341","journal-title":"IEEE Trans Syst"},{"key":"635_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2020.3020732","author":"Y He","year":"2020","unstructured":"He Y, Xing L, Chen Y et al (2020) A generic Markov decision process model and reinforcement learning method for scheduling agile Earth observation satellites. IEEE Trans Syst Man Cybern Syst. https:\/\/doi.org\/10.1109\/TSMC.2020.3020732","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"635_CR45","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2020.2997050","author":"X Wang","year":"2020","unstructured":"Wang X, Wu G, Xing L, Pedrycz W (2020) Agile Earth observation satellite scheduling over 20\u00a0years: formulations, methods and future directions. IEEE Syst J. https:\/\/doi.org\/10.1109\/JSYST.2020.2997050","journal-title":"IEEE Syst J"},{"key":"635_CR46","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/j.wasman.2019.10.018","volume":"102","author":"JM Shi","year":"2020","unstructured":"Shi JM, Wang R, Chen WY et al (2020) Bi-objective design of household E-waste collection with public advertising and competition from informal sectors. Waste Manag 102:65\u201375","journal-title":"Waste Manag"},{"issue":"03","key":"635_CR47","first-page":"29","volume":"14","author":"T Ren","year":"2020","unstructured":"Ren T, Li SX, Xu HB, Li SD (2020) Evaluation of regional eco economic system efficiency from the perspective of ecological priority. J Cent South Univ For Sci Technol (Soc Sci Ed) 14(03):29\u201337","journal-title":"J Cent South Univ For Sci Technol (Soc Sci Ed)"},{"issue":"07","key":"635_CR48","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1007\/s13042-019-01053-x","volume":"11","author":"AW Mohamed","year":"2019","unstructured":"Mohamed AW, Hadi AA, Mohamed AK (2019) Gaining-sharing knowledge based algorithm for solving optimization problems: a novel nature-inspired algorithm. Int J Mach Learn Cybern 11(07):1501\u20131529","journal-title":"Int J Mach Learn Cybern"},{"key":"635_CR49","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.ins.2020.05.067","volume":"537","author":"X Cai","year":"2020","unstructured":"Cai X, Hu Z, Chen J (2020) A many-objective optimization recommendation algorithm based on knowledge mining. Inf Sci 537:148\u2013161","journal-title":"Inf Sci"},{"issue":"03","key":"635_CR50","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1109\/TMTT.2016.2630059","volume":"65","author":"W Na","year":"2016","unstructured":"Na W, Feng F, Zhang C et al (2016) A unified automated parametric modeling algorithm using knowledge-based neural network and l1 optimization. IEEE Trans Microw Theory Tech 65(03):729\u2013745","journal-title":"IEEE Trans Microw Theory Tech"},{"issue":"11","key":"635_CR51","first-page":"2540","volume":"32","author":"LN Xing","year":"2012","unstructured":"Xing LN, Chen YW, Yao F et al (2012) The knowledge-based ant colony optimization to double layer capacitated arc routing problem. Syst Eng Theory Pract 32(11):2540\u20132549","journal-title":"Syst Eng Theory Pract"},{"key":"635_CR52","doi-asserted-by":"crossref","first-page":"106830","DOI":"10.1016\/j.cie.2020.106830","volume":"150","author":"Y Song","year":"2020","unstructured":"Song Y, Xing L, Wang M et al (2020) A knowledge-based evolutionary algorithm for relay satellite system mission scheduling problem. Comput Ind Eng 150:106830","journal-title":"Comput Ind Eng"},{"key":"635_CR53","unstructured":"Ma XG, Liu TJ, Yang PZ, Jiang RF (2016) Vehicle routing optimization model of cold chain logistics based on stochastic demand. J Syst Simul 28(08):1824\u20131832+1840"},{"issue":"07","key":"635_CR54","first-page":"1329","volume":"35","author":"M Zhu","year":"2016","unstructured":"Zhu M (2016) Study on tourists\u2019 ecological civilization behavior based on multi-sample latent class model: a case of Suzhou. Geogr Res 35(07):1329\u20131343","journal-title":"Geogr Res"},{"key":"635_CR55","unstructured":"Xu Y (2012) Research on winner determination problem with an ant colony optimization algorithm. Ph.D. dissertation, Department of Mathematical Sciences, Tsinghua University, Beijing, China"},{"issue":"6","key":"635_CR56","doi-asserted-by":"crossref","first-page":"1531","DOI":"10.1007\/s00521-019-04119-7","volume":"32","author":"Z Zhou","year":"2020","unstructured":"Zhou Z, Li F, Zhu H et al (2020) An improved genetic algorithm using greedy strategy toward task scheduling optimization in cloud environments. Neural Comput Appl 32(6):1531\u20131541","journal-title":"Neural Comput Appl"},{"key":"635_CR57","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1016\/j.trb.2017.12.014","volume":"108","author":"J Xiao","year":"2018","unstructured":"Xiao J, Pachl J, Lin B et al (2018) Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search. Transp Res Part B Methodol 108:148\u2013171","journal-title":"Transp Res Part B Methodol"},{"key":"635_CR58","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.cie.2014.01.015","volume":"70","author":"Y Wang","year":"2014","unstructured":"Wang Y (2014) The hybrid genetic algorithm with two local optimization strategies for traveling salesman problem. Comput Ind Eng 70:124\u2013133","journal-title":"Comput Ind Eng"},{"key":"635_CR59","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.asoc.2018.03.048","volume":"68","author":"S Hore","year":"2018","unstructured":"Hore S, Chatterjee A, Dewanji A (2018) Improving variable neighborhood search to solve the traveling salesman problem. Appl Soft Comput 68:83\u201391","journal-title":"Appl Soft Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00635-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00635-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00635-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,27]],"date-time":"2022-09-27T13:44:41Z","timestamp":1664286281000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00635-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":59,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["635"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00635-z","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"assertion":[{"value":"17 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}