{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:41:27Z","timestamp":1774680087039,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T00:00:00Z","timestamp":1624060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"This work is funded by Zhengzhou Tiamaes Technology"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A DP-TABU algorithm is proposed which can effectively solve the multi-line scheduling problem of single Deport (SD-ML-VSP). The multi-line regional coordinated dispatch of the single-line deport of the bus is to solve the problems of idle low-peak vehicles and insufficient peak capacity in single-line scheduling. The capacity of multiple lines at the same station is adjusted to realize resource sharing such as timetables, vehicles, and drivers. Shared capacity such as bus departure intervals and bus schedules. Taking the regional scheduling of multiple lines at the same station as the service object, a vehicle operation planning model based on the objective of optimal public transportation resources (minimum bus and driver costs) is established to optimize the vehicle dispatching mode of multiple lines. We applied this algorithm to the three lines S105, S107, and S159 of Zhengzhou Public Transport Corporation, and the results proved that the algorithm is effective. Through comparison with manual scheduling and simulated annealing algorithm, the advantages of DP-TABU algorithm in performance optimization and robustness are further verified.<\/jats:p>","DOI":"10.1007\/s40747-021-00443-5","type":"journal-article","created":{"date-parts":[[2021,6,19]],"date-time":"2021-06-19T14:02:21Z","timestamp":1624111341000},"page":"4441-4451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["DP-TABU: an algorithm to solve single-depot multi-line vehicle scheduling problem"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1912-7506","authenticated-orcid":false,"given":"Zhao","family":"Xinchao","sequence":"first","affiliation":[]},{"given":"Sun","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Lu","family":"Juan","sequence":"additional","affiliation":[]},{"given":"Li","family":"Zhiyu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,19]]},"reference":[{"key":"443_CR1","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1016\/j.physa.2018.08.017","volume":"512","author":"Jinjun Tang","year":"2018","unstructured":"Tang Jinjun, Yang Yifan, Qi Yong (2018) A hybrid algorithm for urban transit schedule optimization. Physica A 512:745\u2013755","journal-title":"Physica A"},{"issue":"9","key":"443_CR2","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/TITS.2016.2644725","volume":"18","author":"W Yuan","year":"2017","unstructured":"Yuan W et al (2017) A data-driven and optimal bus scheduling model with time-dependent traffic and demand. IEEE Trans Intell Trans Syst 18(9):2443\u20132452","journal-title":"IEEE Trans Intell Trans Syst"},{"key":"443_CR3","doi-asserted-by":"crossref","unstructured":"Zhao X et al (2020) Two-way Vehicle Scheduling Approach in Public Transit Based on Tabu Search and Dynamic Programming Algorithm. In: 2020 IEEE 5th international conference on intelligent transportation engineering (ICITE). IEEE","DOI":"10.1109\/ICITE50838.2020.9231516"},{"issue":"2","key":"443_CR4","first-page":"1030","volume":"16","author":"Z Xingquan","year":"2014","unstructured":"Xingquan Z et al (2014) Vehicle scheduling of an urban bus line via an improved multiobjective genetic algorithm. IEEE Trans Intell Trans Syst 16(2):1030\u20131041","journal-title":"IEEE Trans Intell Trans Syst"},{"issue":"3","key":"443_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","volume":"26","author":"Gulay Barbarosoglu","year":"1999","unstructured":"Barbarosoglu Gulay, Ozgur Demet (1999) A tabu search algorithm for the vehicle routing problem. Comput Oper Res 26(3):255\u2013270","journal-title":"Comput Oper Res"},{"issue":"1","key":"443_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TASSP.1978.1163055","volume":"26","author":"H Sakoe","year":"1978","unstructured":"Sakoe H, Chiba S (1978) Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans Acoustics Speech Signal Process 26(1):43\u201349","journal-title":"IEEE Trans Acoustics Speech Signal Process"},{"issue":"4","key":"443_CR7","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1080\/00401706.1973.10489112","volume":"15","author":"PC Consul","year":"1973","unstructured":"Consul PC, Jain GC (1973) A generalization of the Poisson distribution. Technometrics 15(4):791\u2013799","journal-title":"Technometrics"},{"key":"443_CR8","doi-asserted-by":"crossref","unstructured":"Mirjalili S, Siti H, Mohd Z (2010) A new hybrid PSOGSA algorithm for function optimization. In: 2010 international conference on computer and information application. IEEE","DOI":"10.1109\/ICCIA.2010.6141614"},{"key":"443_CR9","doi-asserted-by":"publisher","first-page":"101862","DOI":"10.1016\/j.scs.2019.101862","volume":"52","author":"Yao Enjian","year":"2020","unstructured":"Enjian Yao et al (2020) Optimization of electric vehicle scheduling with multiple vehicle types in public transport. Sustainable Cities Soc 52:101862","journal-title":"Sustainable Cities Soc"},{"key":"443_CR10","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.cor.2016.06.013","volume":"76","author":"W Min","year":"2016","unstructured":"Min W et al (2016) An adaptive large neighborhood search heuristic for the electric vehicle scheduling problem. Comput Oper Res 76:73\u201383","journal-title":"Comput Oper Res"},{"key":"443_CR11","doi-asserted-by":"crossref","unstructured":"Murray JJ et al (2002) Adaptive dynamic programming. In: IEEE transactions on systems, man, and cybernetics, Part C (Applications and Reviews) 32(2), 140-153","DOI":"10.1109\/TSMCC.2002.801727"},{"issue":"7","key":"443_CR12","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1038\/nbt0704-909","volume":"22","author":"Sean R Eddy","year":"2004","unstructured":"Eddy Sean R (2004) What is dynamic programming? Nat Biotechnol 22(7):909\u2013910","journal-title":"Nat Biotechnol"},{"key":"443_CR13","unstructured":"Olle S, Guzzella L (2009) A generic dynamic programming Matlab function. In: 2009 IEEE control applications,(CCA) & intelligent control, (ISIC). IEEE"},{"issue":"3","key":"443_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0166-218X(92)00033-I","volume":"51","author":"C-N Fiechter","year":"1994","unstructured":"Fiechter C-N (1994) A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51(3):243\u2013267","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"443_CR15","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/0377-2217(94)90009-4","volume":"76","author":"D Costa","year":"1994","unstructured":"Costa D (1994) A tabu search algorithm for computing an operational timetable. Euro J Oper Res 76(1):98\u2013110","journal-title":"Euro J Oper Res"},{"key":"443_CR16","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.cor.2019.04.021","volume":"109","author":"Daniel Schermer","year":"2019","unstructured":"Schermer Daniel, Moeini Mahdi, Wendt Oliver (2019) A hybrid VNS\/Tabu search algorithm for solving the vehicle routing problem with drones and en route operations. Comput Oper Res 109:134\u2013158","journal-title":"Comput Oper Res"},{"issue":"6","key":"443_CR17","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1057\/palgrave.jors.2600781","volume":"48","author":"Ibrahim H Osman","year":"1997","unstructured":"Osman Ibrahim H, Kelly James P (1997) Meta-heuristics theory and applications. J Oper Res Soc 48(6):657\u2013657","journal-title":"J Oper Res Soc"},{"key":"443_CR18","unstructured":"Vo\u00df S et al (2012) eds. Meta-heuristics: advances and trends in local search paradigms for optimization. Springer Science & Business Media"},{"issue":"1","key":"443_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(01)00123-0","volume":"137","author":"Dylan F Jones","year":"2002","unstructured":"Jones Dylan F, Mirrazavi S. Keyvan, Tamiz Mehrdad (2002) Multi-objective meta-heuristics: an overview of the current state-of-the-art. Euro J Oper Res 137(1):1\u20139","journal-title":"Euro J Oper Res"},{"issue":"1","key":"443_CR20","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1023018502759","volume":"31","author":"JM Beyers","year":"2003","unstructured":"Beyers JM et al (2003) Neighborhood structure, parenting processes, and the development of youths externalizing behaviors: a multilevel analysis. Am J Community Psychol 31(1):35\u201353","journal-title":"Am J Community Psychol"},{"issue":"11","key":"443_CR21","doi-asserted-by":"publisher","first-page":"3229","DOI":"10.1016\/j.cor.2005.12.002","volume":"34","author":"CY Zhang","year":"2007","unstructured":"Zhang CY et al (2007) A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Oper Res 34(11):3229\u20133242","journal-title":"Comput Oper Res"},{"issue":"5","key":"443_CR22","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00170-010-2743-y","volume":"52","author":"Jun-Qing Li","year":"2011","unstructured":"Li Jun-Qing et al (2011) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem. Int J Adv Manuf Technol 52(5):683\u2013697","journal-title":"Int J Adv Manuf Technol"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00443-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-021-00443-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-021-00443-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,27]],"date-time":"2022-10-27T13:15:28Z","timestamp":1666876528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-021-00443-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,19]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["443"],"URL":"https:\/\/doi.org\/10.1007\/s40747-021-00443-5","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,19]]},"assertion":[{"value":"31 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}