Time-Windowed Vehicle Routing Problem: Tabu Search Algorithm Approach

• Hasibe Berfu Demir ^[1] ; Ebru Pekel Özmen ^[2] ; Sakir Esnaf ^[3]
  1. [1] Beykent University

     Beykent University

     Turquía

     
  2. [2] Department of Industrial Engineering, Samsun University, Samsun, Turkey
  3. [3] Department of Industrial Engineering, Istanbul-Cerrahpasa University, Istanbul, Turkey

  Mostrar afiliaciones +
• Localización: ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, ISSN-e 2255-2863, Vol. 11, Nº. 2, 2022, págs. 179-189
• Idioma: inglés
• Enlaces
  • Texto completo
• Resumen

  • 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