1,675
Views
34
CrossRef citations to date
0
Altmetric
ARTICLES

Customized bus routing problem with time window restrictions: model and case study

, , , &
Pages 1804-1824 | Received 10 Dec 2018, Accepted 13 Jul 2019, Published online: 25 Jul 2019

References

  • Bräysy, O., and M. Gendreau. 2005. “Vehicle Routing Problem with Time Windows, Part ii: Metaheuristics.” Transportation Science 39 (1): 119–139. doi:10.1287/trsc.1030.0057.
  • Cao, Y., and J. Wang. 2016. “The Key Contributing Factors of Customized Shuttle Bus in Rush Hour: A Case Study in Harbin City.” Procedia Engineering 137: 478–486. doi:10.1016/j.proeng.2016.01.283.
  • Cao, Y., and J. Wang. 2017. “An Optimization Method of Passenger Assignment for Customized Bus.” Mathematical Problems in Engineering 2017: 1–9. doi:10.1155/2017/7914753.
  • Chandra, S., and L. Quadrifoglio. 2013. “A Model for Estimating the Optimal Cycle Length of Demand Responsive Feeder Transit Services.” Transportation Research Part B: Methodological 51: 1–16. doi:10.1016/j.trb.2013.01.008.
  • Charisis, A., C. Iliopoulou, and K. Kepaptsoglou. 2018. “DRT Route Design for the First/Last Mile Problem: Model and Application to Athens, Greece.” Public Transport 10: 499–527. doi:10.1007/s12469-018-0188-0.
  • Cordeau, J. F. 2006. “A Branch-and-cut Algorithm for the Dial-a-Ride Problem.” Operations Research 54 (3): 573–586. doi:10.1287/opre.1060.0283.
  • Cordeau, J. F., and G. Laporte. 2007. “The Dial-a-Ride Problem: Models and Algorithms.” Annals of Operations Research 153 (1): 29–46. doi:10.1007/s10479-007-0170-8.
  • Drakoulis, R., F. Bellotti, I. Bakas, R. Berta, P. K. Paranthaman, G. R. Dange, et al. 2018. “A Gamified Flexible Transportation Service for On-Demand Public Transport.” IEEE Transactions Intelligent Transportation Systems 19 (3): 921–933. doi:10.1109/TITS.2018.2791643.
  • Fischetti, M., Salazar González, Juan José, and P. Toth. 1997. “A Branch-and-cut Algorithm for the Symmetric Generalized Traveling Salesman Problem.” Operations Research 45 (3): 378–394. doi:10.1287/opre.45.3.378.
  • Fukasawa, R., H. Longo, J. Lysgaard, M. P. de Aragão, M. Reis, E. Uchoa, and R. F. Werneck. 2006. “Robust Branch-and-cut-and-Price for the Capacitated Vehicle Routing Problem.” Mathematical Programming 106 (3): 491–511. doi:10.1007/s10107-005-0644-x.
  • Garcia, B. L., J. Y. Potvin, and J. M. Rousseau. 1994. “A Parallel Implementation of the Tabu Search Heuristic for Vehicle Routing Problems with Time Window Constraints.” Computers & Operations Research 21 (9): 1025–1033. doi:10.1016/0305-0548(94)90073-6.
  • Glover, F., and M. Laguna. 1997. Tabu Search. Boston, MA: Kluwer Academic Publishers.
  • Guo, R., W. Guan, and W. Zhang. 2018. “Route Design Problem of Customized Bus: Mixed Integer Programming Model and Case Study.” Journal of Transportation Engineering, Part A: Systems 144 (11). doi:10.1061/JTEPBS.0000185.
  • Guo, R., W. Guan, W. Zhang, Z. Zhang, and A. Huang. 2019. “Extracting Potential Customized Service from Smartcard Data.” Submitted.
  • Harms, S., and B. Truffer. 1998. “The Emergence of a Nationwide Carsharing Cooperative in Switzerland.” In a Case-study for the EC-supported Research Project “Strategic Niche Management as a Tool for Transition to a Sustainable Transport System”. Zürich: EAWAG.
  • Ho, S. C., W. Y. Szeto, Y. H. Kuo, J. M. Y. Leung, M. Petering, and T. W. H. Tou. 2018. “A Survey of Dial-a-Ride Problems: Literature Review and Recent Developments.” Transportation Research Part B: Methodological 111: 395–421. doi:10.1016/j.trb.2018.02.001.
  • Holland, J. H. 1992. “Adaptation in Natural and Artificial Systems.” Ann Arbor 6 (2): 126–137.
  • Ji, L. 2017. “Reasons and Control Measures for the Decline of Bus Passenger Flow.” Urban Public Transport 2017 (11): 13–16.
  • Kirby, R., and K. Bhatt. 1975. “An Analysis of Subscription Bus Experience.” Traffic Quarterly 29 (3): 403–425.
  • Li, J., Y. Lv, J. Ma, and Q. Ouyang. 2018a. “Methodology for Extracting Potential Customized Bus Routes Based on Bus Smart Card Data.” Energies 11 (9): 2224. doi:10.3390/en11092224.
  • Li, X., and L. Quadrifoglio. 2010. “Feeder Transit Services: Choosing Between Fixed and Demand Responsive Policy.” Transportation Research Part C: Emerging Technologies 18 (5): 770–780. doi:10.1016/j.trc.2009.05.015.
  • Li, Z., R. Song, S. He, and M. Bi. 2018b. “Methodology of Mixed Load Customized Bus Lines and Adjustment Based on Time Windows.” Plos one 13 (1): e0189763.
  • Liu, T., and A. Ceder. 2015. “Analysis of a New Public-Transport-Service Concept: Customized Bus in China.” Transport Policy 39: 63–76. doi:10.1016/j.tranpol.2015.02.004.
  • Liu, T., A. Ceder, R. Bologna, and B. Cabantous. 2016. “Commuting by Customized Bus: A Comparative Analysis with Private Car and Conventional Public Transport in Two Cities.” Journal of Public Transportation 19 (2): 55–74. doi:10.5038/2375-0901.19.2.4.
  • Lysgaard, J., A. N. Letchford, and R. W. Eglese. 2004. “A New Branch-and-cut Algorithm for the Capacitated Vehicle Routing Problem.” Mathematical Programming 100 (2): 423–445. doi:10.1007/s10107-003-0481-8.
  • Lyu, Y., C. Y. Chow, V. C. Lee, Y. Li, and J. Zeng. 2016. “T2CBS: Mining Taxi Trajectories for Customized Bus Systems.” In Computer Communications Workshops (INFOCOM WKSHPS), 2016 IEEE Conference on. IEEE, 441–446. doi:10.1109/INFCOMW.2016.7562117.
  • Ma, X., Y. J. Wu, Y. Wang, F. Chen, and J. Liu. 2013. “Mining Smart Card Data for Transit Riders’ Travel Patterns.” Transportation Research Part C: Emerging Technologies 36: 1–12. doi:10.1016/j.trc.2013.07.010.
  • Ma, J., Y. Yang, W. Guan, F. Wang, T. Liu, W. Tu, and C. Song. 2017. “Large-Scale Demand Driven Design of a Customized Bus Network: A Methodological Framework and Beijing Case Study.” Journal of Advanced Transportation 2017 (3): 1–14. doi:10.1155/2017/3865701.
  • Ma, J., Y. Zhao, Y. Yang, T. Liu, W. Guan, J. Wang, et al. 2017. “A Model for the Stop Planning and Timetables of Customized Buses.” Plos One 12 (1). doi:10.1371/journal.pone.0168762.
  • Masmoudi, M. A., K. Braekers, M. Masmoudi, and A. Dammak. 2017. “A Hybrid Genetic Algorithm for the Heterogeneous Dial-a-Ride Problem.” Computers & Operations Research 81: 1–13. doi:10.1016/j.cor.2016.12.008.
  • Mitchell, and E. John. 2011. Branch and Cut. Wiley Encyclopedia of Operations Research and Management Science.
  • Nguyen, P. K., T. G. Crainic, and M. Toulouse. 2013. “A Tabu Search for Time-Dependent Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows.” European Journal of Operational Research 231 (1): 43–56. doi:10.1016/j.ejor.2013.05.026.
  • Padberg, M., and G. Rinaldi. 1991. “A Branch-and-cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems.” SIAM Review 33 (1): 60–100. doi:10.1137/1033004.
  • Qiu, G., R. Song, S. He, W. Xu, and M. Jiang. 2018. “Clustering Passenger Trip Data for the Potential Passenger Investigation and Line Design of Customized Commuter Bus.” IEEE Transactions on Intelligent Transportation Systems, 1–10. doi:10.1109/tits.2018.2875466.
  • Quadrifoglio, L., and X. Li. 2009. “A Methodology to Derive the Critical Demand Density for Designing and Operating Feeder Transit Services.” Transportation Research Part B: Methodological 43 (10): 922–935. doi:10.1016/j.trb.2009.04.003.
  • Ren, Y., G. Chen, Y. Han, and H. Zheng. 2016. “Extracting Potential Bus Lines of Customized City Bus Service Based on Public Transport Big Data.” IOP Conference Series: Earth and Environmental Science 46: 1. doi:10.1088/1755-1315/46/1/012017.
  • Tabassum, S., S. Tanaka, F. Nakamura, and A. Ryo. 2017. “Feeder Network Design for Mass Transit System in Developing Countries (Case Study of Lahore, Pakistan).” Transportation Research Procedia 25: 3129–3146. doi:10.1016/j.trpro.2017.05.343.
  • Tellez, O., S. Vercraene, Fabien Lehuédé, Olivier Péton, and T. Monteiro. 2018. “The Fleet Size and Mix Dial-a-Ride Problem with Reconfigurable Vehicle Capacity.” Transportation Research Part C: Emerging Technologies 91: 99–123. doi:10.1016/j.trc.2018.03.020.
  • Thangiah, S. R. 1993. Vehicle Routing with Time Windows using Genetic Algorithms. Artificial Intelligence Lab., Slippery Rock University.
  • Thangiah, S. R., K. E. Nygard, and P. L. Juell. 1991. “Gideon: A Genetic Algorithm System for Vehicle Routing with Time Windows.” In Artificial Intelligence Applications, 1991. Proceedings., Seventh IEEE Conference on. IEEE. Vol. 1. 322-328.doi:10.1109/CAIA.1991.120888.
  • Tong, L. C., L. Zhou, J. Liu, and X. Zhou. 2017. “Customized Bus Service Design for Jointly Optimizing Passenger-to-Vehicle Assignment and Vehicle Routing.” Transportation Research Part C: Emerging Technologies 85: 451–475. doi:10.1016/j.trc.2017.09.022.
  • Wang, Z., and R. Wang. 2015. “Adaptive Management of Beijing Urban Traffic: A Case Study of the Customized Transit Bus Service.” Modern Urban Research 3: 1–8.
  • Wong, K. I., A. F. Han, and C. W. Yuen. 2014. “On Dynamic Demand Responsive Transport Services with Degree of Dynamism.” Transportmetrica A: Transport Science 10 (1): 55–73. doi:10.1080/18128602.2012.694491.
  • Xiong, J., W. Guan, L. Song, A. Huang, and C. Shao. 2013. “Optimal Routing Design of a Community Shuttle for Metro Stops.” Journal of Transportation Engineering 139 (12): 1211–1223. doi:10.1061/(ASCE)TE.1943-5436. 0000608.
  • Xu, K. M., J. L. Li, J. Feng, and Z. Y. Meng. 2013. “Discussion on Subscription Bus Service.” Urban Transport of China 11 (5): 24–27.
  • Yu, Y., R. B. Machemehl, and C. Xie. 2015. “Demand-responsive Transit Circulator Service Network Design.” Transportation Research Part E: Logistics and Transportation Review 76: 160–175. doi:10.1016/j.tre.2015.02.009.
  • Zhang, J., D. Z. Wang, and M. Meng. 2017. “Analysing Customized Bus Service on a Multimodal Travel Corridor: An Analytical Modelling Approach.” Journal of Transportation Engineering, Part A: Systems 143 (11): 04017057. doi:10.1061/JTEPBS.0000087.
  • Zhou, C., Wei Guan, J. Xiong, and S. Jiang. 2017. “A Study on Dynamic Dispatching Strategy of Customized Bus.” In Control Science and Systems Engineering (ICCSSE), 2017 3rd IEEE International Conference on. IEEE, 751–755. doi:10.1109/CCSSE.2017.8088034.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.