{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:16:16Z","timestamp":1775470576752,"version":"3.50.1"},"reference-count":43,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T00:00:00Z","timestamp":1554854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Key R&amp;D Program of China","award":["2018YFB1201402"],"award-info":[{"award-number":["2018YFB1201402"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The quality of route design can greatly affect the operational efficiency of feeder bus service for high-speed rail stations. A bi-objective optimization formulation is established to consider the trade-off between two conflicting optimization objectives, namely maximizing the travel demand that can be served and minimizing the feeder bus route length. The Pareto optimal solutions of the discrete mathematical formulation are generated by the exact \u03b5-constraint method. We test the proposed approach with a numerical example on an actual size scale. The results indicate that the computational efficiency of the solution approach is encouraging, and a series of route design plans and location stop plans are generated simultaneously in a short time. A numerical example also shows that as the passengers\u2019 maximum acceptable walking distance increases, more travel demand can be served when the route length does not change much. Benefits brought by increasing feeder bus route length are analyzed and the robustness of obtained solutions is verified. The comparison of our approach and an existing approach is also presented to demonstrate that our approach can generate better solutions.<\/jats:p>","DOI":"10.3390\/sym11040514","type":"journal-article","created":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T11:25:08Z","timestamp":1554895508000},"page":"514","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["A Multi-Objective Programming Approach to Design Feeder Bus Route for High-Speed Rail Stations"],"prefix":"10.3390","volume":"11","author":[{"given":"Xiaole","family":"Guo","sequence":"first","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]},{"given":"Rui","family":"Song","sequence":"additional","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]},{"given":"Shiwei","family":"He","sequence":"additional","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3063-6117","authenticated-orcid":false,"given":"Sijia","family":"Hao","sequence":"additional","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]},{"given":"Lijie","family":"Zheng","sequence":"additional","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]},{"given":"Guowei","family":"Jin","sequence":"additional","affiliation":[{"name":"Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport, Ministry of Transport, Beijing Jiaotong University, 100044 Beijing, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,4,10]]},"reference":[{"key":"ref_1","unstructured":"Semler, C., and Hale, C. (October, January 29). Rail station access\u2014An assessment of options. Proceedings of the 33rd Australasian Transport Research Forum Conference, Canberra, Australia."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"7051789:1","DOI":"10.1155\/2018\/7051789","article-title":"Modeling the satisfaction of bus traffic transfer service quality at a high-speed railway station","volume":"2018","author":"Cheng","year":"2018","journal-title":"J. Adv. Transp."},{"key":"ref_3","first-page":"2937","article-title":"Designing feeder bus lines for high-speed railway terminals","volume":"33","author":"Teng","year":"2013","journal-title":"Syst. Eng. Theory Pract."},{"key":"ref_4","unstructured":"Fan, W. (2004). Optimal transit route network design problem: Algorithms, implementations, and numerical results. [Ph.D. Thesis, The University of Texas at Austin]."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.ejor.2009.05.017","article-title":"The school bus routing problem: A review","volume":"202","author":"Park","year":"2010","journal-title":"Eur. J. Oper. Res."},{"key":"ref_6","unstructured":"Metcalf, D.D., and Bond, V.L. (2006, January 19\u201322). Bus stop guidelines to meet urban, suburban and rural conditions. Proceedings of the ITE 2006 Technical Conference and Exhibit Compendium of Technical Papers, San Antonio, TX, USA."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1002\/atr.5670340204","article-title":"Optimal feeder bus routes on irregular street networks","volume":"34","author":"Chien","year":"2000","journal-title":"J. Adv. Transpt."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Jerby, S., and Ceder, A. (2006, January 22\u201326). Optimal routing design for shuttle bus service. Proceedings of the 85th Annual Meeting of the Transportation-Research-Board, Transportation Research Board Natl Research Council, Washington, DC, USA.","DOI":"10.3141\/1971-04"},{"key":"ref_9","first-page":"166","article-title":"Research on optimal routing of community shuttle connect rail transit line","volume":"14","author":"Xiong","year":"2014","journal-title":"J. Trans. Syst. Eng. Inf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1090457:1","DOI":"10.1155\/2017\/1090457","article-title":"Route design model of feeder bus service for urban rail transit stations","volume":"2017","author":"Zhu","year":"2017","journal-title":"Math. Probl. Eng."},{"key":"ref_11","first-page":"04014028:1","article-title":"Designing a flexible feeder transit system serving irregularly shaped and gated communities: Determining service area and feeder route planning","volume":"141","author":"Pan","year":"2014","journal-title":"J. Urban Plan. Dev."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1080\/03081060.2014.912418","article-title":"Optimization of a feeder-bus route design by using a multiobjective programming approach","volume":"37","author":"Lin","year":"2014","journal-title":"Transpt. Plan. Technol."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1061\/(ASCE)0733-947X(2001)127:4(334)","article-title":"Development of feeder routes for suburban railway stations using heuristic approach","volume":"127","author":"Shrivastava","year":"2001","journal-title":"J. Transp. Eng."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1142\/S0217595904000382","article-title":"Applying metaheuristics to feeder bus network design problem","volume":"21","author":"Kuan","year":"2004","journal-title":"Asia Pac. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/j.advengsoft.2005.10.003","article-title":"Solving the feeder bus network design problem by genetic algorithms and ant colony optimization","volume":"37","author":"Kuan","year":"2006","journal-title":"Adv. Eng. Softw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/j.tranpol.2006.03.002","article-title":"A model for development of optimized feeder routes and coordinated schedules\u2014A genetic algorithms approach","volume":"13","author":"Shrivastava","year":"2006","journal-title":"Transp. Policy"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1061\/(ASCE)0733-947X(2009)135:1(1)","article-title":"Use of a hybrid algorithm for modeling coordinated feeder bus route network at suburban railway station","volume":"135","author":"Shrivastava","year":"2009","journal-title":"J. Transp. Eng."},{"key":"ref_18","first-page":"1234","article-title":"Heuristic algorithm for feeder bus route generation in railway traffic system","volume":"41","author":"Song","year":"2011","journal-title":"J. Jilin Univ."},{"key":"ref_19","first-page":"349","article-title":"Feeder bus network design under elastic demand","volume":"41","author":"Sun","year":"2011","journal-title":"J. Jilin Univ."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.ejor.2010.08.020","article-title":"A simultaneous bus route design and frequency setting problem for Tin Shui Wai, Hong Kong","volume":"209","author":"Szeto","year":"2011","journal-title":"Eur. J. Oper. Res."},{"key":"ref_21","first-page":"371","article-title":"Feeder bus network design model based on effective path","volume":"45","author":"Liu","year":"2015","journal-title":"J. Jilin Univ."},{"key":"ref_22","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. B Methodol."},{"key":"ref_23","first-page":"68","article-title":"Study on enterprise shuttle bus location and route optimization: An integrated approach","volume":"18","author":"Li","year":"2016","journal-title":"J. Univ. Electron. Sci. Technol. China"},{"key":"ref_24","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. Inf."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1061\/(ASCE)TE.1943-5436.0000608","article-title":"Optimal routing design of a community shuttle for metro stations","volume":"139","author":"Xiong","year":"2013","journal-title":"J. Transp. Eng."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.ejor.2013.02.025","article-title":"A metaheuristic for the school bus routing problem with bus stop selection","volume":"229","author":"Schittekat","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_27","first-page":"568","article-title":"Design of suburban bus route for airport access","volume":"13","author":"Chen","year":"2017","journal-title":"Transp. A Transp. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cie.2012.04.004","article-title":"A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem","volume":"63","author":"Yan","year":"2012","journal-title":"Comput. Ind. Eng."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1080\/0305215X.2013.768240","article-title":"Cash transportation vehicle routing and scheduling under stochastic travel times","volume":"46","author":"Yan","year":"2014","journal-title":"Eng. Optimiz."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"B\u00e1nyai, T. (2018). Real-time decision making in first mile and last mile logistics: How smart scheduling affects energy efficiency of hyperconnected supply chain solutions. Energies, 11.","DOI":"10.3390\/en11071833"},{"key":"ref_31","first-page":"5180156:1","article-title":"Smart scheduling: An integrated first mile and last mile supply approach","volume":"2018","year":"2018","journal-title":"Complexity"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/j.ejor.2017.08.011","article-title":"A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution","volume":"265","author":"Zhou","year":"2018","journal-title":"Eur. J. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.eswa.2018.03.001","article-title":"The smart waste collection routing problem: Alternative operational management approaches","volume":"103","author":"Ramos","year":"2018","journal-title":"Expert Syst. Appl."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.wasman.2018.03.015","article-title":"A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew\u2019s working time","volume":"76","author":"Tirkolaee","year":"2018","journal-title":"Waste Manag."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"B\u00e1nyai, T., Tam\u00e1s, P., Ill\u00e9s, B., Stankevi\u010di\u016bt\u0117, \u017d., and B\u00e1nyai, \u00c1. (2019). Optimization of municipal waste collection routing: Impact of industry 4.0 technologies on environmental awareness and sustainability. Int. J. Environ. Res. Public Health., 16.","DOI":"10.3390\/ijerph16040634"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/j.cor.2018.03.008","article-title":"Solving a selective dial-a-ride problem with logic-based Benders decomposition","volume":"96","author":"Riedler","year":"2018","journal-title":"Comput. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.trc.2018.03.020","article-title":"The fleet size and mix dial-a-ride problem with reconfigurable vehicle capacity","volume":"91","author":"Tellez","year":"2018","journal-title":"Transp. Res. C Emerg. Technol."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1451","DOI":"10.1109\/TITS.2014.2298892","article-title":"B-planner: Planning bidirectional night bus routes using large-scale taxi GPS traces","volume":"15","author":"Chen","year":"2014","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"1894","DOI":"10.2514\/1.19972","article-title":"Multi-objective Pareto concurrent subspace optimization for multidisciplinary design","volume":"45","author":"Huang","year":"2007","journal-title":"AIAA J."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","article-title":"An exact \u03b5-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits","volume":"194","author":"Berube","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Deb, K., Agrawal, S., Pratap, A., and Meyarivan, T. (2000, January 18\u201320). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. Proceedings of the Sixth International Conference on Parallel Problem Solving From Nature, Paris, France.","DOI":"10.1007\/3-540-45356-3_83"},{"key":"ref_42","unstructured":"Liu, H.D. (2008). Research on Bus Transit Routes Network Design Theory and Implement Method. [Ph.D. Thesis, Tongji University]."},{"key":"ref_43","unstructured":"Yan, P., and Song, R. (2011). Urban Public Transit Introduction, China Machine Press. [1st ed.]."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/4\/514\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:44:20Z","timestamp":1760186660000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/11\/4\/514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,10]]},"references-count":43,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2019,4]]}},"alternative-id":["sym11040514"],"URL":"https:\/\/doi.org\/10.3390\/sym11040514","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,10]]}}}