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

► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the lit...

Full description

Saved in:
Bibliographic Details
Published in:Computers & industrial engineering 2013-02, Vol.64 (2), p.589-601
Main Authors: Belfiore, Patrícia, Yoshizaki, Hugo T.Y.
Format: Article
Language:English
Subjects:
Customer services
Deliveries
Heuristic
Heuristics
Routing
Scatter search
Studies
Transportation problem (Operations research)
Vehicle routing and scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:► This paper studies the FSMVRPTWSD. ► The FSMVRPTW considers time windows and a heterogeneous fleet. ► In the VRPSD customers can be served by more than one vehicle. ► We propose a scatter search approach to solve the FSMVRPTWSD. ► Our algorithm is competitive with the best results found in the literature. 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.
ISSN:0360-8352
1879-0550
DOI:10.1016/j.cie.2012.11.007