In practice, apart from the problem of vehicle routing, schedulers also face the problem of finding feasible driver schedules complying with complex restrictions on drivers’ driving and working hours. To address this complex interdependent problem of vehicle routing and break scheduling, we propose a dynamic programming approach for the vehicle routing problem with time windows including the EC...

The multiple trip vehicle routing problem involves several sequences of routes. Working shift of single vehicle can be scheduled in multiple trips. It is suitable for urban areas where the vehicle has very limited size and capacity over short travel distances. The size and capacity limit also requires the vehicle should be vacated frequently. As a result, the vehicle could be used in different ...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

The NP-hard problem of vehicle routing and scheduling problem with fuzzy time windows and fuzzy goal is formulated and two heuristic algorithms for solving this problem are presented.

today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

Many types of transportation systems, for example, public transit and commercial freight hauling and package delivery, may be categorized as being fleet operations. The environmental impacts of fleet operations such as these are affected by factors including the initial choice and selection of vehicles (types) comprising the fleet, vehicle age and maintenance, and the modal conditions under whi...

Vehicle Routing Problem (VRP) is a key element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. This is a combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve a set of customers It is required that these vehicles return to the depot after s erving customers’ d...

Assigning and scheduling vehicle routes in a dynamic environment is a crucial management problem. Despite numerous publications dealing with efficient scheduling methods for vehicle routing, very few addressed the inherent stochastic and dynamic nature of travel times. In this paper, a vehicle routing problem with time-dependent travel times due to potential traffic congestion is considered. Th...

We propose local search algorithms for the vehicle routing problem with soft time window constraints. The time window constraint for each customer is treated as a penalty function, which is very general in the sense that it can be non-convex and discontinuous as long as it is piecewise linear. In our algorithm, we use local search to assign customers to vehicles and to find orders of customers ...