A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem

Berbotto, Leonardo; García, Sergio; Nogales, Francisco J.

doi:10.1007/s10479-012-1282-3

Cited by 45 publications

(24 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A randomised granular tabu search heuristic was used to solve the split delivery vehicle routing problem by Berbotto et al (2014). The method builds a granular neighbourhood to reduce the computational time required to explore solution neighbourhood.…”

Section: Load Splittingmentioning

confidence: 99%

See 1 more Smart Citation

Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

Curtois

Laesanklang

Landa-Silva

et al. 2017

Proceedings of the 6th International Conference on Operations Research and Enterprise Systems

View full text Add to dashboard Cite

A note on versions:The version presented here may differ from the published version or from the version of record. If you wish to cite this item you are advised to consult the publisher's version. Please see the repository url above for details on accessing the published version and note that access may require a subscription. Abstract: This paper gives an overview of research work in progress within the COSLE (Collaborative Optimisation in a Shared Logistics Environment) project between the University of Nottingham and Microlise Ltd. This is an R&D project that seeks to develop optimisation technology to enable more efficient collaboration in transportation, particularly real-world operational environments involving pickup and delivery problems. The overall aim of the project is to integrate various optimisation techniques into a framework that facilitates collaboration in a shared freight transport logistics environment with the overall goal of reducing empty mileage.

show abstract

Section: Load Splittingmentioning

confidence: 99%

“…This includes the delete split operator, exchange split operator, etc. These operators were applied to VRP (Berbotto et al, 2014). The delete split operator removes a set of split loads to become a full demand load.…”

Section: Load Splittingmentioning

confidence: 99%

Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

Curtois

Laesanklang

Landa-Silva

et al. 2017

Proceedings of the 6th International Conference on Operations Research and Enterprise Systems

View full text Add to dashboard Cite

show abstract

“…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.…”

Section: Sdvrp and Related Problemsmentioning

confidence: 99%

“…Except for some special classes of instances, the SDVRP is NP-hard (Archetti et al, 2011b;Dror and Trudeau, 1990) in general. Many exact (Archetti et al, 2011a(Archetti et al, , 2014Belenguer et al, 2000;Jin et al, 2008;Moreno et al, 2010) and heuristic Archetti et al, 2008;Berbotto et al, 2014;Chen et al, 2007) approaches have been proposed in the last decade. The branch-and-cut algorithm proposed by Archetti et al (2014) was capable of solving most instances with as many as 50 customers and two instances with 75 and 100 customers.…”

Section: Sdvrp and Related Problemsmentioning

confidence: 99%

A novel approach to solve the split delivery vehicle routing problem

Chen

Golden

Wang

et al. 2016

Int Trans Operational Res

View full text Add to dashboard Cite

The split delivery vehicle routing problem (SDVRP) is a relaxed version of the classic capacitated vehicle routing problem (CVRP). Customer demands are allowed to split among vehicles. This problem is computationally challenging and the state‐of‐the‐art heuristics are often complicated to describe and difficult to implement, and usually have long computing times. All these hinder their application by practitioners to solve real‐world problems. We propose a novel, efficient, and easily implemented approach to solve the SDVRP using an a priori split strategy, that is, each customer demand is split into small pieces in advance. Our computational experiments on 82 benchmark instances show that our algorithm is overall much more efficient and produces results that are comparable to those from the state‐of‐the‐art approaches.

show abstract

“…The first heuristic method is a two-stage local search algorithm developed by Dror and Trudeau (1989). The subsequent studies (Archetti et al 2006;Boudia et al 2007;Mota et al 2007;Chen et al 2007;Jin et al 2008;Khmelev and Kochetov 2015;Wilck IV and Cavalier 2012a, b;Silva et al 2015;Berbotto et al 2014) focus on hybrid methods and metaheuristics. Archetti and Speranza (2012) provides a comprehensive discussion on heuristics.…”

Section: Introductionmentioning

confidence: 99%

New exact solution approaches for the split delivery vehicle routing problem

Özbaygın

Karaşan

Yaman

2018

EURO Journal on Computational Optimization

View full text Add to dashboard Cite

In this study, we propose exact solution methods for the split delivery vehicle routing problem (SDVRP). We first give a new vehicle-indexed flow formulation for the problem and then a relaxation obtained by aggregating the vehicle-indexed variables over all vehicles. This relaxation may have optimal solutions where several vehicles exchange loads at some customers. We cut off such solutions, in a nontraditional way, either by extending the formulation locally with vehicle-indexed variables or by node splitting. We compare these approaches using instances from the literature and new randomly generated instances. Additionally, we introduce two new extensions of the SDVRP by restricting the number of splits and by relaxing the depot return requirement and modify our algorithms to handle these extensions.Keywords Split delivery · Vehicle routing problem · Valid inequalities · Extended formulations · Exact approaches Mathematics Subject Classification 90 (specifically 90-04 and 90-08) · 90B · 90C B Hande Yaman

show abstract

A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem

Cited by 45 publications

References 28 publications

Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

Towards Collaborative Optimisation in a Shared-logistics Environment for Pickup and Delivery Operations

A novel approach to solve the split delivery vehicle routing problem

New exact solution approaches for the split delivery vehicle routing problem

Contact Info

Product

Resources

About