{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,24]],"date-time":"2026-05-24T00:09:30Z","timestamp":1779581370855,"version":"3.53.1"},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["2023RC72"],"award-info":[{"award-number":["2023RC72"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62576046"],"award-info":[{"award-number":["62576046"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62406028"],"award-info":[{"award-number":["62406028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62301066"],"award-info":[{"award-number":["62301066"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013074","name":"Ministry of Education Key Projects of Philosophy and Social Sciences Research","doi-asserted-by":"publisher","award":["24JZD040"],"award-info":[{"award-number":["24JZD040"]}],"id":[{"id":"10.13039\/501100013074","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.asoc.2026.115097","type":"journal-article","created":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:21:06Z","timestamp":1774628466000},"page":"115097","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A reinforcement learning-based approach for offline and online multi-line bus scheduling problem"],"prefix":"10.1016","volume":"196","author":[{"given":"Yingzhuo","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8747-7701","authenticated-orcid":false,"given":"Weijun","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3369-8267","authenticated-orcid":false,"given":"Shuodi","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liuyu","family":"Xiang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4862-144X","authenticated-orcid":false,"given":"Xiaotian","family":"Zhuang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-9510-2279","authenticated-orcid":false,"given":"Guobin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3433-8435","authenticated-orcid":false,"given":"Zhaofeng","family":"He","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.asoc.2026.115097_bib0005","series-title":"Computer-Aided Scheduling of Public Transport","first-page":"73","article-title":"Applying an integrated approach to vehicle and crew scheduling in practice","author":"Freling","year":"2001"},{"key":"10.1016\/j.asoc.2026.115097_bib0010","series-title":"2017 36th Chinese Control Conference (CCC)","first-page":"3066","article-title":"Dynamic vehicle scheduling based on Htn","author":"Shen","year":"2017"},{"issue":"2","key":"10.1016\/j.asoc.2026.115097_bib0015","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/trsc.35.2.165.10135","article-title":"Models and algorithms for single-depot vehicle scheduling","volume":"35","author":"Freling","year":"2001","journal-title":"Transportation Sci."},{"issue":"1","key":"10.1016\/j.asoc.2026.115097_bib0020","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1287\/opre.42.1.41","article-title":"A column generation approach to the multiple-depot vehicle scheduling problem","volume":"42","author":"Ribeiro","year":"1994","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2026.115097_bib0025","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1016\/j.ejor.2005.02.030","article-title":"A time\u2013space network based exact optimization model for multi-depot bus scheduling","volume":"175","author":"Kliewer","year":"2006","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115097_bib0030","first-page":"1","article-title":"A hybrid algorithm for the multi-depot vehicle scheduling problem arising in public transportation","volume":"10","author":"Augusto","year":"2019","journal-title":"Int. J. Ind. Eng. Comput."},{"key":"10.1016\/j.asoc.2026.115097_bib0035","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10732-014-9264-z","article-title":"New variable depth local search for multiple depot vehicle scheduling problems","volume":"22","author":"Otsuki","year":"2016","journal-title":"J. Heuristics"},{"key":"10.1016\/j.asoc.2026.115097_bib0040","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.asoc.2015.07.001","article-title":"A clonal selection algorithm for urban bus vehicle scheduling","volume":"36","author":"Shui","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115097_bib0045","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2020.100667","article-title":"A multi-objective genetic algorithm based approach for dynamical bus vehicles scheduling under traffic congestion","volume":"54","author":"Wang","year":"2020","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115097_bib0050","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1016\/j.sbspro.2011.08.091","article-title":"A stochastic programming approach for robust vehicle scheduling in public bus transport","volume":"20","author":"Naumann","year":"2011","journal-title":"Proc.-Soc. Behav. Sci."},{"key":"10.1016\/j.asoc.2026.115097_bib0055","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.trb.2015.12.016","article-title":"A probabilistic model for vehicle scheduling based on stochastic trip times","volume":"85","author":"Shen","year":"2016","journal-title":"Transp. Res. Part B: Methodol."},{"key":"10.1016\/j.asoc.2026.115097_bib0060","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.trc.2012.05.006","article-title":"Robust optimization model of schedule design for a fixed bus route","volume":"25","author":"Yan","year":"2012","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2026.115097_bib0065","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1287\/trsc.1030.0069","article-title":"A robust solution approach to the dynamic vehicle scheduling problem","volume":"38","author":"Huisman","year":"2004","journal-title":"Transportation Sci."},{"key":"10.1016\/j.asoc.2026.115097_bib0070","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.trc.2019.05.032","article-title":"Robust scheduling strategies of electric buses under stochastic traffic conditions","volume":"105","author":"Tang","year":"2019","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"10.1016\/j.asoc.2026.115097_bib0075","doi-asserted-by":"crossref","first-page":"2272","DOI":"10.1109\/TSG.2020.3047890","article-title":"Deep-reinforcement-learning-based capacity scheduling for pv-battery storage system","volume":"12","author":"Huang","year":"2020","journal-title":"IEEE Trans. Smart Grid"},{"key":"10.1016\/j.asoc.2026.115097_bib0080","doi-asserted-by":"crossref","first-page":"3978","DOI":"10.1109\/TVT.2021.3063953","article-title":"Optimizing age of information through aerial reconfigurable intelligent surfaces: a deep reinforcement learning approach","volume":"70","author":"Samir","year":"2021","journal-title":"IEEE Trans. Veh. Technol."},{"key":"10.1016\/j.asoc.2026.115097_bib0085","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2023.110584","article-title":"A reinforcement learning-based approach for online bus scheduling","volume":"271","author":"Liu","year":"2023","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.asoc.2026.115097_bib0090","first-page":"679","article-title":"A markovian decision process","author":"Bellman","year":"1957","journal-title":"J. Math. Mech."},{"issue":"3","key":"10.1016\/j.asoc.2026.115097_bib0095","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/trsc.35.3.286.10153","article-title":"Simultaneous vehicle and crew scheduling in urban mass transit systems","volume":"35","author":"Haase","year":"2001","journal-title":"Transportation Sci."},{"key":"10.1016\/j.asoc.2026.115097_bib0100","series-title":"2010 8th World Congress on Intelligent Control and Automation","first-page":"2328","article-title":"A bi-level multi-objective programming model for bus crew and vehicle scheduling","author":"Lin","year":"2010"},{"issue":"7","key":"10.1016\/j.asoc.2026.115097_bib0105","doi-asserted-by":"crossref","first-page":"2160","DOI":"10.1016\/j.cor.2008.08.010","article-title":"Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows","volume":"36","author":"Hadjar","year":"2009","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115097_bib0110","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/trsc.2015.0615","article-title":"The vehicle scheduling problem for fleets with alternative-fuel vehicles","volume":"51","author":"Adler","year":"2017","journal-title":"Transportation Sci."},{"issue":"3","key":"10.1016\/j.asoc.2026.115097_bib0115","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/trsc.1090.0304","article-title":"A time-space network approach for the integrated vehicle-and crew-scheduling problem with multiple depots","volume":"44","author":"Steinzen","year":"2010","journal-title":"Transportation Sci."},{"key":"10.1016\/j.asoc.2026.115097_bib0120","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0377-2217(97)00363-9","article-title":"Multi-depot vehicle scheduling problems with time windows and waiting costs","volume":"111","author":"Desaulniers","year":"1998","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115097_bib0125","first-page":"1030","article-title":"Vehicle scheduling of an urban bus line via an improved multiobjective genetic algorithm","volume":"16","author":"Zuo","year":"2014","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"5","key":"10.1016\/j.asoc.2026.115097_bib0130","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/S1007-0214(08)70103-2","article-title":"Intelligent scheduling of public traffic vehicles based on a hybrid genetic algorithm","volume":"13","author":"Zhang","year":"2008","journal-title":"Tsinghua Sci. Technol."},{"issue":"6","key":"10.1016\/j.asoc.2026.115097_bib0135","doi-asserted-by":"crossref","first-page":"4441","DOI":"10.1007\/s40747-021-00443-5","article-title":"Dp-tabu: an algorithm to solve single-depot multi-line vehicle scheduling problem","volume":"8","author":"Xinchao","year":"2022","journal-title":"Complex Intell. Syst."},{"issue":"1","key":"10.1016\/j.asoc.2026.115097_bib0140","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/j.cie.2008.11.028","article-title":"Iterated local search for the multiple depot vehicle scheduling problem","volume":"57","author":"Laurent","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"10.1016\/j.asoc.2026.115097_bib0145","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.trb.2018.11.007","article-title":"A new formulation and a column generation-based heuristic for the multiple depot vehicle scheduling problem","volume":"118","author":"Kulkarni","year":"2018","journal-title":"Transp. Res. Part B Methodol."},{"key":"10.1016\/j.asoc.2026.115097_bib0150","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.procs.2020.08.026","article-title":"Multiple-depot vehicle scheduling problem heuristics","volume":"176","author":"Olariu","year":"2020","journal-title":"Proc. Comput. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2026.115097_bib0155","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/j.ijpe.2008.10.005","article-title":"A vehicle scheduling problem with fixed trips and time limitations","volume":"117","author":"Eliiyi","year":"2009","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.asoc.2026.115097_bib0160","series-title":"2018 21st International Conference on Intelligent Transportation Systems (ITSC)","first-page":"1894","article-title":"Operation and scheduling of pure electric buses under regular charging mode","author":"Jiang","year":"2018"},{"key":"10.1016\/j.asoc.2026.115097_bib0165","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.cor.2016.06.013","article-title":"An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem","volume":"76","author":"Wen","year":"2016","journal-title":"Comput. Oper. Res."},{"issue":"10","key":"10.1016\/j.asoc.2026.115097_bib0170","doi-asserted-by":"crossref","first-page":"1287","DOI":"10.1049\/itr2.12098","article-title":"Reforming mixed operation schedule for electric buses and traditional fuel buses by an optimal framework","volume":"15","author":"Duan","year":"2021","journal-title":"IET Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2026.115097_bib0175","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2021.107774","article-title":"Solving multi-depot electric vehicle scheduling problem by column generation and genetic algorithm","volume":"112","author":"Wang","year":"2021","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115097_bib0180","first-page":"1237","article-title":"Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints","volume":"190","author":"Wang","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.asoc.2026.115097_bib0185","series-title":"Proceedings of the Conference on Advanced Systems in Public Transport (CASPT)","first-page":"1","article-title":"The electric vehicle scheduling problem: a study on time-space network based and heuristic solution","author":"Reuer","year":"2015"},{"key":"10.1016\/j.asoc.2026.115097_bib0190","doi-asserted-by":"crossref","DOI":"10.1016\/j.scs.2019.101862","article-title":"Optimization of electric vehicle scheduling with multiple vehicle types in public transport","volume":"52","author":"Yao","year":"2020","journal-title":"Sustain. Cities Soc."},{"key":"10.1016\/j.asoc.2026.115097_bib0195","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/j.trc.2020.02.009","article-title":"Battery-electric transit vehicle scheduling with optimal number of stationary chargers","volume":"114","author":"Liu","year":"2020","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"10.1016\/j.asoc.2026.115097_bib0200","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.trb.2015.12.016","article-title":"A probabilistic model for vehicle scheduling based on stochastic trip times","volume":"85","author":"Shen","year":"2016","journal-title":"Transp. Res. Part B Methodol."},{"issue":"10","key":"10.1016\/j.asoc.2026.115097_bib0205","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1016\/j.trb.2011.07.009","article-title":"Dynamic bus holding strategies for schedule reliability: optimal linear control and performance analysis","volume":"45","author":"Xuan","year":"2011","journal-title":"Transp. Res. Part B Methodol."},{"issue":"4","key":"10.1016\/j.asoc.2026.115097_bib0210","first-page":"106","article-title":"A bi-level programming model for uncertain regional bus scheduling problems","volume":"13","author":"Ming","year":"2013","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"10.1016\/j.asoc.2026.115097_bib0215","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/j.trc.2018.09.010","article-title":"Vehicle scheduling under stochastic trip times: an approximate dynamic programming approach","volume":"96","author":"He","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"issue":"4","key":"10.1016\/j.asoc.2026.115097_bib0220","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1080\/15472450.2019.1681992","article-title":"Bus rescheduling in rolling horizons for regularity-based services","volume":"25","author":"Gkiotsalitis","year":"2021","journal-title":"J. Intell. Transp. Syst."},{"key":"10.1016\/j.asoc.2026.115097_bib0225","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1007\/s10100-017-0478-7","article-title":"The dynamic vehicle rescheduling problem","volume":"25","author":"D\u00e1vid","year":"2017","journal-title":"Cent. Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115097_bib0230","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1080\/00207543.2020.1766716","article-title":"A multiobjective single bus corridor scheduling using machine learning-based predictive models","volume":"61","author":"Chen","year":"2023","journal-title":"Int. J. Prod. Res."},{"issue":"3","key":"10.1016\/j.asoc.2026.115097_bib0235","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1016\/j.tre.2008.09.002","article-title":"A lagrangian heuristic for the real-time vehicle rescheduling problem","volume":"45","author":"Li","year":"2009","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"10.1016\/j.asoc.2026.115097_bib0240","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.trb.2017.12.012","article-title":"Real-time multi-depot vehicle type rescheduling problem","volume":"108","author":"Guedes","year":"2018","journal-title":"Transp. Res. Part B Methodol."},{"key":"10.1016\/j.asoc.2026.115097_bib0245","first-page":"24611","article-title":"The surprising effectiveness of PPO in cooperative multi-agent games","volume":"35","author":"Yu","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.asoc.2026.115097_bib0250","author":"Saxe"},{"key":"10.1016\/j.asoc.2026.115097_bib0255","author":"Andrychowicz"},{"key":"10.1016\/j.asoc.2026.115097_bib0260","author":"Mnih"},{"key":"10.1016\/j.asoc.2026.115097_bib0265","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","article-title":"Deep reinforcement learning with double q-learning","author":"van Hasselt","year":"2016"},{"issue":"3\u20134","key":"10.1016\/j.asoc.2026.115097_bib0270","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1023\/A:1022672621406","article-title":"Simple statistical gradient-following algorithms for connectionist reinforcement learning","volume":"8","author":"Williams","year":"1992","journal-title":"Mach. Learn."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626005454?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626005454?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,23]],"date-time":"2026-05-23T23:35:57Z","timestamp":1779579357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626005454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":54,"alternative-id":["S1568494626005454"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115097","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A reinforcement learning-based approach for offline and online multi-line bus scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115097","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115097"}}