How to cite this paper
Ouaddi, K., Mhada, F & Benadada, Y. (2020). Memetic algorithm for multi-tours dynamic vehicle routing problem with overtime (MDVRPOT).International Journal of Industrial Engineering Computations , 11(4), 643-662.
Refrences
Albareda-Sambola, M., Fernández, E., & Laporte, G. (2014). The dynamic multiperiod vehicle routing problem with probabilistic information. Computers and Operations Research, 48, 31–39.
Ayadi, R., & Benadada, Y. (2013). Memetic algorithm for a multi-objective vehicle routing problem with multiple trips. International Journal of Computer Science and Applications, 10(2), 72–91.
Azi, N., Gendreau, M., & Potvin, J. Y. (2012). A dynamic vehicle routing problem with multiple delivery routes. Annals of Operations Research, 199(1), 103–112.
Barkaoui, M., Berger, J., & Boukhtouta, A. (2015). Customer satisfaction in dynamic vehicle routing problem with time windows. Applied Soft Computing Journal, 35, 423–432.
Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR Spectrum, 32(1), 77–107.
Benyahia, I., & Potvin, J. Y. (1998). Decision support for vehicle dispatching using genetic programming. IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans., 28(3), 306–314.
Bolaños, R. I., Escobar, J. W., & Echeverri, M. G. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461–478.
Brandão, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing and and scheduling problem. European Journal of Operational Research, 100(97), 180–191.
Brandão, J., & Mercer, A. (1998). The Multi-Trip Vehicle Routing Problem. Journal of the Operational Research Society, 49, 799–805.
Cheikh, M., Ratli, M., Mkaouar, O., & Jarboui, B. (2015). A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electronic Notes in Discrete Mathematics, 47, 277–284.
Chen, Z. L., & Xu, H. (2006). Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science, 40(1), 74–88.
Cheung, B. K. S., Choy, K. L., Li, C. L., Shi, W., & Tang, J. (2008). Dynamic routing model and solution methods for fleet management with mobile technologies. International Journal of Production Economics, 113(2), 694–705.
Crainic, T. G., Gendreau, M., & Potvin, J. Y. (2009). Intelligent freight-transportation systems: Assessment and the contribution of operations research. Transportation Research Part C: Emerging Technologies, 17(6), 541–557.
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91.
Dondo, R., & Cerdá, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478–1507.
Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers and Industrial Engineering, 57(4), 1472–1483.
Eydi, A., & Javazi, L. (2012). A novel heuristic method to solve the capacitated arc routing problem. International Journal of Industrial Engineering Computations, 3(5), 767–776.
Ferland, J. A., & Michelon, P. (1988). The vehicle scheduling problem with Multiple Vehicle Types. Journal of Operational Research Society, 39(6), 577–583.
Fleischmann, B. (1990). The vehicle routing problem with multiple use of the vehicles. Fachbereich Wirtschaftswissenschaften,Universitat Hamburg, Germany.
Gendreau, M., Guertin, F., Potvin, J.-Y., & Taillard, É. (1999). Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33(4), 381–390.
Gendreau, M., Guertin, F., Potvin, J. Y., & Séguin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies, 14(3), 157–174.
Gendreau, M., Iori, M., Laporte, G., & Martello, S. (2008). A Tabu Search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks, 51(1), 4–18.
Gillett, B. E., & Miller, L. R. (1974). A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations Research, 22(2), 340–349.
Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers and Operations Research, 11(1), 49–66.
Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7(2), 113–148.
Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers and Operations Research, 32(11), 2959–2986.
Hanshar, F. T., & Ombuki-Berman, B. M. (2007). Dynamic vehicle routing using genetic algorithms. Applied Intelligence, 27(1), 89–99.
Hemert, J. I. va., & Poutré, J. A. La. (2010). Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation. 692–701.
Hong, L. (2012). An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers and Operations Research, 39(2), 151–163.
Hvattum, L. M., Løkketangen, A., & Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, 40(4), 421–438.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2000). Diversion Issues in Real-Time Vehicle Dispatching. Transportation Science, 34(4), 426–438.
Ichoua, S., Gendreau, M., & Potvin, J. Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 379–396.
Irnich, S. (2000). Multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. European Journal of Operational Research, 122(2), 310–328.
Jaillet, P., & Wagner, M. R. (2008). Generalized online routing: New competitive ratios, resource augmentation, and asymptotic analyses. Operations Research, 56(3), 745–757.
Khouadjia, M. R., Sarasola, B., Alba, E., Jourdan, L., & Talbi, E. G. (2012). A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing Journal, 12(4), 1426–1439.
Kilby, P., Prosser, P., & Shaw, P. (1998). Dynamic VRPs: A Study of Scenarios. Report APES-06-1998, (April), 1–11.
Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(33), 1–14.
Kulkarni, R. V., & Bhave, P. R. (1985). Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20(1), 58–67.
Letchford, A. N., & Eglese, R. W. (1998). The rural postman problem with deadline classes. European Journal of Operational Research, 105(3), 390–400.
Levy, D., Sundar, K., & Rathinam, S. (2014). Heuristics for routing heterogeneous unmanned vehicles with fuel constraints. Mathematical Problems in Engineering.
Li, F., Golden, B., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34(9), 2734–2742.
Lin, C., Choy, K. L., Ho, G. T. S., Lam, H. Y., Pang, G. K. H., & Chin, K. S. (2014). A decision support system for optimizing dynamic courier routing operations. Expert Systems with Applications, 41(15), 6917–6933.
Mańdziuk, J., & Żychowski, A. (2016). A memetic approach to vehicle routing problem with dynamic requests. Applied Soft Computing Journal, 48, 522–534.
Mingozzi, A., Roberti, R., & Toth, P. (2013). An exact algorithm for the multitrip vehicle routing problem. INFORMS Journal on Computing, 25(2), 193–207.
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005). A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System. Second International Workshop on Freight Transportation and Logistics, 1(1), 1–4.
Olivera, A., & Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers and Operations Research, 34(1), 28–47.
Ouaddi, K., Benadada, Y., & Mhada, F.-Z. (2018). Ant Colony System for Dynamic Vehicle Routing Problem with Overtime. International Journal of Advanced Computer Science and Applications, 9(6), 306–315.
Petch, R. J., & Salhi, S. (2003). A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics, 133(1–3), 69–92.
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1–11.
Prins, C. (2002). Efficient Heuristics for the Heterogeneous Fleet Multitrip VRP with Application to a Large-Scale Real Case. Journal of Mathematical Modelling and Algorithms, 1(2), 135–150.
Psaraftis, H. N. (1980). A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem. Transportation Science, 14(2), 130–154.
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016). Dynamic vehicle routing problems: Three decades and counting. Networks, 67(1), 3–31.
Rochat, Y., & Taillard, É. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1), 147–167.
Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103(1), 95–112.
Salhi, Said, Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers and Operations Research, 52, 315–325.
Schyns, M. (2015). An ant colony system for responsive dynamic vehicle routing. European Journal of Operational Research, 245(3), 704–718.
Seixas, M. P., & Mendes, A. B. (2013). Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet. Mathematical Problems in Engineering, 2013.
Solomon. (1983). Vehicle Routing and Scheduling with Time Window Constraints: Models and Algorithms. Ph.D. Dissertation, Dept. of Decision Sciences, University of Pennsylvania., 130(2), 556.
Stewart, W. R., & Golden, B. L. (1984). A Lagrangean relaxation heuristic for vehicle routing. European Journal of Operational Research, 15(1), 84–88.
Taillard, D., Gambardella, L. M., & Gendreau, M. (2001). Adaptive memory programming : A unified view of metaheuristics. 135.
Taillard, É. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661–673.
Taillard, É. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO (Recherche Opérationnelle/ Operations Research), 33, 1–14.
Taillard, É., Laporte, G., & Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. Journal of the Operational Research Society, 47(8), 1065–1070.
Xu, Y., Wang, L., & Yang, Y. (2012). A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows. Electronic Notes in Discrete Mathematics, 39, 289–296.
Yellow, P. (1970). A Computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 12, 281–283.
Ayadi, R., & Benadada, Y. (2013). Memetic algorithm for a multi-objective vehicle routing problem with multiple trips. International Journal of Computer Science and Applications, 10(2), 72–91.
Azi, N., Gendreau, M., & Potvin, J. Y. (2012). A dynamic vehicle routing problem with multiple delivery routes. Annals of Operations Research, 199(1), 103–112.
Barkaoui, M., Berger, J., & Boukhtouta, A. (2015). Customer satisfaction in dynamic vehicle routing problem with time windows. Applied Soft Computing Journal, 35, 423–432.
Beaudry, A., Laporte, G., Melo, T., & Nickel, S. (2010). Dynamic transportation of patients in hospitals. OR Spectrum, 32(1), 77–107.
Benyahia, I., & Potvin, J. Y. (1998). Decision support for vehicle dispatching using genetic programming. IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans., 28(3), 306–314.
Bolaños, R. I., Escobar, J. W., & Echeverri, M. G. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461–478.
Brandão, J., & Mercer, A. (1997). A tabu search algorithm for the multi-trip vehicle routing and and scheduling problem. European Journal of Operational Research, 100(97), 180–191.
Brandão, J., & Mercer, A. (1998). The Multi-Trip Vehicle Routing Problem. Journal of the Operational Research Society, 49, 799–805.
Cheikh, M., Ratli, M., Mkaouar, O., & Jarboui, B. (2015). A variable neighborhood search algorithm for the vehicle routing problem with multiple trips. Electronic Notes in Discrete Mathematics, 47, 277–284.
Chen, Z. L., & Xu, H. (2006). Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science, 40(1), 74–88.
Cheung, B. K. S., Choy, K. L., Li, C. L., Shi, W., & Tang, J. (2008). Dynamic routing model and solution methods for fleet management with mobile technologies. International Journal of Production Economics, 113(2), 694–705.
Crainic, T. G., Gendreau, M., & Potvin, J. Y. (2009). Intelligent freight-transportation systems: Assessment and the contribution of operations research. Transportation Research Part C: Emerging Technologies, 17(6), 541–557.
Dantzig, G. B., & Ramser, J. H. (1959). The Truck Dispatching Problem. Management Science, 6(1), 80–91.
Dondo, R., & Cerdá, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478–1507.
Eksioglu, B., Vural, A. V., & Reisman, A. (2009). The vehicle routing problem: A taxonomic review. Computers and Industrial Engineering, 57(4), 1472–1483.
Eydi, A., & Javazi, L. (2012). A novel heuristic method to solve the capacitated arc routing problem. International Journal of Industrial Engineering Computations, 3(5), 767–776.
Ferland, J. A., & Michelon, P. (1988). The vehicle scheduling problem with Multiple Vehicle Types. Journal of Operational Research Society, 39(6), 577–583.
Fleischmann, B. (1990). The vehicle routing problem with multiple use of the vehicles. Fachbereich Wirtschaftswissenschaften,Universitat Hamburg, Germany.
Gendreau, M., Guertin, F., Potvin, J.-Y., & Taillard, É. (1999). Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching. Transportation Science, 33(4), 381–390.
Gendreau, M., Guertin, F., Potvin, J. Y., & Séguin, R. (2006). Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Transportation Research Part C: Emerging Technologies, 14(3), 157–174.
Gendreau, M., Iori, M., Laporte, G., & Martello, S. (2008). A Tabu Search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks, 51(1), 4–18.
Gillett, B. E., & Miller, L. R. (1974). A Heuristic Algorithm for the Vehicle-Dispatch Problem. Operations Research, 22(2), 340–349.
Golden, B., Assad, A., Levy, L., & Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers and Operations Research, 11(1), 49–66.
Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7(2), 113–148.
Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers and Operations Research, 32(11), 2959–2986.
Hanshar, F. T., & Ombuki-Berman, B. M. (2007). Dynamic vehicle routing using genetic algorithms. Applied Intelligence, 27(1), 89–99.
Hemert, J. I. va., & Poutré, J. A. La. (2010). Dynamic Routing Problems with Fruitful Regions: Models and Evolutionary Computation. 692–701.
Hong, L. (2012). An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers and Operations Research, 39(2), 151–163.
Hvattum, L. M., Løkketangen, A., & Laporte, G. (2006). Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science, 40(4), 421–438.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2000). Diversion Issues in Real-Time Vehicle Dispatching. Transportation Science, 34(4), 426–438.
Ichoua, S., Gendreau, M., & Potvin, J. Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 379–396.
Irnich, S. (2000). Multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. European Journal of Operational Research, 122(2), 310–328.
Jaillet, P., & Wagner, M. R. (2008). Generalized online routing: New competitive ratios, resource augmentation, and asymptotic analyses. Operations Research, 56(3), 745–757.
Khouadjia, M. R., Sarasola, B., Alba, E., Jourdan, L., & Talbi, E. G. (2012). A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing Journal, 12(4), 1426–1439.
Kilby, P., Prosser, P., & Shaw, P. (1998). Dynamic VRPs: A Study of Scenarios. Report APES-06-1998, (April), 1–11.
Koç, Ç., Bektaş, T., Jabali, O., & Laporte, G. (2016). Thirty years of heterogeneous vehicle routing. European Journal of Operational Research, 249(33), 1–14.
Kulkarni, R. V., & Bhave, P. R. (1985). Integer programming formulations of vehicle routing problems. European Journal of Operational Research, 20(1), 58–67.
Letchford, A. N., & Eglese, R. W. (1998). The rural postman problem with deadline classes. European Journal of Operational Research, 105(3), 390–400.
Levy, D., Sundar, K., & Rathinam, S. (2014). Heuristics for routing heterogeneous unmanned vehicles with fuel constraints. Mathematical Problems in Engineering.
Li, F., Golden, B., & Wasil, E. (2007). A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem. Computers and Operations Research, 34(9), 2734–2742.
Lin, C., Choy, K. L., Ho, G. T. S., Lam, H. Y., Pang, G. K. H., & Chin, K. S. (2014). A decision support system for optimizing dynamic courier routing operations. Expert Systems with Applications, 41(15), 6917–6933.
Mańdziuk, J., & Żychowski, A. (2016). A memetic approach to vehicle routing problem with dynamic requests. Applied Soft Computing Journal, 48, 522–534.
Mingozzi, A., Roberti, R., & Toth, P. (2013). An exact algorithm for the multitrip vehicle routing problem. INFORMS Journal on Computing, 25(2), 193–207.
Montemanni, R., Gambardella, L. M., Rizzoli, A. E., & Donati, A. V. (2005). A new algorithm for a Dynamic Vehicle Routing Problem based on Ant Colony System. Second International Workshop on Freight Transportation and Logistics, 1(1), 1–4.
Olivera, A., & Viera, O. (2007). Adaptive memory programming for the vehicle routing problem with multiple trips. Computers and Operations Research, 34(1), 28–47.
Ouaddi, K., Benadada, Y., & Mhada, F.-Z. (2018). Ant Colony System for Dynamic Vehicle Routing Problem with Overtime. International Journal of Advanced Computer Science and Applications, 9(6), 306–315.
Petch, R. J., & Salhi, S. (2003). A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discrete Applied Mathematics, 133(1–3), 69–92.
Pillac, V., Gendreau, M., Guéret, C., & Medaglia, A. L. (2013). A review of dynamic vehicle routing problems. European Journal of Operational Research, 225(1), 1–11.
Prins, C. (2002). Efficient Heuristics for the Heterogeneous Fleet Multitrip VRP with Application to a Large-Scale Real Case. Journal of Mathematical Modelling and Algorithms, 1(2), 135–150.
Psaraftis, H. N. (1980). A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem. Transportation Science, 14(2), 130–154.
Psaraftis, H. N., Wen, M., & Kontovas, C. A. (2016). Dynamic vehicle routing problems: Three decades and counting. Networks, 67(1), 3–31.
Rochat, Y., & Taillard, É. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1), 147–167.
Salhi, S., & Sari, M. (1997). A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research, 103(1), 95–112.
Salhi, Said, Imran, A., & Wassan, N. A. (2014). The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers and Operations Research, 52, 315–325.
Schyns, M. (2015). An ant colony system for responsive dynamic vehicle routing. European Journal of Operational Research, 245(3), 704–718.
Seixas, M. P., & Mendes, A. B. (2013). Column generation for a multitrip vehicle routing problem with time windows, driver work hours, and heterogeneous fleet. Mathematical Problems in Engineering, 2013.
Solomon. (1983). Vehicle Routing and Scheduling with Time Window Constraints: Models and Algorithms. Ph.D. Dissertation, Dept. of Decision Sciences, University of Pennsylvania., 130(2), 556.
Stewart, W. R., & Golden, B. L. (1984). A Lagrangean relaxation heuristic for vehicle routing. European Journal of Operational Research, 15(1), 84–88.
Taillard, D., Gambardella, L. M., & Gendreau, M. (2001). Adaptive memory programming : A unified view of metaheuristics. 135.
Taillard, É. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661–673.
Taillard, É. D. (1999). A heuristic column generation method for the heterogeneous fleet VRP. RAIRO (Recherche Opérationnelle/ Operations Research), 33, 1–14.
Taillard, É., Laporte, G., & Gendreau, M. (1996). Vehicle routeing with multiple use of vehicles. Journal of the Operational Research Society, 47(8), 1065–1070.
Xu, Y., Wang, L., & Yang, Y. (2012). A New Variable Neighborhood Search Algorithm for the Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows. Electronic Notes in Discrete Mathematics, 39, 289–296.
Yellow, P. (1970). A Computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, 12, 281–283.