A concise guide to existing and emerging vehicle routing problem variants
Vehicle routing problems have been the focus of extensive research over the past sixty
years, driven by their economic importance and their theoretical interest. The diversity of …
years, driven by their economic importance and their theoretical interest. The diversity of …
Explicit evolutionary multitasking for combinatorial optimization: A case study on capacitated vehicle routing problem
Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary
computation as a new search paradigm, for solving multiple optimization tasks …
computation as a new search paradigm, for solving multiple optimization tasks …
Double-assistant evolutionary multitasking algorithm for enhanced electric vehicle routing with backup batteries and battery swapping stations
Y Cai, Y Wu, C Fang - Expert Systems with Applications, 2024 - Elsevier
This study addresses the challenges of the electric vehicle routing problem with time
windows, backup batteries, and battery swapping stations (EVRPTW-BB-BSS), reflecting …
windows, backup batteries, and battery swapping stations (EVRPTW-BB-BSS), reflecting …
A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle …
This paper develops a hybrid matheuristic in two stages to solve Capacitated Vehicle
Routing Problem (CVRP) by applying Greedy Randomized Adaptive Search Procedure …
Routing Problem (CVRP) by applying Greedy Randomized Adaptive Search Procedure …
[HTML][HTML] Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows
Delivery options are at the heart of the generalized vehicle routing problem with time
windows (GVRPTW) allowing that customer requests are shipped to alternative delivery …
windows (GVRPTW) allowing that customer requests are shipped to alternative delivery …
Multitasking evolutionary algorithm based on adaptive seed transfer for combinatorial problem
H Lv, R Liu - Applied Soft Computing, 2023 - Elsevier
Evolutionary computing (EC) is widely used in dealing with combinatorial optimization
problems (COP). Traditional EC methods can only solve a single task in a single run, while …
problems (COP). Traditional EC methods can only solve a single task in a single run, while …
[HTML][HTML] Optimization of heterogeneous vehicle logistics scheduling with multi-objectives and multi-centers
Z He, M Zhang, Q Chen, S Chen, N Pan - Scientific Reports, 2023 - nature.com
Industrial enterprises have high requirements on timeliness and cost when delivering
industrial products to their customers. For this reason, this paper studies the vehicle routing …
industrial products to their customers. For this reason, this paper studies the vehicle routing …
[HTML][HTML] A simple and effective hybrid genetic search for the job sequencing and tool switching problem
The job Sequencing and tool Switching Problem (SSP) has been extensively studied in the
field of operations research, due to its practical relevance and methodological interest …
field of operations research, due to its practical relevance and methodological interest …
[HTML][HTML] A multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints
This work presents a multistart algorithm for solving the capacitated vehicle routing problem
with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research …
with 2D loading constraints (2L-CVRP) allowing for the rotation of goods. Research …
Arc routing with time-dependent travel times and paths
Vehicle routing algorithms usually reformulate the road network into a complete graph in
which each arc represents the shortest path between two locations. Studies on time …
which each arc represents the shortest path between two locations. Studies on time …