The Dynamic Assignment Problem

Abstract

T here has been considerable recent interest in the dynamic vehicle routing problem, but the complexities of this problem class have generally restricted research to myopic models. In this paper, we address the simpler dynamic assignment problem, where a resource (container, vehicle, or driver) can serve only one task at a time. We propose a very general class of dynamic assignment models, and propose an adaptive, nonmyopic algorithm that involves iteratively solving sequences of assignment problems no larger than what would be required of a myopic model. We consider problems where the attribute space of future resources and tasks is small enough to be enumerated, and propose a hierarchical aggregation strategy for problems where the attribute spaces are too large to be enumerated. Finally, we use the formulation to also test the value of advance information, which offers a more realistic estimate over studies that use purely myopic models. The problem of dynamically assigning resources to tasks over time arises in a number of applications in transportation. In the field of freight transportation, truckload motor carriers, railroads, and shipping companies all have to manage fleets of containers (trucks, boxcars, and intermodal containers) that move one load at a time, with orders arriving continuously over time. In the passenger arena, taxi companies and companies that manage fleets of business jets have to assign vehicles (taxicabs or jets) to move customers from one location to the next. It is common to assume that the arrival of customer demands is random (e.g., known only through a probability distribution) over time, but it may also be the case that the vehicles become available in a random way. Finally, each assignment of a resource to a task generates a contribution to profits, which may also be random.We refer to the problem of dynamically assigning resources to tasks as a dynamic assignment problem. In general, it may be possible to assign a resource to a sequence of two or more tasks at the same time, but we focus on problems where we assign a resource to one task at a time. We assume that resources and tasks are each characterized by a set of possibly unique attributes, where the contribution generated by an assignment will depend on the attributes of the resource and task. Resources do not have to be used and tasks do not all have to be covered, although there can be a cost for holding either one.The dynamic assignment problem is a fundamental problem in routing and scheduling. It is a special case of the dynamic vehicle routing problem, without the complexities of in-vehicle consolidation. For this reason, it provides a natural framework for modeling the dynamic information processes and comparing myopic models with those that exploit distributional information about the future. It is common practice, for example, to model dynamic vehicle routing problems using myopic models, which ignore any forecasts of the future based on currently available data. These problems are themselves quite difficult be...

Multi-period stochastic optimization problems in transportation management

“…In [Spivey & Powell, 2004], for a maximization problem, the authors set to 100% the a-posteriori optimal value O * T in order to normalize their results. Therefore, all policies values are below 100% and accordingly their relative difference to this bound provide their deviations in percentage to this upper bound.…”

“…Competitive analysis and Approximation ratio cited in [Angelelli et al, 2007] 4. Percentage to the a-posteriori solution or bounds cited in [Spivey & Powell, 2004] 5. Mean and variance trade-offs cited in [List et al, 2003] 6.…”

The vehicle rescheduling problem: Model and algorithms

“…Recent surveys on dynamic VRP can be found in [19,20,28]. Tabu search [23], genetic algorithm [21], assignment, and insertion-based heuristics [17], approximate dynamic programming [31], and nearest-vehicle based heuristic [16] have been proposed to consider online requests and uncertain travel time in the dynamic VRP problem. Yang et al [34] have developed a general framework for the dynamic vehicle routing problem in which new requests can arrive during operations.…”

“…Since vehicle breakdowns have not been explicitly considered in train rescheduling [11,26], dynamic VSP [22], or dynamic VRP [16,17,21,23,31,34], most of results available are not directly applicable to our problem. Although aircraft breakdown is considered in some studies of airline operations recovery, most of the available algorithms [8,25,29,32] involve a small number of trips and aircrafts.…”

Tuning Approximate Dynamic Programming Policies for Ambulance Redeployment via Direct Search

“…For our application setting, the post-decision state variable does not necessarily change the number of dimensions of the state variable, but it allows us to bypass computing expectations when simulating the behavior of an approximate policy. [31,39,44] and [46] use the post-decision state variable in batch service, dynamic assignment, fleet management and inventory control problems.…”