Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach

  • Hasibe Berfu Demir
    Department of Industrial Engineering, Beykent University, Istanbul
  • Ebru Pekel Özmen
    Department of Industrial Engineering, Samsun University, Samsun pkl.ebru[at]gmail.com
  • Sakir Esnaf
    Department of Industrial Engineering, Istanbul-Cerrahpasa University, Istanbul

Abstract

Vehicle routing problem (VRP); it is defined as the problem of planning the best distribution or collection routes of the vehicles assigned to serve the scattered centers from one or more warehouses in order to meet the demands of the customers. Vehicle routing problem has been a kind of problem in which various studies have been done in recent years. Many vehicle routing problems include scheduling visits to customers who are available during certain time windows. These problems are known as vehicle routing problems with time windows (VRPTWs). In this study, a tabu search optimization is proposed for the solution of time window vehicle routing problem (VRPTWs). The results were compared with the current situation and the results were interpreted.
  • Referencias
  • Cómo citar
  • Del mismo autor
  • Métricas
Belfiore, P. Tsugunobu, H. and Yoshizaki, Y. (2008). Scatter search for Vehicle Routing Problem with Time Windows and Split Deliveries. Vehicle Routing Problem, Book edited by: Tonci Caric and Hrvoje Gold, ISBN 978-953-7619-09-1, pp. 142.

Bramel, J. and Simchi-Levi, D. (1997). The Logic of Logistics: Theory, Algorithms and Applications for Logistics Management.

Braysy, O. and Gendreau, M. (2002). Tabu Search Heuristics for The Vehicle Routing Problem with Time Windows, Sociedad de Estadística e Investigación Operativa, 10 (2), 211–237.

Cordeau, J.F., Laporte, G., Savelsbergh, M.W.P. and Vigo, D. (2007). Vehicle Routing Transportation, Handbooks in Operations Research and Management Science, 14, 367–428.

Crainic, T.G. and Laporte, G. (1998). Fleet Management and Logistics, Springer.

Glover, F., Laguna, M. (1998). Tabu Search. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0303-9_33

Gmira, M., Gendreau, M., Lodi, A. and Potvin, J.Y. (2021). Tabu Search for The Time Dependent Vehicle Routing Problem with Time Windows on A Road Network, European Journal of Operational Research, 1(1), 129–140.

Ho, S. and Haugland, D. (2004). A Tabu Search Heuristic for The Vehicle Routing p-Problem with Time Windows and Split Deliveries, Computers & Operations Research, 32, 1947–1964.

Jayaswal, S. (2000). A Comparative Study of Tabu Search and Simulated Annealing for Travelling Salesman Problem.

Moccia, L., Cordeau, J.F. and Laporte, G. (2012). An Incremental Tabu Search Heuristic for The Generalized Vehicle Routing Problem with Time Windows, Journal of the Operational Research Society, 63(2), 232–244.

Nguyen, P.K., Crainic, T.G. and Toulouse, M. (2013). Tabu Search for The Time Multi-zone Multi-trip Vehicle Routing Problem with Time Windows, European Journal of Operational Research, 231, 43–56.

Salhi, S. (2002). Defining Tabu List Size and Aspiration Criterion Within Tabu Search Methods, Computers & Operations Research, 29(1), 67–68.
Demir, H. B., Pekel Özmen, E., & Esnaf, S. (2022). Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach. ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, 11(2), 179–189. https://doi.org/10.14201/adcaij.27533

Downloads

Download data is not yet available.
+