This paper presents an Imporved Variable Neighborhood Search (IVNS) algorithm to solve Multi Depot Heterogeneous Vehicle Routing Problem with Time Windows (MDHVRPTW). The initial solution is obtained by customer allocation and path planning based on a cost network. The hybrid operators of insert and exchange are used to achieve the shaking process and the later optimization process is presented...

BACKGROUND Risperidone long-acting injectable (RLAI), the first second-generation depot antipsychotic, has extensively been studied before introduction. Thereafter, questions about the type of patients actually treated with RLAI in daily practice remain to be answered for making valid antipsychotic treatment comparisons involving RLAI in observational studies. OBJECTIVE We aimed to determine ...

This paper describes a polynomial transformation for a class of unit-demand vehicle routing problems, named node-balanced routing problems (BRP), where the number of nodes on each route is restricted to be in an interval such that the workload across the routes is balanced. The transformation is general in that it can be applied to single or multiple depot, homogeneous or heterogeneous fleet BR...

In this work the development and implementation of a Decision Support System is described. It will assist in the route calculation process and in optimizing the filling of the trucks that have to transport a considerably number of vehicles from near of 8 origins to more than 3,000 possible destinations spread over Spain and Portugal, and some in France, Germany, etc. The problem can be classifi...

Given a fleet of vehicles assigned to a single depot, the vehicle routing problem with time windows (vrptw) consists of determining a set of feasible vehicle routes to deliver goods to a set of customers while minimizing, first, the number of vehicles used and, second, total distance traveled. A large number of heuristic approaches for the vrptw have been proposed in the literature. In this pap...

Improving outcomes in schizophrenia generally requires an improvement in medication adherence. One of the most effective interventions to improve adherence is the use of depot formulations of antipsychotic medications. A new depot aripiprazole formulation for the treatment of schizophrenia will be available soon. A review of all publically available information on depot aripiprazole as of Novem...

The multiple Traveling Salesman Problem (mTSP) is a complex combinatorial optimization problem, which is a generalization of the well-known Traveling Salesman Problem (TSP), where one or more salesmen can be used in the solution. The optimization task can be described as follows: given a fleet of vehicles, a common depot and several requests by the customers, find the set of routes with overall...

The purpose of this article is to propose a perturbation metaheuristic for the Vehicle Routing Problem with Private fleet and Common carrier (VRPPC). This problem consists of serving all customers such in a way that 1) each customer is served exactly once either by a private fleet vehicle or by a common carrier vehicle, 2) all routes associated with the private fleet start and end at the depot,...

In one-to-one Pickup and Delivery Problems (PDPs), the aim is to design a set of least cost vehicle routes starting and ending at a common depot in order to satisfy a set of pickup and delivery requests between location pairs, subject to side constraints. Each request originates at one location and is destined for one other location. These requests apply to the transportation of goods or people...

In this paper we consider a variant of the open vehicle routing problem in which vehicles depart from the depot, visit a set of customers and end their routes at special nodes called driver nodes. A driver node can be the home of the driver or a parking lot where the vehicle will stay overnight. The resulting problem is referred to as the open vehicle routing problem with driver nodes (OVRP-d)....