This paper presents a hybrid evolution strategy (ES) for solving the open vehicle routing
problem (OVRP), which is a well-known combinatorial optimization problem that addresses …

Vehicle routing problem (VRP) is a well-known NP-hard combinational optimization
problem. In the literature, existing approaches can be generally classified into two …

In this paper, we propose a metaheuristic based on annealing-like restarts to diversify and
intensify local searches for solving the vehicle routing problem with time windows (VRPTW) …

Routing delivery vehicles to serve customers in dynamic and uncertain environments like
dense city centers is a challenging task that requires robustness and flexibility. Most existing …

We propose a three-step algorithmic framework for solving a new variant of the vehicle-
routing problem (VRP) called the vehicle-routing problem with intermediate replenishment …

Green vehicle routing problem (GVRP) aims to consider greenhouse gas emissions
reduction, while routing the vehicles. It can be either through adopting Alternative Fuel …

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 …

Routing problems are a class of combinatorial problems with many practical applications.
Recently, end-to-end deep learning methods have been proposed to learn approximate …

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 …

This paper presents a new unified modeling and heuristic solution framework for vehicle-
routing problems (VRPs) with complex side constraints. The work is focused on strong …