{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,25]],"date-time":"2026-09-25T07:40:35Z","timestamp":1790322035571,"version":"4.1.0"},"reference-count":26,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2021,2,5]],"date-time":"2021-02-05T00:00:00Z","timestamp":1612483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Key Research and Development Program of China","award":["2018YFB1600900"],"award-info":[{"award-number":["2018YFB1600900"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Transit network optimization can effectively improve transit efficiency, improve traffic conditions, and reduce the pollution of the environment. In order to better meet the travel demands of passengers, the factors influencing passengers\u2019 satisfaction with a customized bus are fully analyzed. Taking the minimum operating cost of the enterprise as the objective and considering the random travel time constraints of passengers, the customized bus routes are optimized. The K-means clustering analysis is used to classify the passengers\u2019 needs based on the analysis of the passenger travel demand of the customized shuttle bus, and the time stochastic uncertainty under the operating environment of the customized shuttle bus line is fully considered. On the basis of meeting the passenger travel time requirements and minimizing the cost of service operation, an optimization model that maximizes the overall satisfaction of passengers and public transit enterprises is structured. The smaller the value of the objective function is, the lower the operating cost. When the value is negative, it means there is profit. The model is processed by the deterministic processing method of random constraints, and then the hybrid intelligent algorithm is used to solve the model. A stochastic simulation technique is used to train stochastic constraints to approximate uncertain functions. Then, the improved immune clonal algorithm is used to solve the vehicle routing problem. Finally, it is proved by a case that the method can reasonably and efficiently realize the optimization of the customized shuttle bus lines in the region.<\/jats:p>","DOI":"10.3390\/a14020052","type":"journal-article","created":{"date-parts":[[2021,2,7]],"date-time":"2021-02-07T14:04:13Z","timestamp":1612706653000},"page":"52","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Optimization Method of Customized Shuttle Bus Lines under Random Condition"],"prefix":"10.3390","volume":"14","author":[{"given":"Zhichao","family":"Sun","sequence":"first","affiliation":[{"name":"China Academy of Transportation Sciences, Beijing 100029, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kang","family":"Zhou","sequence":"additional","affiliation":[{"name":"China Academy of Transportation Sciences, Beijing 100029, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinzheng","family":"Yang","sequence":"additional","affiliation":[{"name":"China Academy of Transportation Sciences, Beijing 100029, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiao","family":"Peng","sequence":"additional","affiliation":[{"name":"China Academy of Transportation Sciences, Beijing 100029, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rui","family":"Song","sequence":"additional","affiliation":[{"name":"MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,2,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.proeng.2016.01.283","article-title":"The key contributing factors of customized shuttle bus in rush hour: A case study in Harbin City","volume":"137","author":"Cao","year":"2016","journal-title":"Procedia Eng."},{"key":"ref_2","first-page":"157","article-title":"The network scheduling model and its solution algorithm of Internet customized shuttle bus","volume":"17","author":"Lei","year":"2017","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"ref_3","first-page":"23","article-title":"Study on the line network layout of customized shuttle bus planning of the level analysis method of point, line and plane","volume":"35","author":"Cheng","year":"2014","journal-title":"J. Dali. Jiaotong Univ."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Pan, S.L., Yu, J., Yang, X.F., Liu, Y., and Zou, N. (2014). Designing a flexible feeder transit system serving irregularly shaped and gated communities: Determining service area and feeder route planning. J. Urban Plan. Dev.","DOI":"10.1061\/(ASCE)UP.1943-5444.0000224"},{"key":"ref_5","first-page":"1827","article-title":"Route planning and coordinated scheduling model for flexible feeder transit service","volume":"46","author":"Pan","year":"2016","journal-title":"J. Jilin Univ. (Eng. Technol. Ed.)"},{"key":"ref_6","first-page":"79","article-title":"Designing optimal bus network for minimizing trip times of passenger flows","volume":"12","author":"Lin","year":"1999","journal-title":"China J. Highw. Transp."},{"key":"ref_7","first-page":"1035","article-title":"Network layout optimization model of multi-modal comprehensive public transit system and simulation","volume":"30","author":"Zhou","year":"2013","journal-title":"Appl. Res. Comput."},{"key":"ref_8","first-page":"22","article-title":"Optimal path searching algorithm in transit network","volume":"5","author":"He","year":"2007","journal-title":"J. Transp. Eng. Inf."},{"key":"ref_9","first-page":"1153","article-title":"The design of interurban bus networks in city centers","volume":"46","author":"Mireia","year":"2012","journal-title":"Transp. Res. Part A"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1710","DOI":"10.1016\/j.trb.2011.05.025","article-title":"Designing a home-to-work bus service in a metropolitan area","volume":"45","author":"Perugia","year":"2011","journal-title":"Transp. Res. Part B"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/j.trc.2014.08.017","article-title":"Designing large-scale bus network with seasonal variations of demand","volume":"48","author":"Amiripour","year":"2014","journal-title":"Transp. Res. Part C"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.aei.2017.02.006","article-title":"Heuristic approach for solving employee bus routes in a large-scale industrial factory","volume":"32","author":"Leksakul","year":"2017","journal-title":"Adv. Eng. Inform."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.trb.2014.05.018","article-title":"Continuum approximation approach to bus network design under spatially heterogeneous demand","volume":"68","author":"Ouyang","year":"2014","journal-title":"Transp. Res. Part B"},{"key":"ref_14","first-page":"95","article-title":"Optimal line model on urban public traffic line network","volume":"18","author":"Chang","year":"2005","journal-title":"China J. Highw. Transp."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1061\/(ASCE)0733-947X(2003)129:2(186)","article-title":"Transit route network design using frequency coded genetic algorithm","volume":"129","author":"Tom","year":"2003","journal-title":"J. Transp. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1061\/(ASCE)0733-947X(2006)132:2(122)","article-title":"Using a simulated annealing algorithm to solve the transit route network design problem","volume":"132","author":"Wei","year":"2006","journal-title":"J. Transp. Eng."},{"key":"ref_17","first-page":"151","article-title":"Bi-level optimization model for public transportation network redesign problem","volume":"2263","author":"Wei","year":"2012","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"ref_18","first-page":"140","article-title":"Method of public transit network planning based on strategy equilibrium transit assignment","volume":"15","author":"Xu","year":"2015","journal-title":"J. Transp. Syst. Eng. Inf. Technol."},{"key":"ref_19","first-page":"108","article-title":"Urban routine bus transit network optimizing design based on integer nonlinear programming model","volume":"29","author":"Yu","year":"2016","journal-title":"China J. Highw. Transp."},{"key":"ref_20","first-page":"304","article-title":"Optimization model of public traffic network and ant algorithm with four dimensions consumption","volume":"38","author":"Hu","year":"2008","journal-title":"J. Southeast Univ. (Nat. Sci. Ed.)"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.trc.2011.12.003","article-title":"Transit route network design-maximizing direct and transfer demand density","volume":"22","author":"Yu","year":"2012","journal-title":"Transp. Res. Part C"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1061\/(ASCE)0733-947X(2007)133:4(240)","article-title":"Optimization of user and operator cost for large-scale transit network","volume":"133","author":"Zhao","year":"2007","journal-title":"J. Transp. Eng."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.trb.2014.05.008","article-title":"Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach","volume":"67","author":"Szeto","year":"2014","journal-title":"Transp. Res. Part B"},{"key":"ref_24","first-page":"21","article-title":"Review of K-means clustering algorithm","volume":"20","author":"Wang","year":"2012","journal-title":"Electron. Des. Eng."},{"key":"ref_25","unstructured":"Liu, B.D., Zhao, R.Q., and Wang, G. (2003). Uncertain Programming with Applications, Tsinghua University Press. [3rd ed.]."},{"key":"ref_26","first-page":"253","article-title":"Immune particle swarm optimization algorithms based on clone selection","volume":"35","author":"Li","year":"2008","journal-title":"Comput. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/2\/52\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:20:13Z","timestamp":1760160013000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/2\/52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,5]]},"references-count":26,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,2]]}},"alternative-id":["a14020052"],"URL":"https:\/\/doi.org\/10.3390\/a14020052","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,5]]}}}