References
- Azadeh, A., and H. Farrokhi-Asl. 2018. “The Close-open Mixed Multi Depot Vehicle Routing Problem considering Internal and External Fleet of Vehicles.” Transportation Letters 11 (2): 78–92. doi:10.1080/19427867.2016.1274468.
- Boland, N., J. Dethridge, and I. Dumitrescu. 2006. “Accelerated Label Setting Algorithms for the Elementary Resource Constrained Shortest Path Problem.” Operations Research Letters 34: 58–68. doi:10.1016/j.orl.2004.11.011.
- Bruglieri, M., S. Mancini, F. Pezzella, O. Pisacane, and S. Suraci. 2017. “A Three-phase Matheuristic for the Time-effective Electric Vehicle Routing Problem with Partial Recharges.” Electronic Notes in Discrete Mathematics 58: 95–102. doi:10.1016/j.endm.2017.03.013.
- Cordeau, J.-F., G. Desaulniers, J. Desrosiers, M. M. Solomon, and F. Soumis. 2002. “VRP with Time Windows.” In The Vehicle Routing Problem, edited by P. Toth and D. Vigo, 156–193. Philadelphia: SIAM Monographs on discrete mathematics and applications.
- Desaulniers, G., F. Errico, S. Irnich, and M. Schneider. 2016. “Exact Algorithms for Electric Vehicle-routing Problems with Time Windows.” Operations Research 64 (6): 1388–1405. doi:10.1287/opre.2016.1535.
- Desrochers, M. “An Algorithm for the Shortest Path Problem with Resource Constraints.” Technical Report G-88-27; GERAD; 1988.
- Feillet, D., P. Dejax, M. Gendreau, and C. Gueguen. 2004. “An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints: Application to Some Vehicle Routing Problems.” Networks 44: 216–229. doi:10.1002/(ISSN)1097-0037.
- Feillet, D., M. Gendreau, and L.-M. Rousseau. 2007. “New Refinements for the Solution of Vehicle Routing Problems with Branch and Price.” INFOR 45 (4): 239–256.
- IBM . ILOG CPLEX Optimizer 12.6. https://www.ibm.com/analytics/cplex-optimizer; 2018.
- Keskin, M., and B. Çatay. 2016. “Partial Recharge Strategies for the Electric Vehicle Routing Problem with Time Windows.” Transportation Research Part C 65: 111–127. doi:10.1016/j.trc.2016.01.013.
- Keskin, M., and B. Çatay. 2018. “A Matheuristic Method for the Electric Vehicle Routing Problem with Time Windows and Fast Chargers.” Computers & Operations Research 100: 172–188. doi:10.1016/j.cor.2018.06.019.
- Montoya, A., C. Guéret, J. E. Mendoza, and J. G. Villegas. 2017. “The Electric Vehicle Routing Problem with Nonlinear Charging Function.” Transportation Research Part B 103: 87–110. doi:10.1016/j.trb.2017.02.004.
- Musolino, G., A. Polimeni, and A. Vitetta. 2018. “Freight Vehicle Routing with Reliable Link Travel Times: A Method Based on Network Fundamental Diagram.” Transportation Letters 10 (3): 159–171. doi:10.1080/19427867.2016.1241040.
- Righini, G., and M. Salani. 2008. “New Dynamic Programming Algorithms for the Resource Constrained Elementary Shortest Path Problem.” Networks 51 (3): 155–170. doi:10.1002/(ISSN)1097-0037.
- Schneider, M., A. Stenger, and D. Goeke. 2014. “The Electric Vehicle-routing Problem with Time Windows and Recharging Stations.” Transportation Science 48 (4): 500–520. doi:10.1287/trsc.2013.0490.
- Solomon, M. M. 1987. “Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.” Operations Research 35 (2): 254–265. doi:10.1287/opre.35.2.254.
- Taş, D., M. Gendreau, N. Dellaert, T. van Woensel, and A. G. de Kok. 2014a. “Vehicle Routing with Soft Time Windows and Stochastic Travel Times: A Column Generation and Branch-and-price Solution Approach.” European Journal of Operational Research 236 (3): 789–799. doi:10.1016/j.ejor.2013.05.024.
- Taş, D., O. Jabali, and T. van Woensel. 2014b. “A Vehicle Routing Problem with Flexible Time Windows.” Computers & Operations Research 52: 39–54. doi:10.1016/j.cor.2014.07.005.
- 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. doi:10.1080/19427867.2015.1110953.