The Static and Stochastic Vehicle Routing Problem with Random Requests (SS-VRP-R) describes realistic operational contexts in which a fleet of vehicles has to serve customer requests appearing dynamically. Based on a probabilistic knowledge about the appearance of requests, the SS-VRP-R …
Stochastic shortest path (SSP) computations are often performed under very strict time constraints, so computational efficiency is critical. A major determinant for the CPU time is the number of scenarios used. We demonstrate that by carefully picking the right scenario …
A new mixed-integer nonlinear programming model is presented for the time-dependent vehicle routing problem with time windows and intelligent travel times. The aim is to minimize fixed and variable costs, with the assumption that the travel time between any two …
This paper addresses the transportation of valuable goods in which security carriers are interested to optimize the operating costs and the vehicle routes’ security. In real operations, route planning and scheduling are normally performed manually based on individual experience. Hereupon, …
In this study, we investigate a routing problem in urban transportation which considers time-dependent travel time, multiple trips per vehicle, and loading time at the depot simultaneously. Its objective is to minimize the total travel distance while satisfying the time …
In this paper, a new time-space network model is proposed for addressing the time-dependent rural postman problem (TDRPP) of a single vehicle. The proposed model follows the idea of arc-path alternation to form a feasible and complete route. Based on …
© 2021 Elsevier LtdReducing distribution costs is one of the effective ways for logistics enterprises to improve their core competitiveness. Aiming at the multi-depot vehicle routing problem under the time-varying road network, this paper proposes an integer programming model with …
© 2000-2011 IEEE.This paper presents an arc-routing problem with time-dependent penalty cost (ARPTPC), which arises from a practical application in garbage collection service. ARPTPC considers the minimization of service cost, traveling cost and penalty cost. While the first two parts …
Vehicle routing algorithms usually reformulate the road network into a complete graph in which each arc represents the shortest path between two locations. Studies on time-dependent routing followed this model and therefore defined the speed functions on the complete graph. …
© 2013 IEEE.Incorporating speed probability distribution to the computation of the route planning in car navigation systems guarantees more accurate and precise responses. In this paper, we propose a novel approach for selecting dynamically the number of samples used for …