How to cite this paper
Bajegani, E., Mollaverdi, N & Alinaghian, M. (2021). Time-dependent vehicle routing problem with backhaul with FIFO assumption: Variable neighborhood search and mat-heuristic variable neighborhood search algorithms.International Journal of Industrial Engineering Computations , 12(1), 15-36.
Refrences
Alinaghian, M., Ghazanfari, M., Norouzi, N., & Nouralizadeh, H. (2017). A novel model for the time dependent competitive vehicle routing problem: Modified random topology particle swarm optimization. Networks and Spatial Economics, 17(4), 1185–1211.
Arab, R., Ghaderi, S. F., & Tavakkoli-Moghaddam, R. (2018). Bi-objective inventory routing problem with backhauls under transportation risks: two meta-heuristics. Transportation Letters, 1–17.
Augerat, P., Belenguer, J. M., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem (Vol. 34). IMAG.
Brandao, J. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173(2), 540–555.
Brandão, J. (2016). A deterministic iterated local search algorithm for the vehicle routing problem with backhauls. Top, 24(2), 445–465.
Delgado-Antequera, L., Caballero, R., Sánchez-Oro, J., Colmenar, J. M., & Martí, R. (2020). Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Systems with Applications, 145, 113101.
Fleszar, K., Osman, I. H., & Hindi, K. S. (2009). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195(3), 803–809.
Gajpal, Y., & Abad, P. L. (2009). Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research, 196(1), 102–117.
Goetschalckx, M., & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42(1), 39–51.
Granada-Echeverri, M., Toro, E., & Santa, J. (2019). A mixed integer linear programming formulation for the vehicle routing problem with backhauls. International Journal of Industrial Engineering Computations, 10(2), 295–308.
Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers & Operations Research, 32(11), 2959–2986.
Hill, A. V, & Benton, W. C. (1992). Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. Journal of the Operational Research Society, 43(4), 343–351.
Hou, L., Li, D., & Zhang, D. (2018). Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transportation Research Part E: Logistics and Transportation Review, 118, 143–162.
Huang, Y., Zhao, L., Van Woensel, T., & Gross, J.-P. (2017). Time-dependent vehicle routing problem with path flexibility. Transportation Research Part B: Methodological, 95, 169–195.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 379–396.
Keskin, M., Laporte, G., & Çatay, B. (2019). Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations. Computers & Operations Research.
Kritzinger, S., Doerner, K. F., Hartl, R. F., Kiechle, G. Ÿ., Stadler, H., & Manohar, S. S. (2012). Using traffic information for time-dependent vehicle routing. Procedia-Social and Behavioral Sciences, 39, 217–229.
Kritzinger, S., Tricoire, F., Doerner, K. F., Hartl, R. F., & Stützle, T. (2017). A unified framework for routing problems with a fixed fleet size. International Journal of Metaheuristics, 6(3), 160–209.
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.
Malandraki, C., & Dial, R. B. (1996). A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 90(1), 45–55.
Mancini, S. (2014). Time dependent travel speed vehicle routing and scheduling on a real road network: the case of Torino. Transportation Research Procedia, 3, 433–441.
Mingozzi, A., Giorgi, S., & Baldacci, R. (1999). An exact method for the vehicle routing problem with backhauls. Transportation Science, 33(3), 315–329.
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100.
Montgomery, D. C. (2017). Design and analysis of experiments. John wiley & sons.
Mugayskikh, A. V, Zakharov, V. V, & Tuovinen, T. (2018). Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop’s Traffic Flow Assignment. 2018 22nd Conference of Open Innovations Association (FRUCT), 173–178.
Osman, I. H., & Wassan, N. A. (2002). A reactive tabu search meta‐heuristic for the vehicle routing problem with back‐hauls. Journal of Scheduling, 5(4), 263–285.
Potvin, J.-Y., & Rousseau, J.-M. (1995). An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society, 46(12), 1433–1446.
Queiroga, E., Frota, Y., Sadykov, R., Subramanian, A., Uchoa, E., & Vidal, T. (2020). On the exact solution of vehicle routing problems with backhauls. European Journal of Operational Research.
Rincon-Garcia, N., Waterson, B., Cherrett, T. J., & Salazar-Arrieta, F. (2018). A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations–An application in city logistics. Transportation Research Part A: Policy and Practice.
Saha, B., Suthar, K., & Kumar, A. (2020). Optimizing Generalized Capacitated Vehicle Routing Problem Using Augmented Savings Algorithm. In Computational Intelligence in Data Mining (pp. 527–541). Springer.
Salhi, S., Wassan, N., & Hajarat, M. (2013). The fleet size and mix vehicle routing problem with backhauls: Formulation and set partitioning-based heuristics. Transportation Research Part E: Logistics and Transportation Review, 56, 22–35.
Savelsbergh, M., & Van Woensel, T. (2016). 50th anniversary invited article—city logistics: Challenges and opportunities. Transportation Science, 50(2), 579–590.
Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285–305.
Setak, M., Habibi, M., Karimi, H., & Abedzadeh, M. (2015). A time-dependent vehicle routing problem in multigraph with FIFO property. Journal of Manufacturing Systems, 35, 37–45.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.
Soon, K. L., Lim, J. M.-Y., Parthiban, R., & Ho, M. C. (2019). Proactive eco-friendly pheromone-based green vehicle routing for multi-agent systems. Expert Systems with Applications, 121, 324–337.
Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31(4), 372–385.
Toth, P., & Vigo, D. (2002). The vehicle routing problem. SIAM.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658–673.
Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. (2014). Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. Journal of Combinatorial Optimization, 28(1), 288–309.
Arab, R., Ghaderi, S. F., & Tavakkoli-Moghaddam, R. (2018). Bi-objective inventory routing problem with backhauls under transportation risks: two meta-heuristics. Transportation Letters, 1–17.
Augerat, P., Belenguer, J. M., Benavent, E., Corberán, A., Naddef, D., & Rinaldi, G. (1995). Computational results with a branch and cut code for the capacitated vehicle routing problem (Vol. 34). IMAG.
Brandao, J. (2006). A new tabu search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research, 173(2), 540–555.
Brandão, J. (2016). A deterministic iterated local search algorithm for the vehicle routing problem with backhauls. Top, 24(2), 445–465.
Delgado-Antequera, L., Caballero, R., Sánchez-Oro, J., Colmenar, J. M., & Martí, R. (2020). Iterated greedy with variable neighborhood search for a multiobjective waste collection problem. Expert Systems with Applications, 145, 113101.
Fleszar, K., Osman, I. H., & Hindi, K. S. (2009). A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research, 195(3), 803–809.
Gajpal, Y., & Abad, P. L. (2009). Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research, 196(1), 102–117.
Goetschalckx, M., & Jacobs-Blecha, C. (1989). The vehicle routing problem with backhauls. European Journal of Operational Research, 42(1), 39–51.
Granada-Echeverri, M., Toro, E., & Santa, J. (2019). A mixed integer linear programming formulation for the vehicle routing problem with backhauls. International Journal of Industrial Engineering Computations, 10(2), 295–308.
Haghani, A., & Jung, S. (2005). A dynamic vehicle routing problem with time-dependent travel times. Computers & Operations Research, 32(11), 2959–2986.
Hill, A. V, & Benton, W. C. (1992). Modelling intra-city time-dependent travel speeds for vehicle scheduling problems. Journal of the Operational Research Society, 43(4), 343–351.
Hou, L., Li, D., & Zhang, D. (2018). Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic. Transportation Research Part E: Logistics and Transportation Review, 118, 143–162.
Huang, Y., Zhao, L., Van Woensel, T., & Gross, J.-P. (2017). Time-dependent vehicle routing problem with path flexibility. Transportation Research Part B: Methodological, 95, 169–195.
Ichoua, S., Gendreau, M., & Potvin, J.-Y. (2003). Vehicle dispatching with time-dependent travel times. European Journal of Operational Research, 144(2), 379–396.
Keskin, M., Laporte, G., & Çatay, B. (2019). Electric Vehicle Routing Problem with Time-Dependent Waiting Times at Recharging Stations. Computers & Operations Research.
Kritzinger, S., Doerner, K. F., Hartl, R. F., Kiechle, G. Ÿ., Stadler, H., & Manohar, S. S. (2012). Using traffic information for time-dependent vehicle routing. Procedia-Social and Behavioral Sciences, 39, 217–229.
Kritzinger, S., Tricoire, F., Doerner, K. F., Hartl, R. F., & Stützle, T. (2017). A unified framework for routing problems with a fixed fleet size. International Journal of Metaheuristics, 6(3), 160–209.
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.
Malandraki, C., & Dial, R. B. (1996). A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. European Journal of Operational Research, 90(1), 45–55.
Mancini, S. (2014). Time dependent travel speed vehicle routing and scheduling on a real road network: the case of Torino. Transportation Research Procedia, 3, 433–441.
Mingozzi, A., Giorgi, S., & Baldacci, R. (1999). An exact method for the vehicle routing problem with backhauls. Transportation Science, 33(3), 315–329.
Mladenović, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24(11), 1097–1100.
Montgomery, D. C. (2017). Design and analysis of experiments. John wiley & sons.
Mugayskikh, A. V, Zakharov, V. V, & Tuovinen, T. (2018). Time-Dependent Multiple Depot Vehicle Routing Problem on Megapolis Network under Wardrop’s Traffic Flow Assignment. 2018 22nd Conference of Open Innovations Association (FRUCT), 173–178.
Osman, I. H., & Wassan, N. A. (2002). A reactive tabu search meta‐heuristic for the vehicle routing problem with back‐hauls. Journal of Scheduling, 5(4), 263–285.
Potvin, J.-Y., & Rousseau, J.-M. (1995). An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society, 46(12), 1433–1446.
Queiroga, E., Frota, Y., Sadykov, R., Subramanian, A., Uchoa, E., & Vidal, T. (2020). On the exact solution of vehicle routing problems with backhauls. European Journal of Operational Research.
Rincon-Garcia, N., Waterson, B., Cherrett, T. J., & Salazar-Arrieta, F. (2018). A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations–An application in city logistics. Transportation Research Part A: Policy and Practice.
Saha, B., Suthar, K., & Kumar, A. (2020). Optimizing Generalized Capacitated Vehicle Routing Problem Using Augmented Savings Algorithm. In Computational Intelligence in Data Mining (pp. 527–541). Springer.
Salhi, S., Wassan, N., & Hajarat, M. (2013). The fleet size and mix vehicle routing problem with backhauls: Formulation and set partitioning-based heuristics. Transportation Research Part E: Logistics and Transportation Review, 56, 22–35.
Savelsbergh, M., & Van Woensel, T. (2016). 50th anniversary invited article—city logistics: Challenges and opportunities. Transportation Science, 50(2), 579–590.
Savelsbergh, M. W. P. (1985). Local search in routing problems with time windows. Annals of Operations Research, 4(1), 285–305.
Setak, M., Habibi, M., Karimi, H., & Abedzadeh, M. (2015). A time-dependent vehicle routing problem in multigraph with FIFO property. Journal of Manufacturing Systems, 35, 37–45.
Solomon, M. M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35(2), 254–265.
Soon, K. L., Lim, J. M.-Y., Parthiban, R., & Ho, M. C. (2019). Proactive eco-friendly pheromone-based green vehicle routing for multi-agent systems. Expert Systems with Applications, 121, 324–337.
Toth, P., & Vigo, D. (1997). An exact algorithm for the vehicle routing problem with backhauls. Transportation Science, 31(4), 372–385.
Toth, P., & Vigo, D. (2002). The vehicle routing problem. SIAM.
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658–673.
Zhang, T., Chaovalitwongse, W. A., & Zhang, Y. (2014). Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery. Journal of Combinatorial Optimization, 28(1), 288–309.