This paper presents a biased random-key genetic algorithm designed to solve the open
vehicle routing problem with capacity and distance constraints. Consider a depot from which …

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 …

The open vehicle routing problem (OVRP) has a wide range of applications in the field of
logistics distribution. A model of OVRP with soft time windows and satisfaction rate is …

In the open vehicle routing problem (OVRP), the objective is to minimise the number of
vehicles and then minimise the total distance (or time) travelled. Each route starts at the …

The open vehicle routing problem (OVRP) differs from the classic vehicle routing problem
(VRP) because the vehicles either are not required to return to the depot, or they have to …

The problem studied in this paper is different from the basic vehicle routing problem in that
the vehicles do not return to the distribution depot after delivering the goods to the customers …

We address the Open Vehicle Routing Problem (OVRP), a variant of the
“classical”(capacitated and distance constrained) Vehicle Routing Problem (VRP) in which …

In this paper, another version of the vehicle routing problem (VRP)—the open vehicle
routing problem (OVRP) is studied, in which the vehicles are not required to return to the …

This paper presents a real-value version of particle swarm optimization (PSO) for solving the
open vehicle routing problem (OVRP) that is a well-known combinatorial optimization …

The vehicle routing problem with simultaneous pick-up and deliveries, which considers
simultaneous distribution and collection of goods to/from customers, is an extension of the …