Bräysy, O. (2003). A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS Journal on Computing, 15(4), 347-368.
Bräysy, O., & Gendreau, M. (2005a). Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation science, 39(1), 104-118.
Bräysy, O., & Gendreau, M. (2005b). Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation science, 39(1), 119-139.
Bräysy, O., & Hasle, G. (2014). Software Tools and Emerging Technologies for Vehicle Routing and Intermodal Transportation. Vehicle Routing: Problems, Methods, and Applications, 18, 351.
Chang, Y. S., Lee, Y. J., & Choi, S. B. (2015). More Traffic Congestion in Larger Cities?-Scaling Analysis of the Large 101 US Urban Centers.
Chopra, S., & Meindl, P. (2007). Supply chain management. Strategy, planning & operation: Springer.
Cordeau, J.-F., Gendreau, M., Laporte, G., Potvin, J.-Y., & Semet, F. (2002). A guide to vehicle routing heuristics. Journal of the Operational Research society, 53(5), 512-522.
Dabia, S., Ropke, S., Van Woensel, T., & De Kok, T. (2013). Branch and price for the time-dependent vehicle routing problem with time windows. Transportation science, 47(3), 380-396.
DFT. (2010). Integrated Research Study: HGV Satellite Navigation and Route Planning. Retrieved April 01, 2013, from http://www.freightbestpractice.org.uk/products/3705_7817_integrated-research-study--hgv-satellite-navigation-and-route-planning.aspx.
Donati, A. V., Montemanni, R., Casagrande, N., Rizzoli, A. E., & Gambardella, L. M. (2008). Time dependent vehicle routing problem with a multi ant colony system. European journal of operational research, 185(3), 1174-1191.
Drexl, M. (2012). Rich vehicle routing in theory and practice. Logistics Research, 5(1-2), 47-63.
Eglese, R., Maden, W., & Slater, A. (2006). A road timetableTM to aid vehicle routing and scheduling. Computers & operations research, 33(12), 3508-3519.
Ehmke, J. F., Steinert, A., & Mattfeld, D. C. (2012). Advanced routing for city logistics service providers based on time-dependent travel times. Journal of Computational Science, 3(4), 193-205.
Figliozzi, M. A. (2012). The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics. Transportation Research Part E-Logistics and Transportation Review, 48(3), 616-636. doi: DOI 10.1016/j.tre.2011.11.006
Fleischmann, B., Gietz, M., & Gnutzmann, S. (2004). Time-varying travel times in vehicle routing. Transportation science, 38(2), 160-173.
FTA. (2015). Logistics Report 2015.Delivering Safe, Efficient, Sustainable Logistics. In FTA (Ed.), About. Tunbridge Wells: FTA.
Gendreau, M., Ghiani, G., & Guerriero, E. (2015). Time-dependent routing problems: A review. Computers & operations research, 64, 189-197.
Golden, B., Wasil, E., Kelly, J., & Chao, I. (1998). Fleet Management and Logistics, chapter The Impact of Metaheuristics on Solving the Vehicle Routing Problem: algorithms, problem sets, and computational results: Kluwer Academic Publishers, Boston.
Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers & operations research, 32(11), 2959-2986.
Hallamaki, A., Hotokka, P., Brigatti, J., Nakari, P., Bräysy, O., & T, R. (2007). Vehicle Routing Software: A Survey and Case Studies with Finish Data. Technical Report. Finland: University of Jyväskylä.
Hansen, P., & Mladenović, N. (2001). Variable neighborhood search: Principles and applications. European journal of operational research, 130(3), 449-467.
Hansen, P., Mladenović, N., & Pérez, J. A. M. (2010). Variable neighbourhood search: methods and applications. Annals of Operations Research, 175(1), 367-407.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2003). Vehicle dispatching with time-dependent travel times. European journal of operational research, 144(2), 379-396.
IMRG. (2012). UK valuing home delivery review 2012. In IMRG (Ed.).
Javelin-Group. (2011). How many stores will we really need? UK non-food retailing in 2020. In L. J. Group. (Ed.).
Jiang, J., Ng, K. M., Poh, K. L., & Teo, K. M. (2014). Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications, 41(8), 3748-3760.
Kok, A., Hans, E., & Schutten, J. (2012). Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Computers & operations research, 39(5), 910-918.
Kritzinger, S., Tricoire, F., Doerner, K. F., & Hartl, R. F. (2011). Variable neighborhood search for the time-dependent vehicle routing problem with soft time windows Learning and Intelligent Optimization (pp. 61-75): Springer.
Kytöjoki, J., Nuortio, T., Bräysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & operations research, 34(9), 2743-2757.
Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research society, 721-732.
Malandraki, C. (1989). Time dependent vehicle routing problems: Formulations, solution algorithms and computational experiments.
Malandraki, C., & Daskin, M. S. (1992). Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms. Transportation science, 26(3), 185-200.
Mattos Ribeiro, G., & Laporte, G. (2012). An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers & operations research, 39(3), 728-735.
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & operations research, 24(11), 1097-1100.
Nagata, Y., Bräysy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & operations research, 37(4), 724-737.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & operations research, 34(8), 2403-2435.
Polacek, M., Hartl, R. F., Doerner, K., & Reimann, M. (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of heuristics, 10(6), 613-627.
Rincon-Garcia, N., Waterson , B. J., & Cherret, T. J. (2015). Requirements from Vehicle Routing Software: Perspectives from literature, developers and the freight industry. Under Review.
Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455-472.
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000). Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159(2), 139-171.
Shaw, P. (1997). A new local search algorithm providing high quality solutions to vehicle routing problems. APES Group, Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK.
Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems Principles and Practice of Constraint Programming—CP98 (pp. 417-431): Springer.
Solomon, M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints Operations Research, 35(2), 254-265.
Sörensen, K. (2015). Metaheuristics—the metaphor exposed. International Transactions in Operational Research, 22(1), 3-18.
Toth, P., & Vigo, D. (2001). The vehicle routing problem: Siam.
US-Department-Of-Transport. (2003). Final Report -Traffic Congestion and Reliability: Linking Solutions to Problems.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013). A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & operations research, 40(1), 475-489.
Visser, J., Nemoto, T., & Browne, M. (2014). Home delivery and the impacts on urban freight transport: A review. Procedia-social and behavioral sciences, 125, 15-27.
Zachariadis, E. E., & Kiranoudis, C. T. (2010). A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Computers & operations research, 37(12), 2089-2105.