The problem studied in this paper is the multi-depot open vehicle routing problem, which
has the following two differences in relation to the classical vehicle routing problem: there …

In the open vehicle routing problem (OVRP), a vehicle does not return to the depot after
servicing the last customer on a route. The description of this variant of the standard vehicle …

Simulated annealing (SA) algorithm is a popular intelligent optimization algorithm which has
been successfully applied in many fields. Parameters' setting is a key factor for its …

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 …

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 …

In open vehicle routing problems, the vehicles are not required to return to the depot after
completing service. In this paper, we present the first exact optimization algorithm for the …

The problem studied in this paper is the open vehicle routing problem with time windows.
This problem is different from the better known vehicle routing problem with time windows …

In this paper, an exact solution approach is described for solving a real-life school bus
routing problem (SBRP) for transporting the students of an elementary school throughout …

According to the open vehicle routing problem (OVRP), a vehicle is not required to return to
the distribution depot after servicing the last customer on its route. In this paper, the open …

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 …