Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries

Authors:
PatríCia Belfiore;Hugo T. Y. Yoshizaki
Affiliations:
Department of Management Engineering, Federal University of ABC, Rua Teixeira da Silva, 426, ap. 143, São Paulo, SP, Brazil;Department of Production Engineering, University of São Paulo (USP), Av. Prof. Luciano Gualberto, 908, Sala FG-207, 2 andar, Cidade Universitária, São Paulo, SP, Brazil
Venue:
Computers and Industrial Engineering
Year:
2013

Citing 10
Cited 0

Algorithms for the vehicle routing and scheduling problems with time window constraints

Operations Research
A new heuristic for the fleet size and mix vehicle routing problem

Computers and Operations Research
Vehicle routing with split deliveries

Discrete Applied Mathematics
The split delivery vehicle scheduling problem with time windows and grid network distances

Computers and Operations Research
A tabu search heuristic for the heterogenous fleet vehicle routing problem

Computers and Operations Research
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution
A Lower Bound for the Split Delivery Vehicle Routing Problem

Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

Transportation Science
Worst-Case Analysis for Split Delivery Vehicle Routing Problems

Transportation Science
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a scatter-search (SS) approach to solve the Fleet Size and Mixed Vehicle Routing Problem with Time Windows and Split Deliveries (FSMVRPTWSD). In the Vehicle Routing Problem with Split Deliveries (VRPSD), each customer can be served by more than one vehicle, as opposed to the classical VRP in which each customer is served only once. In the FSMVRPTW, the customers must be serviced within their time windows with minimal costs using a heterogeneous fleet. Experimental testing and benchmark examples are used to assess the merit of our proposed procedure. The results show that the proposed heuristics are competitive with the best results found in the literature.