The vehicle routing problem

Published on Sep 1, 2016in Computers & Industrial Engineering5.431
路 DOI :10.1016/J.CIE.2015.12.007
Kris Braekers18
Estimated H-index: 18
(Research Foundation - Flanders),
Katrien Ramaekers15
Estimated H-index: 15
(University of Hasselt),
Inneke Van Nieuwenhuyse18
Estimated H-index: 18
(Katholieke Universiteit Leuven)
Sources
Abstract
Taxonomic review of vehicle routing literature published between 2009 and mid 2015.An adapted version of an existing comprehensive taxonomy is presented.277 VRP articles are classified based on problem characteristics and assumptions.The classification table allows researchers to quickly find relevant literature.Recent trends in VRP literature are discussed. Over the past decades, the Vehicle Routing Problem (VRP) and its variants have grown ever more popular in the academic literature. Yet, the problem characteristics and assumptions vary widely and few literature reviews have made an effort to classify the existing articles accordingly. In this article, we present a taxonomic review of the VRP literature published between 2009 and June 2015. Based on an adapted version of an existing comprehensive taxonomy, we classify 277 articles and analyze the trends in the VRP literature. This classification is the first to categorize the articles to this level of detail.
馃摉 Papers frequently viewed together
References310
Newest
#1Zhixing Luo (NU: Nanjing University)H-Index: 10
#2Hu Qin (HUST: Huazhong University of Science and Technology)H-Index: 18
Last. Andrew Lim (CityU: City University of Hong Kong)H-Index: 63
view all 4 authors...
In this paper, we investigate a new variant of the vehicle routing problem (VRP), termed the multi-period vehicle routing problem with time windows and limited visiting quota (MVRPTW-LVQ), which requires that any customer can be served by at most a certain number of different vehicles over the planning horizon. We first formulate this problem as a mixed integer programming model and then devise a three-stage heuristic approach to solve the problem. Extensive computational experiments demonstrate...
Source
#1Zhi-Hua Hu (Shanghai Maritime University)H-Index: 19
#2Jiuh-Biing Sheu (NTU: National Taiwan University)H-Index: 40
Last. Chung-Cheng Lu (NTUT: National Taipei University of Technology)H-Index: 26
view all 4 authors...
This study investigates a dynamic closed-loop vehicle routing problem (VRP) with uncertain pickup and deterministic delivery of incompatible goods, which is an extension of the VRP with simultaneous pickup and delivery (VRPSPD) in closed-loop logistics, where the incompatibility between goods of pickup and delivery is considered. The problem involves minimizing transportation cost, incompatibility and number of customers visited twice. A solution method based on variable neighborhood search (VNS...
Source
#1Thibaut Vidal (MIT: Massachusetts Institute of Technology)H-Index: 28
#2Maria Battarra (University of Southampton)H-Index: 18
Last. G眉ne艧 Erdo臒an (University of Bath)H-Index: 16
view all 4 authors...
The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capacitated Vehicle Routing Problem in which customers are grouped into clusters. Each cluster has to be visited once, and a vehicle entering a cluster cannot leave it until all customers have been visited. This paper presents two alternative hybrid metaheuristic algorithms for the CluVRP. The first algorithm is based on an Iterated Local Search algorithm, in which only feasible solutions are explored and problem-specific local s...
Source
#1Mustafa Avci (Dokuz Eyl眉l University)H-Index: 6
#2Seyda Topaloglu (Dokuz Eyl眉l University)H-Index: 17
Vehicle routing problem with simultaneous and mixed pickups and deliveries have been addressed.An adaptive local search algorithm is proposed to solve the problems.The proposed approach generates high-quality solutions to the benchmark instances in reasonable computation time. The Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD) is an extension to the classical Vehicle Routing Problem (VRP), where customers may both receive and send goods simultaneously. The Vehicle Routing...
Source
#1Jian Li (NAU: Nanjing Agricultural University)H-Index: 4
#2Panos M. Pardalos (UF: University of Florida)H-Index: 100
Last. Yong Zhang (SEU: Southeast University)H-Index: 1
view all 5 authors...
The proposed approach (ILS_ANS) is flexible.Novel perturbation operator is proposed.A simple and fast method to keep track of all the solutions is presented.ILS_ANS outperforms existing methods for MDVRPSDP. Although the multi-depot vehicle routing problem with simultaneous deliveries and pickups (MDVRPSDP) is often encountered in real-life scenarios of transportation logistics, it has received little attention so far. Particularly, no papers have ever used metaheuristics to solve it. In this pa...
Source
#1Chao Wang (Beijing Jiaotong University)H-Index: 17
#2Dong Mu (Beijing Jiaotong University)H-Index: 8
Last. John W. Sutherland (Purdue University)H-Index: 56
view all 4 authors...
A vehicle routing problem with simultaneous pickup-delivery and time windows is considered.A parallel simulated annealing algorithm with local search techniques is proposed.The effectiveness of the proposed algorithm is verified by test and comparison. This paper addresses a variant of the vehicle routing problem in which customers require simultaneous pickup and delivery of goods during specific individual time windows (VRPSPDTW). A general mixed integer programming model is employed to minimiz...
Source
#1S茅bastien Mouthuy (UCL: Universit茅 catholique de Louvain)H-Index: 2
#2Florence Massen (UCL: Universit茅 catholique de Louvain)H-Index: 3
Last. Pascal Van Hentenryck (ANU: Australian National University)H-Index: 64
view all 4 authors...
This paper considers the vehicle routing problem with soft time windows, a challenging routing problem where customers' time windows may be violated at a certain cost. The vehicle routing problem with soft time windows has a lexicographic objective function, aimed at minimizing first the number of routes, then the number of violated time windows, and finally the total routing distance. We present a multistage very large-scale neighborhood search for this problem. Each stage corresponds to a vari...
Source
#1G谩bor Nagy (UKC: University of Kent)H-Index: 21
#2Niaz A. Wassan (UKC: University of Kent)H-Index: 17
Last. Claudia ArchettiH-Index: 35
view all 4 authors...
The vehicle routing problem with divisible deliveries and pickups is a new and interesting model within reverse logistics. Each customer may have a pickup and delivery demand that have to be served with capacitated vehicles. The pickup and the delivery quantities may be served, if beneficial, in two separate visits. The model is placed in the context of other delivery and pickup problems and formulated as a mixed-integer linear programming problem. In this paper, we study the savings that can be...
Source
#1Somayyeh Allahyari (FUM: Ferdowsi University of Mashhad)H-Index: 1
#2Majid Salari (FUM: Ferdowsi University of Mashhad)H-Index: 13
Last. Daniele Vigo (UNIBO: University of Bologna)H-Index: 59
view all 3 authors...
We propose a generalization of the multi-depot capacitated vehicle routing problem where the assumption of visiting each customer does not hold. In this problem, called the Multi-Depot Covering Tour Vehicle Routing Problem (MDCTVRP), the demand of each customer could be satisfied in two different ways: either by visiting the customer along the tour or by 鈥渃overing鈥 it. When a customer is visited, the corresponding demand is delivered at its location. A customer is instead covered when it is loca...
Source
#1Olcay Polat (Pamukkale University)H-Index: 11
#2Can Berk Kalayci (Pamukkale University)H-Index: 16
Last. Hans-Otto G眉nther (University College of Engineering)H-Index: 2
view all 4 authors...
The Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time Limit (VRPSPDTL) is a variant of the basic Vehicle Routing Problem where the vehicles serve delivery as well as pick up operations of the clients under time limit restrictions. The VRPSPDTL determines a set of vehicle routes originating and terminating at a central depot such that the total travel distance is minimized. For this problem, we propose a mixed-integer mathematical optimization model and a perturbation based ...
Source
Cited By432
Newest
Source
#1A. Smith (Stellenbosch University)
#2Paolo Toth (UNIBO: University of Bologna)H-Index: 84
Last. JH van Vuuren (Stellenbosch University)H-Index: 11
view all 4 authors...
Abstract null null A new 鈥渞ich鈥 variation on the multi-objective vehicle routing problem (VRP), called the multi-tiered vehicle routing problem with global cross-docking (MTVRPGC), is introduced in this paper. With respect to previously studied VRPs, the MVRPTGC includes the following novel features: (i) segregation of facilities into different tiers that distinguish them in terms of different processing and storage capabilities, (ii) cross-docking at a pre-specified subset of facilities in the ...
Source
#1Yongsen Zang (THU: Tsinghua University)
#2Meiqin Wang (THU: Tsinghua University)
Last. Mingyao Qi (THU: Tsinghua University)H-Index: 11
view all 3 authors...
Abstract null null Since the battery remains a significant cost component of electric vehicles (EVs), controlling the depreciation costs of EVs鈥 batteries is of great importance, especially from the perspective of the electric vehicle routing problem (EVRP). However, most existing studies on the EVRP have not explicitly considered the battery depreciation in the cost function; instead, it has been treated as a linear function of an EV鈥檚 travel distance or time. In fact, the depth-of-discharge (D...
Source
Source
Last. Yiyun Guo
view all 3 authors...
Source
Source
#1Payam Ghassemi (UB: University at Buffalo)H-Index: 4
#2Souma Chowdhury (UB: University at Buffalo)H-Index: 20
Abstract null null This paper tackles a class of multi-robot task allocation (MRTA) problems called 鈥淪ingle-Task Robots and Single-Robot Tasks鈥 or SR-ST problems, subject to the following additional characteristics: tasks with deadlines, tasks that are generated during the mission, and robots with range and payload constraints (thus requiring multiple tours per robot). While these characteristics are typical of various disaster response and commercial applications, there is a lack of online MRTA...
Source
Source
#1Weiyao Meng (University of Nottingham)
#2Rong Qu (University of Nottingham)H-Index: 46
Abstract null null This paper proposes AutoGCOP, a new general framework for automated design of local search algorithms. In a recently established General Combinatorial Optimisation Problem (GCOP) model, the problem of algorithm design itself is defined as a combinatorial optimisation problem. AutoGCOP defines a general framework to optimise the composition of elementary algorithmic components as decision variables in GCOP. By modelling various well-known local search meta-heuristics within a g...
Source
#1Hani Shahmoradi-Moghadam (TUD: Dresden University of Technology)H-Index: 2
#2J枚rn Sch枚nberger (TUD: Dresden University of Technology)H-Index: 12
Abstract null null The mobile supply chain (MSC) is a new development that aims to help companies implement these ideas. In MSCs, production, distribution, and delivery of a product family is performed by a mobile factory (MF), which can be carried by truck and shared among different production sites. In this paper, a real-world application of mobile factories in the chemical industry is studied. Critical production assets (e.g. reactor) are carried by truck and can produce a product family loca...
Source
This website uses cookies.
We use cookies to improve your online experience. By continuing to use our website we assume you agree to the placement of these cookies.
To learn more, you can find in our Privacy Policy.