Optimizing Vehicle Routing and Scheduling under Time Constraints

  • Karlo Bala The Institute for Artificial Intelligence Research and Development of Serbia, Novi Sad, Serbia,
  • Michele Bandecchi SmartCloudFarming Gmbh, Berlin, Germany
  • Dejan Brcanov University of Novi Sad, Faculty of Economics in Subotica, Subotica, Serbia
  • Nebojša Gvozdenović University of Novi Sad, Faculty of Economics in Subotica, Subotica, Serbia
DOI: https://doi.org/10.5937/10.5937/AnEkSub2400005B
Keywords: vehicle routing, scheduling, time windows

Abstract

The Vehicle Routing Problem is essential in logistics for optimizing customer routes, especially in time-sensitive variants. This paper presents a two-stage algorithm for the Vehicle Routing Problem with Time Windows. It effectively minimizes the number of vehicles, with transportation costs resulting just 0,38% above the best solution found on Solomon test instances. The approach limits search time to about 10 minutes, effectively balancing complexity and solution quality.

Published
2024-10-04
How to Cite
Bala, K., Bandecchi, M., Brcanov, D., & Gvozdenović, N. (2024). Optimizing Vehicle Routing and Scheduling under Time Constraints. Anali Ekonomskog Fakulteta U Subotici, 60(52), 109-118. https://doi.org/10.5937/10.5937/AnEkSub2400005B
Issue
Vol 60 No 52 (2024)
Section
Original scientific article

Copyright (c) 2024 Anali Ekonomskog fakulteta u Subotici

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.