Optimizing Vehicle Routing and Scheduling under Time Constraints

Dejan Brcanov; Karlo Bala; Michele Bandecchi; Nebojša Gvozdenović

doi:10.5937/10.5937/AnEkSub2400005B

Optimizing Vehicle Routing and Scheduling under Time Constraints

Dejan Brcanov Faculty of Economics Subotica, University of Novi Sad
Karlo Bala
Michele Bandecchi
Nebojša Gvozdenović

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.

Online_first_041_2024_10_04

Published

2024-10-04

How to Cite

Brcanov, D., Bala, K., Bandecchi, M., & Gvozdenović, N. (2024). Optimizing Vehicle Routing and Scheduling under Time Constraints. Anali Ekonomskog Fakulteta U Subotici, (00). https://doi.org/10.5937/10.5937/AnEkSub2400005B

Download Citation

Issue

Vol No 00 (0): Anali_Online_First

Section

Original scientific article

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