Stochastic programming model for integrating bus network design and dial-a-ride scheduling

References

• Aldaihani, M., and M. M. Dessouky. 2003. “Hybrid Scheduling Methods for Paratransit Operations.” Computers & Industrial Engineering 45 (1): 75–96. doi:https://doi.org/10.1016/S0360-8352(03)00032-9.
   Web of Science ®Google Scholar
• An, K., and H. K. Lo. 2014. “Service Reliability-Based Transit Network Design with Stochastic Demand.” Transportation Research Record: Journal of the Transportation Research Board 2467: 101–109.
   Web of Science ®Google Scholar
• Attanasio, A., J. Cordeau, G. Ghiani, and G. Laporte. 2004. “Parallel Tabu Search Heuristics for the Dynamic Multi-vehicle Dial-a-ride Problem.” Parallel Computing 30: 377–387.
   Web of Science ®Google Scholar
• Azadeh, A., and H. Farrokhi-Asl. 2017. “The Close–open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 1–15.
   Web of Science ®Google Scholar
• Baaj, M. H., and H. S. Mahmassani. 1991. “An AI-based Approach for Transit Route System Planning and Design.” Journal of Advanced Transportation 25 (2): 187–209.
   Google Scholar
• Baugh, J., G. Kakivaya, and J. Stone. 1998. “Intractability of the Dial-a-ride Problem and a Multiobjective Solution Using Simulated Annealing.” Engineering Optimization 30: 91–123.
   Web of Science ®Google Scholar
• Birge, J. R., and F. Louveaux. 2011. Introduction to Stochastic Programming. Springer Science & Business Media.
   Google Scholar
• Braekers, K., A. Caris, and G. K. Janssens. 2014. “Exact and Meta-heuristic Approach for a General Heterogeneous Dial-a-ride Problem with Multiple Depots. Transportation Research Part B.” Methodological 67: 166–186.
   Google Scholar
• Brake, J., and J. D. Nelson. 2007b. “A Case Study of Flexible Solutions to Transport Demand in A Deregulated Environment.” Journal of Transport Geography 15: 262–273
   Web of Science ®Google Scholar
• Brake, J., M. Corinne, J. D. Nelson, and S. Wright. 2007a. “Key Lessons Learned from Recent Experience with Flexible Transport Services.” Transport Policy 14: 458–466.
   Web of Science ®Google Scholar
• Chassaing, M., C. Duhamel, and P. Lacomme. 2016. “An ELS-based Approach with Dynamic Probabilities Management in Local Search for the Dial-A-Ride Problem.” Engineering Applications of Artificial Intelligence 48: 119–133.
   Web of Science ®Google Scholar
• Chu, J. C. 2018. “Mixed-integer Programming Model and Branch-and-price-and-cut Algorithm for Urban Bus Network Design and Timetabling.” Transportation Research Part B 108: 188–216.
   Google Scholar
• Cordeau, J. F. 2006. “A Branch-and-cut Algorithm for the Dial-A-ride Problem.” Operations Research 54 (3): 573–586.
   Web of Science ®Google Scholar
• Cordeau, J. F., and G. Laporte. 2003. “A Tabu Search Heuristic for the Static Multi-vehicle Dial-A-ride Problem.” Transportation Research Part B: Methodological 37 (6): 579–594.
   Web of Science ®Google Scholar
• Cordeau, J. F., and G. Laporte. 2007. “The Dial-a-ride Problem: Models and Algorithms.” Annals of Operations Research 153 (1): 29–46.
   Web of Science ®Google Scholar
• Coslovich, L., R. Pesenti, and W. Ukovich. 2006. “A Two-phase Insertion Technique of Unexpected Customers for A Dynamic Dial-A-ride Problem.” European Journal of Operational Research 175 (3): 1605–1615.
   Web of Science ®Google Scholar
• Daganzo, C. F. 1978. “An Approximate Analytic Model of Many-to-many Demand Responsive Transportation Systems.” Transportation Research 12 (5): 325–333.
   Google Scholar
• Gendreau, M., and J. Y. Potvin. 1998. Dynamic Vehicle Routing and Dispatching. Fleet Management and Logistics, 115–126. Springer US.
   Google Scholar
• Gschwind, T., and M. Drexl. 2019. “Adaptive Large Neighborhood Search with a Constant-time Feasibility Test for the Dial-a-ride Problem.” Transportation Science 53 (2): 480–491.
   Web of Science ®Google Scholar
• Häll, C. H., H. Andersson, J. Lundgren, and P. Värbrand. 2009. “The Integrated Dial-a-Ride Problem.” Public Transport 1: 39–54.
   Google Scholar
• Jaw, J. J., A. R. Odoni, H. N. Psaraftis, and N. H. Wilson. 1986. “A Heuristic Algorithm for the Multi-vehicle Advance Request Dial-A-ride Problem with Time Windows.” Transportation Research Part B: Methodological 20 (3): 243–257.
   Web of Science ®Google Scholar
• Khani, A., M. Hickman, and H. Noh. 2015. “Trip-Based Path Algorithms Using the Transit Network Hierarchy.” Networks and Spatial Economics 15 (3): 635–653.
   Web of Science ®Google Scholar
• Mageean, J., and D. J. Nelson. 2003. “The Evaluation of Demand Responsive Transport Services in Europe.” Journal of Transport Geography 11 (4): 255–270.
   Google Scholar
• Masson, R., F. Lehuédé, and O. Péton. 2013. “An Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Transfers.” Transportation Science 47 (3): 344–355.
   Web of Science ®Google Scholar
• Nelson, J. D., S. Wright, B. Masson, B. Ambrosino, and A. Naniopoulos. 2010. “Recent Developments in Flexible Transport Services.” Research in Transportation Economics 29: 243–248.
   Google Scholar
• Parragh, S. N., K. F. Doerner, and R. F. Hartl. 2010. “Variable Neighborhood Search for the Dial-a-ride Problem.” Computers & Operations Research 37 (6): 1129–1138.
   Web of Science ®Google Scholar
• Pattnaik, S. B., S. Mohan, and V. M. Tom. 1998. “Urban Bus Transit Route Network Design Using Genetic Algorithm.” Journal of Transportation Engineering 124 (4): 368–375.
   Web of Science ®Google Scholar
• Posada, M., H. Andersson, and C. H. Häll. 2017. “The Integrated Dial-a-ride Problem with Timetabled Fixed Route Service.” Public Transport 9 (1): 217–241.
   Web of Science ®Google Scholar
• Prékopa, A. 2013. Stochastic Programming. Springer Science & Business Media.
   Google Scholar
• Quirion-Blais, O., M. Trépanier, and A. Langevin. 2015. “A Case Study of Snow Plow Routing Using an Adaptive Large Hood Search Metaheuristic.” Transportation Letters 7 (4): 201–209.
   Web of Science ®Google Scholar
• Ropke, S., and D. Pisinger. 2006. “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.” Transportation Science 40 (4): 455–472.
   Web of Science ®Google Scholar
• Shapiro, A., D. Dentcheva, and A. Ruszczyński. 2009. “Lectures on Stochastic Programming: Modeling and Theory.” Society for Industrial and Applied Mathematics.
   Google Scholar
• Till, J., G. Sand, M. Urselmann, and S. Engell. 2007. “A Hybrid Evolutionary Algorithm for Solving Two-stage Stochastic Integer Programs in Chemical Batch Scheduling.” Computers & Chemical Engineering 31 (5): 630–647.
   Web of Science ®Google Scholar
• Tom, V. M., and S. Mohan. 2003. “Transit Route Network Design Using Frequency Coded Genetic Algorithm.” Journal of Transportation Engineering 129 (2): 186–195.
   Web of Science ®Google Scholar
• Tometzki, T., and S. Engell. 2009. “Hybrid Evolutionary Optimization of Two-stage Stochastic Integer Programming Problems: An Empirical Investigation.” Evolutionary Computation 17 (4): 511–526.
   PubMed Web of Science ®Google Scholar
• Uchida, K., A. Sumalee, D. Watling, and R. Connors. 2007. “A Study on Network Design Problems for Multi-modal Networks by Probit-based Stochastic User Equilibrium.” Networks and Spatial Economics 7 (3): 213–240.
   Web of Science ®Google Scholar
• Wilson, N., J. Sussman, H. Wang, and B. Higonnet. 1971. “Scheduling Algorithms for Dial-a-ride Systems.” Technical Report USL-TR-71-13. USA: Massachusetts Institute of Technology.
   Google Scholar
• Yan, S., J. C. *. Chu, and W.-C. Hung. 2019. “A Customer Selection and Vehicle Scheduling Model for Moving Companies.” Transportation Letters. doi:https://doi.org/10.1080/19427867.2019.1671061.
   Google Scholar
• Yao, B., Q. Cao, Z. Wang, P. Hu, M. Zhang, and B. Yu. 2016. “A Two-stage Heuristic Algorithm for the School Bus Routing Problem with Mixed Load Plan.” Transportation Letters 8 (4): 205–219.
   Web of Science ®Google Scholar
• Zhou, Z., J. Zhang, P. Liu, Z. Li, M. C. Georgiadis, and E. N. Pistikopoulos. 2013. “A Two-stage Stochastic Programming Model for the Optimal Design of Distributed Energy Systems.” Applied Energy 103: 135–144.
   Web of Science ®Google Scholar