Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from SciELO through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

Metaheuristic approaches for the vehicle routing problem with time windows and multiple deliverymen

Full text
Author(s):
Aldair Álvarez [1] ; Pedro Munari [2]
Total Authors: 2
Affiliation:
[1] Universidade Federal de São Carlos. Departamento de Engenharia de Produção - Brasil
[2] Universidade Federal de São Carlos. Departamento de Engenharia de Produção - Brasil
Total Affiliations: 2
Document type: Journal article
Source: Gestão & Produção; v. 23, n. 2, p. 279-293, 2016-06-14.
Abstract

Abstract This paper addresses the vehicle routing problem with time windows and multiple deliverymen, a variant of the vehicle routing problem which includes the decision of the crew size of each delivery vehicle, besides the usual scheduling and routing decisions. This problem arises in the distribution of goods in congested urban areas where, due to the relatively long service times, it may be difficult to serve all customers within regular working hours. Given this difficulty, an alternative consists in resorting to additional deliverymen to reduce the service times, which typically leads to extra costs in addition to travel and vehicle usage costs. The objective is to define routes for serving clusters of customers, while minimizing the number of routes, the total number of assigned deliverymen, and the distance traveled. Two metaheuristic approaches based on Iterated Local Search and Large Neighborhood Search are proposed to solve this problem. The performance of the approaches is evaluated using sets of instances from the literature. (AU)

FAPESP's process: 14/00939-8 - Interior point Branch-price-and-cut methods for variants of the vehicle routing problem
Grantee:Pedro Augusto Munari Junior
Support Opportunities: Regular Research Grants