{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:04:19Z","timestamp":1768561459938,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:00:00Z","timestamp":1756425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discov Artif Intell"],"DOI":"10.1007\/s44163-025-00484-6","type":"journal-article","created":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T16:44:03Z","timestamp":1756485843000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automatic search model of railway shunting route based on improved artificial neural network algorithm"],"prefix":"10.1007","volume":"5","author":[{"given":"Xue","family":"Li","sequence":"first","affiliation":[]},{"given":"Hui","family":"He","sequence":"additional","affiliation":[]},{"given":"Yixuan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Zeyuan","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"issue":"06","key":"484_CR1","first-page":"181","volume":"42","author":"GY Lu","year":"2021","unstructured":"Lu GY, Peng H, He BS, Zhang BJ. Time conflict degree and approximate calculation method of routes in railway stations and yards. China Railw Sci. 2021;42(06):181\u201393.","journal-title":"China Railw Sci"},{"issue":"06","key":"484_CR2","first-page":"61","volume":"42","author":"P Liu","year":"2020","unstructured":"Liu P. An optimized plan for the turnout interlocking control following the parallel routing of a railway station. Railw Transp Econ. 2020;42(06):61\u20135.","journal-title":"Railw Transp Econ"},{"issue":"10","key":"484_CR3","first-page":"46","volume":"41","author":"F Lin","year":"2019","unstructured":"Lin F. A study on train route allocation scheme of high-speed railway terminal station. Railw Transp Econ. 2019;41(10):46\u201351.","journal-title":"Railw Transp Econ"},{"issue":"08","key":"484_CR4","first-page":"2175","volume":"18","author":"L Huo","year":"2021","unstructured":"Huo L. Comprehensive optimization model and algorithm for locomotive operation and routing trains through a railway station. J Railw Sci Eng. 2021;18(08):2175\u201382.","journal-title":"J Railw Sci Eng"},{"issue":"5","key":"484_CR5","first-page":"192","volume":"48","author":"LJ Niu","year":"2023","unstructured":"Niu LJ, Wu JJ. An automatic search algorithm for routes in centralized railway dispatching system based on association rules. Highway Eng. 2023;48(5):192\u20138.","journal-title":"Highway Eng"},{"issue":"6","key":"484_CR6","first-page":"199","volume":"67","author":"K Wang","year":"2023","unstructured":"Wang K, Wang HF, Chai M. Route allocation optimization model and algorithm for railway station operation. Railw Standard Design. 2023;67(6):199\u2013206.","journal-title":"Railw Standard Design"},{"issue":"10","key":"484_CR7","first-page":"1511","volume":"38","author":"XC Han","year":"2021","unstructured":"Han XC, Yu SP, Yuan ZM, et al. High-speed railway dynamic scheduling based on Q-learning method. Control Theory Appl. 2021;38(10):1511\u201321.","journal-title":"Control Theory Appl"},{"issue":"1","key":"484_CR8","first-page":"71","volume":"43","author":"HT Zhao","year":"2021","unstructured":"Zhao HT, Chen F, Xu W, et al. High-speed railway intelligent traffic control system based on cloud edge collaboration. Railw Transp Econmy. 2021;43(1):71\u20136.","journal-title":"Railw Transp Econmy"},{"issue":"4","key":"484_CR9","first-page":"3","volume":"118","author":"J Abell\u00e1n-Garc\u00eda","year":"2021","unstructured":"Abell\u00e1n-Garc\u00eda J. Artificial neural network model for strength prediction of ultra-high-performance concrete. ACI Mater J. 2021;118(4):3\u201314.","journal-title":"ACI Mater J"},{"issue":"2","key":"484_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1177\/0734242X211008526","volume":"40","author":"MS Jassim","year":"2022","unstructured":"Jassim MS, Coskuner G, Zontul M. Comparative performance analysis of support vector regression and artificial neural network for prediction of municipal solid waste generation. Waste Manag Res. 2022;40(2):195\u2013204.","journal-title":"Waste Manag Res"},{"issue":"1","key":"484_CR11","doi-asserted-by":"publisher","first-page":"938","DOI":"10.1137\/18M1192810","volume":"34","author":"K Yamamoto","year":"2020","unstructured":"Yamamoto K. Large deviation theorem for branches of the random binary tree in the Horton-Strahler analysis. SIAM J Discret Math. 2020;34(1):938\u201349.","journal-title":"SIAM J Discret Math"},{"issue":"5","key":"484_CR12","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1049\/iet-cds.2019.0443","volume":"14","author":"SK Patel","year":"2020","unstructured":"Patel SK, Singhal SK. Area-delay and energy efficient multi-operand binary tree adder. IET Circuits Devices Syst. 2020;14(5):586\u201393.","journal-title":"IET Circuits Devices Syst"},{"issue":"2","key":"484_CR13","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1504\/EJIE.2022.121188","volume":"16","author":"S Saemi","year":"2022","unstructured":"Saemi S, Komijan AR, Tavakkoli-Moghaddam R, Fallah M. Solving an integrated mathematical model for crew pairing and rostering problems by an ant colony optimisation algorithm. Eur J Ind Eng. 2022;16(2):215\u201340.","journal-title":"Eur J Ind Eng"},{"issue":"2","key":"484_CR14","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1051\/ro\/2021034","volume":"55","author":"B Kanso","year":"2021","unstructured":"Kanso B, Kansou A, Yassine A. Open capacitated ARC routing problem by hybridized ant colony algorithm. RAIRO Oper Res. 2021;55(2):639\u201352.","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"484_CR15","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1049\/iet-sen.2019.0018","volume":"14","author":"H Motameni","year":"2020","unstructured":"Motameni H, Kalantary KR, Ebrahimnejad A. An efficient improved ant colony optimization algorithm for dynamic software rejuvenation in web services. IET Softw. 2020;14(4):369\u201376.","journal-title":"IET Softw"},{"issue":"4","key":"484_CR16","first-page":"204","volume":"36","author":"F Xie","year":"2021","unstructured":"Xie F, Shi X. A global path planning algorithm for manned submersible based on improved ant colony algorithms. Int J Robot Autom. 2021;36(4):204\u201310.","journal-title":"Int J Robot Autom"},{"issue":"12","key":"484_CR17","first-page":"362","volume":"38","author":"T Xue","year":"2021","unstructured":"Xue T, Bei SY, Li B. Path planning of intelligent vehicle based on ant colony algorithm. Comput Simul. 2021;38(12):362\u20136.","journal-title":"Comput Simul"}],"container-title":["Discover Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00484-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44163-025-00484-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44163-025-00484-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:33:13Z","timestamp":1757453593000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44163-025-00484-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"references-count":17,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["484"],"URL":"https:\/\/doi.org\/10.1007\/s44163-025-00484-6","relation":{},"ISSN":["2731-0809"],"issn-type":[{"value":"2731-0809","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"24 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"231"}}