{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:39:50Z","timestamp":1761676790357,"version":"build-2065373602"},"reference-count":34,"publisher":"MDPI AG","issue":"12","license":[{"start":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T00:00:00Z","timestamp":1574726400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Ride-sharing (RS) plays an important role in saving energy and alleviating traffic pressure. The vehicles in the demand-responsive feeder transit services (DRT) are generally not ride-sharing cars. Therefore, we proposed an optimal DRT model based on the ride-sharing car, which aimed at assigning a set of vehicles, starting at origin locations and ending at destination locations with their service time windows, to transport passengers of all demand points to the transportation hub (i.e., railway, metro, airport, etc.). The proposed model offered an integrated operation of pedestrian guidance (from unvisited demand points to visited ones) and transit routing (from visited ones to the transportation hub). The objective was to simultaneously minimize weighted passenger walking and riding time. A two-stage heuristic algorithm based on a genetic algorithm (GA) was adopted to solve the problem. The methodology was tested with a case study in Chongqing City, China. The results showed that the model could select optimal pick-up locations and also determine the best pedestrian and route plan. Validation and analysis were also carried out to assess the effect of maximum walking distance and the number of share cars on the model performance, and the difference in quality between the heuristic and optimal solution was also compared.<\/jats:p>","DOI":"10.3390\/info10120370","type":"journal-article","created":{"date-parts":[[2019,11,26]],"date-time":"2019-11-26T10:57:27Z","timestamp":1574765847000},"page":"370","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Optimization Model for Demand-Responsive Feeder Transit Services Based on Ride-Sharing Car"],"prefix":"10.3390","volume":"10","author":[{"given":"Bo","family":"Sun","sequence":"first","affiliation":[{"name":"School of air traffic management, Civil Aviation University of China, Tianjin 300300, China"}]},{"given":"Ming","family":"Wei","sequence":"additional","affiliation":[{"name":"School of air traffic management, Civil Aviation University of China, Tianjin 300300, China"},{"name":"Key laboratory of General Aviation Operation, Civil Aviation Administration of China (CAAC), Beijing 102202, China"}]},{"given":"Wei","family":"Wu","sequence":"additional","affiliation":[{"name":"School of air traffic management, Civil Aviation University of China, Tianjin 300300, China"}]}],"member":"1968","published-online":{"date-parts":[[2019,11,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1016\/j.trb.2009.04.003","article-title":"A methodology to derive the critical demand density for designing and operating feeder transit services","volume":"43","author":"Quadrifoglio","year":"2009","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"J. F\u00fcrbetriebswirtsch."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","article-title":"Fifty years of vehicle routing","volume":"43","author":"Laporte","year":"2009","journal-title":"Transp. Sci."},{"key":"ref_4","first-page":"6925764","article-title":"An Agent-Based Model for Dispatching Real-Time Demand-Responsive Feeder Bus","volume":"2018","author":"Li","year":"2018","journal-title":"Math. Probl. Eng."},{"key":"ref_5","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. Transp."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"48","DOI":"10.3141\/1857-06","article-title":"Real-time optimization model for dynamic scheduling of transit operations","volume":"1857","author":"Fu","year":"2003","journal-title":"Transp. Res. Rec."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s11116-016-9729-z","article-title":"Dynamic ride-sharing and fleet sizing for a system of shared autonomous vehicles in Austin, Texas","volume":"45","author":"Fagnant","year":"2018","journal-title":"Transportation"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","article-title":"Optimization for dynamic ride-sharing: A review","volume":"223","author":"Agatz","year":"2012","journal-title":"Eur. J. Oper. Res."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.trc.2017.10.022","article-title":"An empirical study on travel patterns of internet based ride-sharing","volume":"86","author":"Dong","year":"2018","journal-title":"Transp. Res. Part C Emerg. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1177\/0361198106197100102","article-title":"Optimal routing design for shuttle bus service","volume":"1971","author":"Jerby","year":"2006","journal-title":"Transp. Res. Rec."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1016\/j.sbspro.2013.08.139","article-title":"Joint optimization of a rail transit route and bus routes in a transit corridor","volume":"96","author":"Sun","year":"2013","journal-title":"Procedia Soc. Behav. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","article-title":"The dial-a-ride problem: Models and algorithms","volume":"153","author":"Cordeau","year":"2007","journal-title":"Ann. Oper. Res."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1016\/j.asoc.2011.12.014","article-title":"Solving a dial-a-ride problem with a hybrid evolutionary multi-objective approach: Application to demand responsive transport","volume":"12","author":"Chevrier","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Shen, J.X., Yang, S.Q., Gao, X.M., and Qiu, F. (2017). Vehicle routing and scheduling of demand-responsive connector with on-demand stations. Adv. Mech. Eng., 9.","DOI":"10.1177\/1687814017706433"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s13676-014-0060-6","article-title":"An extended demand responsive connector","volume":"6","author":"Savelsbergh","year":"2017","journal-title":"EURO J. Transp. Logist."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.jksus.2010.03.002","article-title":"Vehicle routing with time windows: An overview of exact, heuristic and metaheuristic methods","volume":"22","year":"2010","journal-title":"J. King Saud Univ. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","article-title":"An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation","volume":"45","author":"Kohl","year":"1997","journal-title":"Oper. Res."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","article-title":"Vehicle routing with time windows: Two optimization algorithms","volume":"45","author":"Fisher","year":"1997","journal-title":"Oper. Res."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimizationalgorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Oper. Res."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","article-title":"Multiperiodrouting problems","volume":"14","author":"Christofides","year":"1997","journal-title":"Network"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle Routing with Time Windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Oper. Res."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1720","DOI":"10.1016\/j.ejor.2005.10.010","article-title":"A goal programming approach to vehicle routing problems with soft time windows","volume":"177","author":"Oliverosc","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","article-title":"Simulated annealing metaheuristics for the vehicle routing problem with time windows","volume":"63","author":"Chiang","year":"1996","journal-title":"Ann. Oper. Res."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.cor.2008.11.003","article-title":"A hybrid evolution strategy for the open vehicle routing problem","volume":"37","author":"Repoussis","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy Simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","article-title":"A reactive tabu search metaheuristic for the vehicle routing problem with time windows","volume":"9","author":"Chiang","year":"1997","journal-title":"INFORMS J. Comput."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Sun, B., Wei, M., and Zhu, S. (2018). Optimal Design of Demand-Responsive Feeder Transit Services with Passengers\u2019 Multiple Time Windows and Satisfaction. Future Internet, 10.","DOI":"10.3390\/fi10030030"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows part II: Genetic search","volume":"8","author":"Potvin","year":"1996","journal-title":"Inf. J. Comput."},{"key":"ref_29","first-page":"347","article-title":"A hybrid genetic algorithms, simulated annealing and tabu search heuristic for vehicle routing problems with time windows","volume":"Volume 3","author":"Thangiah","year":"1999","journal-title":"Practical Handbook of Genetic Algorithms"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1023\/A:1018948011707","article-title":"A parallel algorithm for the vehicle routing problem with time windows constraints","volume":"86","author":"Schulze","year":"1999","journal-title":"Ann. Oper. Res."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Sun, B., Wei, M., Yang, C., Xu, Z., and Wang, H. (2018). Personalized and Coordinated Demand-Responsive Feeder Transit Service Design: A Genetic Algorithms Approach. Future Internet, 10.","DOI":"10.3390\/fi10070061"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1061\/(ASCE)TE.1943-5436.0000536","article-title":"Robust optimization model of bus transit network design with stochastic travel time","volume":"139","author":"Yan","year":"2013","journal-title":"J. Transp. Eng."},{"key":"ref_33","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 Methodol."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"3555","DOI":"10.3233\/JIFS-179159","article-title":"Solving demand-responsive feeder transit service design with fuzzy travel demand: A collaborative ant colony algorithm approach","volume":"37","author":"Sun","year":"2019","journal-title":"J. Intell. Fuzzy Syst."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/370\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:37:45Z","timestamp":1760189865000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/12\/370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,26]]},"references-count":34,"journal-issue":{"issue":"12","published-online":{"date-parts":[[2019,12]]}},"alternative-id":["info10120370"],"URL":"https:\/\/doi.org\/10.3390\/info10120370","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,11,26]]}}}