How to cite this paper
Nasri, M., Metrane, A., Hafidi, I & Jamali, A. (2020). A robust approach for solving a vehicle routing problem with time windows with uncertain service and travel times.International Journal of Industrial Engineering Computations , 11(1), 1-16.
Refrences
Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L., Poss, M., & Requejo, C. (2012). Layered Formulation for the robust vehicle routing problem with time windows. Lecture Notes in Computer Science, 7422, 249-260.
Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L., Poss, M., & Requejo, C. (2013). The robust vehicle routing problem with time windows. Computers and Operations Research, 40(3), 856-866.
Alumur, S., Nickel, S., & Saldanha-da-Gama, F. (2012). Hub location under uncertainty. Transportation Research Part B: Methodological, 46(4), 529-543.
Angélica Salazar-Aguilar, M., Langevin, A., & Laporte, G. (2012). Synchronized arc routing for snow plowing operations. Computers & Operations Research, 39(7), 1432-1440.
Baron, O., Milner, J., & Naseraldin, H. (2011). Facility location: A robust optimization approach. Production and Operations Management, 20(5), 772-785.
Ben-Tal, A., Boaz, G., & Shimrit, S. (2009). Robust multi-echelon multi-period inventory control. European Journal of Operational Research, 199(3), 922-935.
Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71.
Bienstock, D., & Özbay, N. (2008). Computing robust basestock levels. Discrete Optimization, 5(2), 389-414.
Bräysy, O., & Gendreau, M. (2005). Vehicle Routing Problem with time windows. Part II: Metaheuristics. Journal Transportation Science, 39(1), 119-139.
Chaharsooghi, S., Momayezi, F., & Ghaffarinasab, N. (2017). An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions. International Journal of Industrial Engineering Computations, 8(2), 191-202.
Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2012). Consistency in multi-vehicle inventory routing. Transportation Research Part C: Emerging technologies, 24:270-287.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
Dror, M., Laporte, G., & Louveaux, F.V. (1993). Vehicle Routing with Stochastic Demands and Restricted Failures. ZOR – Methods and Models of Operations Research, 37(3), 273-183.
Dror, M., & Trudeau, P. (1986). Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research, 23(2), 228-235.
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2016). A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. European Journal of Operational Research, 249(1), 55-66, 2016.
Fabozzi, F. J., Kolm, P. N., Pachamanova, D., & Focardi, S. M. (2007). Robust portfolio optimization and management. Wiley.
Gendreau, M., Hertz, A., Laporte, G., & Stan, M. (1998). A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Operations Research, 46(3), 330-335.
Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3-12.
Goren, S., & Sabuncuoglu, I. (2008). Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40(1):66-83.
Gounaris, C.E., Wiesemann, W., & Floudas, C.A. (2013). The robust capacitated vehicle routing problem under demand uncertainty. Operations Research, 61(3), 677-693.
Gülpinar, N., Pachamanova, D., Çanakoglu, E. (2013). Robust strategies for facility location under uncertainty. European Journal of Operational Research, 255(1), 21-35.
Gülpinar, N., & Rustem, B. (2007). Worst-case robust decisions for multi-period mean-variance portfolio optimization. European Journal of Operational Research, 183(3), 981-1000.
Hazir, Ö., Haouari, M., & Erel, E. (2010). Robust scheduling and robustness measures for the discrete time/cost trade-off problem. European Journal of Operational Research, 207(2), 633-643.
Kallehauge, B., Larsen, J., Madsen, O., & Solomon, M. (2005). Vehicle Routing Problem with Time Windows. (eds) Column Generation. Springer, 67-98.
Minoux, M. (2010). Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Applied Mathematics, 158(5), 597-603.
Moghaddam, B. F., Ruiz, R., & Sadjadi, S. J. (2012). Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Computers & Industrial Engineering, 62(1), 306-317.
Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jiménez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115-129.
Labadie, N., Prins, C., & Prodhon, C. (2016). Metaheuristics for Vehicle Routing Problems. WILEY, 3.
Noorizadegan, M., Galli L. & Chen B. (2012). On the heterogeneous vehicle routing problem under demand uncertainty. In: 21st International Symposium on Mathematical Programming, Berlin, Germany, 1-25.
Ordóñez, F. (2010). Robust Vehicle Routing. Tutorials in Operations Research, Institue for Operations Research ans the Management Sciences (INFORMS), 153-178, Maryland, USA.
Palomo-Martínez Pamela, J., Angélica Salazar-Aguilar, M. & Laporte, G. (2017). Planning a selective delivery schedule through Adaptive Large Neighborhood Search. Computers & Industrial Engineering, 112, 368-378.
Pillac, V., Gendreau, M., Guéret, C. & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 255(1), 1-11.
Pinar, Ç. (2007). Robust scenario optimization based on downside-risk measure for multi-period portfolio selection. OR Spectrum, 29(2), 295-309.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435.
PrescottGagnon, E., Desaulniers, G., & Rousseau, L. M. (2009). A branch and price based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks, 54(4), 190-204.
Rincon-Garcia, N., Waterson, B., & Cherrett, T. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141-160.
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.
Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming. Springer Berlin Heidelberg, 1520, 417-431.
Solomon, M. (1987). Algorithms for the Vehicle Routing and Scheduling Problem with time Window Constraints. Operations Research, 35(2), 254-265.
Sungur, I., Ordóñez, F., & Dessouky, M. (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions, 40(5), 509-523.
Toklu, N. E., Montemanni, R., & Gambardella, L. M. (2013). An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. Swarm Intelligence (SIS), Proceeding IEEE Symposium on, 32-39.
Wu, L., Hifi, M., & Bederina, H. (2017). A new robust criterion for the vehicle routing problem with uncertain travel time. Computers & Industrial Engineering, 112, 607-615.
Yousefi, H., Tavakkoli-Moghaddam, R., Oliaei, N., Mohammadi, M., & Mozaffari, A. (2017). Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach. International Journal of Industrial Engineering Computations, 8(3), 283-302.
Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L., Poss, M., & Requejo, C. (2013). The robust vehicle routing problem with time windows. Computers and Operations Research, 40(3), 856-866.
Alumur, S., Nickel, S., & Saldanha-da-Gama, F. (2012). Hub location under uncertainty. Transportation Research Part B: Methodological, 46(4), 529-543.
Angélica Salazar-Aguilar, M., Langevin, A., & Laporte, G. (2012). Synchronized arc routing for snow plowing operations. Computers & Operations Research, 39(7), 1432-1440.
Baron, O., Milner, J., & Naseraldin, H. (2011). Facility location: A robust optimization approach. Production and Operations Management, 20(5), 772-785.
Ben-Tal, A., Boaz, G., & Shimrit, S. (2009). Robust multi-echelon multi-period inventory control. European Journal of Operational Research, 199(3), 922-935.
Bertsimas, D., & Sim, M. (2003). Robust discrete optimization and network flows. Mathematical Programming, 98(1-3), 49-71.
Bienstock, D., & Özbay, N. (2008). Computing robust basestock levels. Discrete Optimization, 5(2), 389-414.
Bräysy, O., & Gendreau, M. (2005). Vehicle Routing Problem with time windows. Part II: Metaheuristics. Journal Transportation Science, 39(1), 119-139.
Chaharsooghi, S., Momayezi, F., & Ghaffarinasab, N. (2017). An adaptive large neighborhood search heuristic for solving the reliable multiple allocation hub location problem under hub disruptions. International Journal of Industrial Engineering Computations, 8(2), 191-202.
Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2012). Consistency in multi-vehicle inventory routing. Transportation Research Part C: Emerging technologies, 24:270-287.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80-91.
Dror, M., Laporte, G., & Louveaux, F.V. (1993). Vehicle Routing with Stochastic Demands and Restricted Failures. ZOR – Methods and Models of Operations Research, 37(3), 273-183.
Dror, M., & Trudeau, P. (1986). Stochastic vehicle routing with modified savings algorithm. European Journal of Operational Research, 23(2), 228-235.
Errico, F., Desaulniers, G., Gendreau, M., Rei, W., & Rousseau, L.-M. (2016). A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. European Journal of Operational Research, 249(1), 55-66, 2016.
Fabozzi, F. J., Kolm, P. N., Pachamanova, D., & Focardi, S. M. (2007). Robust portfolio optimization and management. Wiley.
Gendreau, M., Hertz, A., Laporte, G., & Stan, M. (1998). A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows. Operations Research, 46(3), 330-335.
Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3-12.
Goren, S., & Sabuncuoglu, I. (2008). Robustness and stability measures for scheduling: single-machine environment. IIE Transactions, 40(1):66-83.
Gounaris, C.E., Wiesemann, W., & Floudas, C.A. (2013). The robust capacitated vehicle routing problem under demand uncertainty. Operations Research, 61(3), 677-693.
Gülpinar, N., Pachamanova, D., Çanakoglu, E. (2013). Robust strategies for facility location under uncertainty. European Journal of Operational Research, 255(1), 21-35.
Gülpinar, N., & Rustem, B. (2007). Worst-case robust decisions for multi-period mean-variance portfolio optimization. European Journal of Operational Research, 183(3), 981-1000.
Hazir, Ö., Haouari, M., & Erel, E. (2010). Robust scheduling and robustness measures for the discrete time/cost trade-off problem. European Journal of Operational Research, 207(2), 633-643.
Kallehauge, B., Larsen, J., Madsen, O., & Solomon, M. (2005). Vehicle Routing Problem with Time Windows. (eds) Column Generation. Springer, 67-98.
Minoux, M. (2010). Robust network optimization under polyhedral demand uncertainty is NP-hard. Discrete Applied Mathematics, 158(5), 597-603.
Moghaddam, B. F., Ruiz, R., & Sadjadi, S. J. (2012). Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Computers & Industrial Engineering, 62(1), 306-317.
Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jiménez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115-129.
Labadie, N., Prins, C., & Prodhon, C. (2016). Metaheuristics for Vehicle Routing Problems. WILEY, 3.
Noorizadegan, M., Galli L. & Chen B. (2012). On the heterogeneous vehicle routing problem under demand uncertainty. In: 21st International Symposium on Mathematical Programming, Berlin, Germany, 1-25.
Ordóñez, F. (2010). Robust Vehicle Routing. Tutorials in Operations Research, Institue for Operations Research ans the Management Sciences (INFORMS), 153-178, Maryland, USA.
Palomo-Martínez Pamela, J., Angélica Salazar-Aguilar, M. & Laporte, G. (2017). Planning a selective delivery schedule through Adaptive Large Neighborhood Search. Computers & Industrial Engineering, 112, 368-378.
Pillac, V., Gendreau, M., Guéret, C. & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 255(1), 1-11.
Pinar, Ç. (2007). Robust scenario optimization based on downside-risk measure for multi-period portfolio selection. OR Spectrum, 29(2), 295-309.
Pisinger, D., & Ropke, S. (2007). A general heuristic for vehicle routing problems. Computers & Operations Research, 34(8), 2403-2435.
PrescottGagnon, E., Desaulniers, G., & Rousseau, L. M. (2009). A branch and price based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks, 54(4), 190-204.
Rincon-Garcia, N., Waterson, B., & Cherrett, T. (2017). A hybrid metaheuristic for the time-dependent vehicle routing problem with hard time windows. International Journal of Industrial Engineering Computations, 8(1), 141-160.
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.
Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In International conference on principles and practice of constraint programming. Springer Berlin Heidelberg, 1520, 417-431.
Solomon, M. (1987). Algorithms for the Vehicle Routing and Scheduling Problem with time Window Constraints. Operations Research, 35(2), 254-265.
Sungur, I., Ordóñez, F., & Dessouky, M. (2008). A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Transactions, 40(5), 509-523.
Toklu, N. E., Montemanni, R., & Gambardella, L. M. (2013). An ant colony system for the capacitated vehicle routing problem with uncertain travel costs. Swarm Intelligence (SIS), Proceeding IEEE Symposium on, 32-39.
Wu, L., Hifi, M., & Bederina, H. (2017). A new robust criterion for the vehicle routing problem with uncertain travel time. Computers & Industrial Engineering, 112, 607-615.
Yousefi, H., Tavakkoli-Moghaddam, R., Oliaei, N., Mohammadi, M., & Mozaffari, A. (2017). Solving a bi-objective vehicle routing problem under uncertainty by a revised multi-choice goal programming approach. International Journal of Industrial Engineering Computations, 8(3), 283-302.