In this article, the real-time time-dependent vehicle routing problem with time windows is formulated as a series of mixed integer programming models that account for real-time and time-dependent travel times, as well as for real-time demands in a unified framework. …
The field of dynamic vehicle routing and scheduling is growing at a fast pace nowadays, due to many potential applications in courier services, emergency services, truckload and less-than-truckload trucking, and many others. In this paper, a dynamic vehicle routing and …
We study optimal routing policy problems in stochastic time-dependent networks, where link travel times are modeled as random variables with time-dependent distributions. These are fundamental network optimization problems for a wide variety of applications, such as transportation and telecommunication systems. …
In the standard version of the traveling salesman problem (TSP), we are given a set of customers located in and around a city and the distances between each pair of customers, and need to find the shortest tour that visits …
In this paper we present a formulation for the dynamic vehicle routing problem with time-dependent travel times. We also present a genetic algorithm to solve the problem. The problem is a pick-up or delivery vehicle routing problem with soft time …
This work addresses the problem of determining optimal routing decisions in signalized traffic networks, where arc travel times vary over time and are known only probabilistically (i.e. in stochastic, time-varying (STV) networks) and additional delay due to signal operations is …
Models and algorithms for vehicle routing are usually based on known constant travel times between all relevant locations, an assumption that is far from reality, particularly for urban areas. But the consideration of travel times that vary with the time …
With the increasing availability of real-time information and communication systems in logistics, the need for appropriate planning algorithms, which make use of this technology, arises. Customers in transport markets increasingly expect quicker and more flexible fulfillment of their orders, especially …
In this article, we propose a solution procedure for the Elementary Shortest Path Problem with Resource Constraints (ESPPRC). A relaxed version of this problem in which the path does not have to be elementary has been the backbone of a …
In this paper, we apply the stochastic dynamic programming to find the dynamic shortest path from the source node to the sink node in stochastic dynamic networks, in which the arc lengths are independent random variables with exponential distributions. In …