A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants

R Elshaer, H Awad - Computers & Industrial Engineering, 2020‏ - Elsevier
Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published
between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics …

Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

CA Vega-Mejía, JR Montoya-Torres… - Annals of Operations …, 2019‏ - Springer
The current global interest in improving the use of ever-scarcer natural resources calls for
the re-alignment of supply chain operations to include not only economic factors, but …

The split delivery vehicle routing problem with three-dimensional loading constraints

A Bortfeldt, J Yi - European Journal of Operational Research, 2020‏ - Elsevier
Abstract The Split Delivery Vehicle Routing Problem with three-dimensional loading
constraints (3L-SDVRP) combines vehicle routing and three-dimensional loading with …

Constraint programming-based solution approaches for three-dimensional loading capacitated vehicle routing problems

M Küçük, ST Yildiz - Computers & Industrial Engineering, 2022‏ - Elsevier
This paper presents constraint programming-based solution approaches for the three-
dimensional loading capacitated vehicle routing problem (3l-CVRP) that consists of vehicle …

An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery

KM Ferreira, TA de Queiroz, FMB Toledo - Computers & Operations …, 2021‏ - Elsevier
This paper presents a study about the Capacitated Vehicle Routing Problem with Two-
Dimensional Loading Constraints (2L-CVRP) and its three variants: allowing split delivery …

Fast vehicle routing via knowledge transfer in a reproducing kernel Hilbert space

Y Huang, L Feng, M Li, Y Wang, Z Zhu… - IEEE Transactions on …, 2023‏ - ieeexplore.ieee.org
Vehicle routing problems (VRPs) are essential in logistics. In the literature, many exact and
heuristic optimization algorithms have been proposed to solve the VRPs. These traditional …

The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale

M Rajaei, G Moslehi, M Reisi-Nafchi - European Journal of Operational …, 2022‏ - Elsevier
This paper introduces a complex real-world problem on a large scale that combines the split
delivery heterogeneous vehicle routing problem with three-dimensional loading and …

A simulated annealing based heuristic for a location-routing problem with two-dimensional loading constraints

KM Ferreira, TA de Queiroz - Applied Soft Computing, 2022‏ - Elsevier
A hybrid heuristic is proposed to solve a location-routing problem with two-dimensional
loading constraints. This problem appears in military situations and natural disasters in such …

Network scheduling problem with cross-docking and loading constraints

PB Castellucci, AM Costa, F Toledo - Computers & Operations Research, 2021‏ - Elsevier
Cross-docking is a logistic strategy which can increase rates of consolidation, and reduce
distribution and storage costs and delivery times. The optimization literature on cross …

A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints

X Zhang, L Chen, M Gendreau, A Langevin - European Journal of …, 2022‏ - Elsevier
In this study, we develop a branch-and-cut algorithm for the vehicle routing problem with two-
dimensional loading constraints. A separation algorithm is proposed to simultaneously …