This paper addresses a new vehicle routing problem that simultaneously involves time windows, split collection and linear weightrelated cost, which is a generalization of the split delivery vehicle routing problem with time windows (SDVRPTW). This problem consists of determining least-cost vehicle routes to serve a set of customers while respecting the restrictions of vehicle capacity and time ...

Tracking multiple vehicles with multiple cameras is a challenging problem of great importance in tunnel surveillance. One of the main challenges is accurate vehicle matching across the cameras with non-overlapping fields of view. Since systems dedicated to this task can contain hundreds of cameras which observe dozens of vehicles each, for a real-time performance computational efficiency is ess...

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,...

This vehicle routing problem involves finding a set of trips, one for each vehicle and to pick up known quantities of perishable goods from a set of geographically dispersed suppliers to the cargo terminal of an international airport in south India. The pickup time is based on the deterministic departure time of the flights. The objective of this Vehicle routing problem with Pickup and Delivery...

The vehicle routing problem with time windows (VRPTW) is a representation of a wellknown transportation problem. It involves customers, depot, vehicles and constraints on delivery time (time windows) and capacity on vehicles. To minimize cost, the solution of a VRPTW problem must satisfy all the constraints while minimising the total distance for the lowest number of vehicles. Clearly an order ...

We consider the vehicle routing problem with stochastic demands (VRPSD) on tree structured networks with a single depot. The problem we are concerned with in this paper is to find a set of tours for the vehicle with minimum expected length. Every tour begins at the depot, visits a subset of customers and returns to the depot without violating the capacity constraint. Randomized approximation al...

This paper presents a reactive/local level of an Obstacle Avoidance System for an Autonomous Underwater Vehicle (AUV). The specific requirements of the underwater world, the computational capacity and the sensors of the vehicle as well as its manoeuvrability were considered by the choice and the development of strategies used. Such requirements include the sea current information, the considera...

Several recent studies have addressed the possible impact of using highly autonomous platforms to invert today’s multiple-operators-per-single-unmanned-vehicle control paradigm. These studies, however, have generally focused on homogeneous vehicle teams and have not addressed the potential effects of vehicle, capability, or mission type heterogeneity on operator control capacity. Important impl...

In the vehicle routing problem with time window (VRPTW), the objective is to minimize the number of vehicles and then minimize the total time travelled. Each route starts at the depot and ends at a customer, visiting a number of customers, each once, en route, without returning to the depot. The demand of each customer must be completely fulfilled by a single vehicle. The total demand serviced ...

Transportation in economic systems such as services, production and distribution enjoys a special and important position and provides a significant portion of the country's gross domestic product. Improvements in transportation system mean improvements in the traveling routes and the elimination of unnecessary distances in any system. The Vehicle Routing Problem (VRP) is one of the practical co...