{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T19:39:33Z","timestamp":1788809973195,"version":"build-2803163510"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T00:00:00Z","timestamp":1681344000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T00:00:00Z","timestamp":1681344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR 2019MD034"],"award-info":[{"award-number":["ZR 2019MD034"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>With the development of big traffic data, bus schedules should be changed from the traditional \"empirical\" rough scheduling to \"responsive\" accurate scheduling to meet the travel needs of passengers. Based on passenger flow distribution, considering passengers' feelings of congestion and waiting time at the station, we establish a Dual-Cost Bus Scheduling Optimization Model (Dual-CBSOM) with the optimization objectives of minimizing bus operation and passenger travel costs. Improving the classical Genetic Algorithm (GA) by adaptively determining the crossover probability and mutation probability of the algorithm. We use an Adaptive Double Probability Genetic Algorithm (A_DPGA) to solve the Dual-CBSOM. Taking Qingdao city as an example for optimization, the constructed A_DPGA is compared with the classical GA and Adaptive Genetic Algorithm (AGA). By solving the arithmetic example, we get the optimal solution that can reduce the overall objective function value by 2.3%, improve the bus operation cost by 4.0%, and reduce the passenger travel cost by 6.3%. The conclusions show that the Dual_CBSOM built can better meet the passenger travel demand, improve passenger travel satisfaction, and reduce the passenger travel cost and waiting for cost. It is demonstrated that the A_DPGA built in this research has faster convergence and better optimization results.<\/jats:p>","DOI":"10.1038\/s41598-023-32997-4","type":"journal-article","created":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T16:03:07Z","timestamp":1681401787000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Bi-objective bus scheduling optimization with passenger perception in mind"],"prefix":"10.1038","volume":"13","author":[{"given":"Shuai","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lin","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dongmei","family":"Pei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jue","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,4,13]]},"reference":[{"issue":"01","key":"32997_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.3969\/j.issn.1672-4747.2019.01.018","volume":"17","author":"Y Jiang","year":"2019","unstructured":"Jiang, Y., Wang, L. & Yin, J. M. Priority development strategies of public transport in medium sized cities\u2014A case study of Taizhou city. J. Transp. Eng. Inf. 17(01), 117\u2013121+146. https:\/\/doi.org\/10.3969\/j.issn.1672-4747.2019.01.018 (2019).","journal-title":"J. Transp. Eng. Inf."},{"key":"32997_CR2","doi-asserted-by":"publisher","DOI":"10.5038\/2375-0901.19.1.8","author":"SM Houman","year":"2016","unstructured":"Houman, S. M., Mohamad, R., Mohamad, S. & Ezatollah, M. Optimization of main public transport paths based on accessibility\u2014Case study: Mashhad, Iran. J. Public Transp. https:\/\/doi.org\/10.5038\/2375-0901.19.1.8 (2016).","journal-title":"J. Public Transp."},{"key":"32997_CR3","unstructured":"Zhang, J., Li, W. Q. & Ran, B. Research on intelligent vehicles scheduling and optimizing methods for conventional public transit. 16\u201327 (NanJing: Southeast University Press, 2014). ISBN: 978\u20137\u20135641\u20134995\u20136."},{"issue":"03","key":"32997_CR4","doi-asserted-by":"publisher","first-page":"150","DOI":"10.11918\/j.issn.0367-6234.201704096","volume":"50","author":"L Chen","year":"2018","unstructured":"Chen, L., Feng, L. & Li, Q. R. Bus departure interval model considering on-bus perceived value. J. Harbin Inst. Technol. 50(03), 150\u2013155. https:\/\/doi.org\/10.11918\/j.issn.0367-6234.201704096 (2018).","journal-title":"J. Harbin Inst. Technol."},{"issue":"06","key":"32997_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.16097\/j.cnki.1009-6744.2021.06.013","volume":"21","author":"YQ Xue","year":"2021","unstructured":"Xue, Y. Q., Guo, J., Zhong, M. & An, J. Optimization of regular bus scheduling based on uncertainty theory. J. Transp. Syst. Eng. Inf. Technol. 21(06), 115\u2013122+130. https:\/\/doi.org\/10.16097\/j.cnki.1009-6744.2021.06.013 (2021).","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"32997_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2012.11.098","author":"YH Li","year":"2013","unstructured":"Li, Y. H., Xu, W. T. & He, S. W. Expected value model for optimizing the multiple bus headways. J. Appl. Math. Comput. https:\/\/doi.org\/10.1016\/j.amc.2012.11.098 (2013).","journal-title":"J. Appl. Math. Comput."},{"key":"32997_CR7","unstructured":"Liu, Q., Sun, Y. E., Huang, H. & Du, Y. Bus departure time optimization with rail transportation transfer demand prediction. J. Chin. Mini-Micro Comput. Syst. 43(02), 430\u2013437. https:\/\/kns.cnki.net\/kcms\/detail\/21.1106.TP.20210330.1415.012.html (2022)."},{"issue":"04","key":"32997_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.14168\/j.issn.1673-4939.2020.04.12","volume":"27","author":"SM Gong","year":"2020","unstructured":"Gong, S. M., Feng, S. B. & Liu, F. M. An optimization model of bus departure interval based on genetic algorithm. J. East Liaoning Univ. (Nat. Sci. Ed.) 27(04), 284\u2013289. https:\/\/doi.org\/10.14168\/j.issn.1673-4939.2020.04.12 (2020).","journal-title":"J. East Liaoning Univ. (Nat. Sci. Ed.)"},{"issue":"10","key":"32997_CR9","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1016\/j.trb.2010.01.003","volume":"44","author":"C Leiva","year":"2010","unstructured":"Leiva, C., Mu\u00f1oz, J. C., Giesen, R. & Larrain, H. Design of limited-stop services for an urban bus corridor with capacity constraints. J. Transport Res. B-Methods 44(10), 1186\u20131201. https:\/\/doi.org\/10.1016\/j.trb.2010.01.003 (2010).","journal-title":"J. Transport Res. B-Methods"},{"key":"32997_CR10","doi-asserted-by":"publisher","DOI":"10.1155\/2016\/7901634","author":"H Zhang","year":"2016","unstructured":"Zhang, H., Zhao, S. Z., Liu, H. S. & Liang, S. D. Design of integrated limited-stop and short-turn services for a bus route. J. Math. Probl. Eng. https:\/\/doi.org\/10.1155\/2016\/7901634 (2016).","journal-title":"J. Math. Probl. Eng."},{"key":"32997_CR11","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.swevo.2018.10.009","volume":"44","author":"M Torabi","year":"2018","unstructured":"Torabi, M. & Salari, M. Limited-stop bus service: A strategy to reduce the unused capacity of a transit network. J. Swarm Evol. Comput. 44, 972\u2013986. https:\/\/doi.org\/10.1016\/j.swevo.2018.10.009 (2018).","journal-title":"J. Swarm Evol. Comput."},{"issue":"06","key":"32997_CR12","doi-asserted-by":"publisher","first-page":"9","DOI":"10.13291\/j.cnki.djdxac.2019.06.002","volume":"40","author":"ZY Zuo","year":"2019","unstructured":"Zuo, Z. Y., Niu, S., Yin, W. & Zhang, Y. Q. Optimization study of elastic launch interval based on distribution characteristics of public traffic flow. J. Dalian Jiaotong Univ. 40(06), 9\u201314. https:\/\/doi.org\/10.13291\/j.cnki.djdxac.2019.06.002 (2019).","journal-title":"J. Dalian Jiaotong Univ."},{"key":"32997_CR13","unstructured":"Niu, S. Research on optimization of elastic launch interval based on distribution characteristics of public traffic flow. Dalian Jiaotong Univ. https:\/\/kns.cnki.net\/kcms\/detail\/detail.aspx?FileName=1019039037.nh&DbName=CMFD2019 (2018)."},{"issue":"4","key":"32997_CR14","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P Serafini","year":"2006","unstructured":"Serafini, P. & Ukovich, W. A mathematical model for periodic scheduling problems. SIAM J. Discrete Math 2(4), 550\u2013581. https:\/\/doi.org\/10.1137\/0402049 (2006).","journal-title":"SIAM J. Discrete Math"},{"issue":"1","key":"32997_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF01721163","volume":"11","author":"W Domschke","year":"1989","unstructured":"Domschke, W. Schedule synchronization for public transit networks. J. OR Spektrum 11(1), 17\u201324. https:\/\/doi.org\/10.1007\/BF01721163 (1989).","journal-title":"J. OR Spektrum"},{"issue":"1","key":"32997_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(95)00073-Z","volume":"69","author":"K Nachtigall","year":"1996","unstructured":"Nachtigall, K. Periodic network optimization with different arc frequencies. J. Discrete Appl. Math. 69(1), 1\u201317. https:\/\/doi.org\/10.1016\/0166-218X(95)00073-Z (1996).","journal-title":"J. Discrete Appl. Math."},{"issue":"1","key":"32997_CR17","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/j.ejor.2004.12.013","volume":"173","author":"P Vansteenwegen","year":"2004","unstructured":"Vansteenwegen, P. & Oudheusden, D. V. Developing railway timetables which guarantee a better service. Eur. J Oper. Res. 173(1), 337\u2013350. https:\/\/doi.org\/10.1016\/j.ejor.2004.12.013 (2004).","journal-title":"Eur. J Oper. Res."},{"key":"32997_CR18","doi-asserted-by":"publisher","DOI":"10.1049\/iet-its.2017.0049","author":"JX Feng","year":"2018","unstructured":"Feng, J. X. et al. Optimising departure intervals for multiple bus lines with a multi-objective model. J. IET Intell. Transp. Syst. https:\/\/doi.org\/10.1049\/iet-its.2017.0049 (2018).","journal-title":"J. IET Intell. Transp. Syst."},{"key":"32997_CR19","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/549374","author":"HM Niu","year":"2012","unstructured":"Niu, H. M. & Zhang, M. H. An optimization to schedule train operations with phase-regular framework for intercity rail lines. J. Discrete Dyn. Nat. Soc. https:\/\/doi.org\/10.1155\/2012\/549374 (2012).","journal-title":"J. Discrete Dyn. Nat. Soc."},{"key":"32997_CR20","unstructured":"Jiang, Q. Y., Xie, J. X. & Ye, J. Mathematical Modeling. 13\u201315. ISBN: 978-7-04-031150-1 (Higher Education Press, 2011)."},{"issue":"02","key":"32997_CR21","doi-asserted-by":"publisher","first-page":"105","DOI":"10.15951\/j.tmgcxb.2004.02.020","volume":"37","author":"XW Chen","year":"2004","unstructured":"Chen, X. W., Dai, X. & Chen, Q. Approach on the information collection, analysis and application of bus intelligent card. J. Chin. Civ. Eng. J. 37(02), 105\u2013110. https:\/\/doi.org\/10.15951\/j.tmgcxb.2004.02.020 (2004).","journal-title":"J. Chin. Civ. Eng. J."},{"key":"32997_CR22","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/s13198-021-01071-5","volume":"12","author":"S Chen","year":"2021","unstructured":"Chen, S. Highway transportation optimization control system based on OD forecast information. Int. J. Syst. Assur. Eng. Manag. 12, 748\u2013756. https:\/\/doi.org\/10.1007\/s13198-021-01071-5 (2021).","journal-title":"Int. J. Syst. Assur. Eng. Manag."},{"issue":"02","key":"32997_CR23","doi-asserted-by":"publisher","first-page":"62","DOI":"10.16097\/j.cnki.1009-6744.2014.02.018","volume":"14","author":"JH Hu","year":"2014","unstructured":"Hu, J. H., Deng, J. & Huang, Z. Trip-chain based probability model for identifying alighting stations of smart card passengers. J. Transp. Syst. Eng. Inf. Technol. 14(02), 62\u201367+86. https:\/\/doi.org\/10.16097\/j.cnki.1009-6744.2014.02.018 (2014).","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"issue":"08","key":"32997_CR24","doi-asserted-by":"publisher","first-page":"1172","DOI":"10.13203\/j.whugis20160235","volume":"43","author":"JY Li","year":"2018","unstructured":"Li, J. Y., Zhang, J., Zhang, J. W., Wang, Q. & Peng, D. P. An algorithm to identify passengers\u2019 alighting stations and the effectiveness evaluation. J. Geoma Inf. Sci. Wuhan Univ. 43(08), 1172\u20131177. https:\/\/doi.org\/10.13203\/j.whugis20160235 (2018).","journal-title":"J. Geoma Inf. Sci. Wuhan Univ."},{"key":"32997_CR25","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/4212631","author":"HY Shang","year":"2019","unstructured":"Shang, H. Y., Liu, Y. P., Huang, H. J. & Guo, R. Y. Vehicle scheduling optimization considering the passenger waiting cost. J. Adv. Transp. https:\/\/doi.org\/10.1155\/2019\/4212631 (2019).","journal-title":"J. Adv. Transp."},{"issue":"03","key":"32997_CR26","doi-asserted-by":"publisher","first-page":"190","DOI":"10.16097\/j.cnki.1009-6744.2015.03.030","volume":"15","author":"S Lv","year":"2015","unstructured":"Lv, S., Tao, L. Y. & Mo, Y. K. Level of service classification and quantification for bus waiting time on commuting trip. J. Transp. Syst. Eng. Inf. Technol. 15(03), 190\u2013195+221. https:\/\/doi.org\/10.16097\/j.cnki.1009-6744.2015.03.030 (2015).","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"issue":"02","key":"32997_CR27","first-page":"29","volume":"31","author":"YW Cao","year":"2007","unstructured":"Cao, Y. W., Ju, Y. F. & Chen, F. Optimal model of urban bus frequency. J. Anhui Univ. (Nat. Sci.) 31(02), 29\u201332 (2007).","journal-title":"J. Anhui Univ. (Nat. Sci.)"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-023-32997-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-023-32997-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-023-32997-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,13]],"date-time":"2023-04-13T16:16:59Z","timestamp":1681402619000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-023-32997-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,13]]},"references-count":27,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["32997"],"URL":"https:\/\/doi.org\/10.1038\/s41598-023-32997-4","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,13]]},"assertion":[{"value":"5 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"6102"}}