Branch-and-cut algorithms for the split delivery vehicle routing problem

A heuristic approach and a tabu search for the heterogeneous multi-type fleet vehicle routing problem with time windows and an incompatible loading constraint

“…Recently, several variants of the traditional VRPSD have been explored in the literature including the vehicle routing problem with discrete split deliveries and time windows (Matteo & Ilaria, 2011), the heterogeneous fleet vehicle routing problem with time windows and split deliveries (Patrícia & Hugo, 2013), the multi-depot split delivery vehicle routing problem (Damon, Bruce, & Edward, 2011), and the crude oil transportation with split deliveries (Nishi & Izuno, 2014). In addition, two exact branch-and-cut algorithms for the VRPSD based on two relaxed formulations that provide lower bounds to the optimum were presented by Archetti, Bianchessi, and Speranza (2014).…”

A novel approach to solve the split delivery vehicle routing problem

“…Except for some special classes of instances, the SDVRP is NP‐hard (Archetti et al., ; Dror and Trudeau, ) in general. Many exact (Archetti et al., , ; Belenguer et al., ; Jin et al., ; Moreno et al., ) and heuristic (Aleman and Hill, ; Aleman et al., ; Archetti et al., ; Berbotto et al., ; Chen et al., ) approaches have been proposed in the last decade. The branch‐and‐cut algorithm proposed by Archetti et al.…”

An Iterated Local Search Platform for Transportation Logistics

“…The Multi-Depot VRP (MDVRP) is a generalization of the problem where more than one depot may be considered [21]. More recently, other VRP variants have been evoked such as Split Delivery VRP [4], rollon-rolloff VRP [22] and Multi-Trip VRP [6].…”