EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3264. A Black Widow Optimization for The Time-dependent Vehicle Routing Problem with Fleet and Crew Assignment

Invited abstract in session MA-60: Vehicle routing I, stream Transportation.

Monday, 8:30-10:00
Room: S09 (building: 101)

Authors (first author is the speaker)

1. Antonia Ilabaca
School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso
2. Germán Paredes-Belmar
School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso

Abstract

This paper focuses on the efficient distribution of goods in urban areas by using the time-dependent vehicle routing problem with fleet and crew assignment (TD-VRPFCA). The objective is to find the best routes for a group of vehicles to deliver goods to a set of destinations, considering various factors that are specific to city logistics, such as traffic congestion, the locations of different buildings, and the difficulties that delivery workers may face in accessing these places. Unlike the traditional vehicle routing problem, our focus is on the efficient crew assignment for delivery vehicles. The crew composition can consist of different roles, such as drivers, delivery workers, or a multifunctional worker who perform both driving and delivery tasks. The crew assignment aims to minimize the total distribution time, considering that service and travel time depend on the time of day and the location of each vehicle due to the traffic flow of people in the buildings and congestion on the streets.

To solve this problem, we propose a new algorithm called Black Widow Optimization (BWO) for Vehicle Routing Problems. BWO is an efficient metaheuristics algorithm proposed for continuous variables, but in this paper, we propose an algorithm for mixed integer variables. The resulting set of efficient routes and crew vehicle assignments can support decision-making and improve customer service.

Keywords

Status: accepted

Back to the list of papers