Neural large neighborhood search for the capacitated vehicle routing problem
Learning how to automatically solve optimization problems has the potential to provide the
next big leap in optimization technology. The performance of automatically learned …
next big leap in optimization technology. The performance of automatically learned …
A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
VR Máximo, MCV Nascimento - European Journal of Operational Research, 2021 - Elsevier
Metaheuristics are widely employed to solve hard optimization problems, like vehicle routing
problems (VRP), for which exact solution methods are impractical. In particular, local search …
problems (VRP), for which exact solution methods are impractical. In particular, local search …
Learning to delegate for large-scale vehicle routing
Vehicle routing problems (VRPs) form a class of combinatorial problems with wide practical
applications. While previous heuristic or learning-based works achieve decent solutions on …
applications. While previous heuristic or learning-based works achieve decent solutions on …
A hybrid of deep reinforcement learning and local search for the vehicle routing problems
Different variants of the Vehicle Routing Problem (VRP) have been studied for decades.
State-of-the-art methods based on local search have been developed for VRPs, while still …
State-of-the-art methods based on local search have been developed for VRPs, while still …
A reinforcement learning-variable neighborhood search method for the capacitated vehicle routing problem
Finding the best sequence of local search operators that yields the optimal performance of
Variable Neighborhood Search (VNS) is an important open research question in the field of …
Variable Neighborhood Search (VNS) is an important open research question in the field of …
Constrained clustering for the capacitated vehicle routing problem (cc-cvrp)
ABSTRACT eCommerce, postal and logistics' planners require to solve large-scale
capacitated vehicle routing problems (CVRPs) on a daily basis. CVRP problems are NP …
capacitated vehicle routing problems (CVRPs) on a daily basis. CVRP problems are NP …
Hybrid genetic search for the CVRP: Open-source implementation and SWAP* neighborhood
T Vidal - Computers & Operations Research, 2022 - Elsevier
The vehicle routing problem is one of the most studied combinatorial optimization topics,
due to its practical importance and methodological interest. Yet, despite extensive …
due to its practical importance and methodological interest. Yet, despite extensive …
Towards faster vehicle routing by transferring knowledge from customer representation
The Vehicle Routing Problem (VRP) is a well-known NP-hard combinatorial optimization
problem, which has wide spread applications in real world, such as logistics, bus route …
problem, which has wide spread applications in real world, such as logistics, bus route …
Learning to solve vehicle routing problems: A survey
This paper provides a systematic overview of machine learning methods applied to solve NP-
hard Vehicle Routing Problems (VRPs). Recently, there has been a great interest from both …
hard Vehicle Routing Problems (VRPs). Recently, there has been a great interest from both …
A robust algorithm based on differential evolution with local search for the capacitated vehicle routing problem
IP Souza, MCS Boeres, REN Moraes - Swarm and Evolutionary …, 2023 - Elsevier
Abstract The Capacitated Vehicle Routing Problem is a well-known combinatorial problem.
In this paper, we propose a hybrid algorithm based on a discrete adaptation of the …
In this paper, we propose a hybrid algorithm based on a discrete adaptation of the …