A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers

@article{Powell1996ASF,
  title={A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers},
  author={Warrren B Powell},
  journal={Transp. Sci.},
  year={1996},
  volume={30},
  pages={195-219}
}
The dynamic assignment problem arises in a number of application areas in transportation and logistics. Taxi drivers have to be assigned to pick up passengers, police have to be assigned to emergencies, and truck drivers have to pick up and carry loads of freight. All of these problems are characterized by demands that arrive continuously and randomly throughout the day, and require a dispatcher to assign a driver to handle a specific demand. We use as our motivating application the load… 

Figures and Tables from this paper

A NOVEL APPROACH TO ROUTING AND DISPATCHING TRUCKS BASED ON PARTIAL INFORMATION IN A DYNAMIC ENVIRONMENT
Congestion affects the trucking industry on three major service dimensions: travel time, reliability and cost. Most of the developed techniques and models for planning, routing and scheduling in the
Multi-period vehicle assignment with stochastic load availability
We investigate the following problem, which is faced by major forwarding companies active in road transportation (see [2]). A company owning a limited eet of vehicles wants to maximize its
Assignment Models for Local Truckload Trucking Problems with Stochastic Service Times and Time Window Constraints
Local truckload trucking plays a major role in the freight transportation industry. In operations in which travel times, loading and unloading times, and waiting times at intermodal and customer
An Analysis of \a Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers"
TLDR
A dynamic programming interpretation of the transportation optimization problem and hybrid network model approach and how the solution of the approach can be viewed as an approximation of a particular upper bound on the cost-to-go function in the corresponding dynamic programming formulation is provided.
VEHICLE ROUTING AND SCHEDULING FOR TRUNK HAULAGE.
TLDR
A new heuristic algorithm for a basic problem for less-than-truckload carriers is presented, various problem settings encountered in practice are analyzed, and computational tests with real-life data are reported on.
Heterogeneous truck routing policies with tour routing time restriction
TLDR
Study of a heterogeneous full-truckload vehicle routing problem based on the case of a trucking company in Malaysia shows that all four policies do better than the companyAEs original assignment in terms of deadhead costs and truck utilization.
Mixed Global and Local Assignment Algorithms for Quasi-Dynamic Local Truckload Trucking Operations with Strict Time Windows
Examined are the trade-offs associated with local and global, but myopic, assignment heuristics for local truckload trucking operations such as those associated with drayage operations near
Real-time Multi-period truckload routing problems
In this thesis we consider a multi-period truckload pick-up and delivery problem dealing with real-time requests over a finite time horizon. We introduce the notion of postponement of requests,
...
...

References

SHOWING 1-10 OF 47 REFERENCES
A COMPARATIVE REVIEW OF ALTERNATIVE ALGORITHMS FOR THE DYNAMIC VEHICLE ALLOCATION PROBLEM
The dynamic vehicle allocation problem involves managing a generally large fleet of vehicles over time to maximize total profits. The problem is reviewed in the context of truckload trucking with
A Stochastic Model of the Dynamic Vehicle Allocation Problem
TLDR
The stochastic vehicle allocation problem addresses the movement of vehicles between locations over a given planning horizon with a very simple constraint structure which lends itself readily to the Frank-Wolfe algorithm.
Dynamic and Stochastic Models for the Allocation of Empty Containers
TLDR
This work describes the empty container allocation problem, and introduces two dynamic deterministic formulations for the single and multicommodity cases, which offer a general modeling framework for this class of problems.
Maximizing Profits for North American Van Lines' Truckload Division: A New Framework for Pricing and Operations
The Commercial Transport Division of North American Van Lines dispatches thousands of trucks from customer origin to customer destination each week under high levels of demand uncertainty. Working
Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
TLDR
This paper analyzes the problem of m identical vehicles with unlimited capacity and shows that in heavy traffic the system time is reduced by a factor of 1/m2 over the single-server case and considers the case in which each vehicle can serve at most q customers before returning to a depot.
Improving the Distribution of Industrial Gases with an On-Line Computerized Routing and Scheduling Optimizer
TLDR
For Air Products and Chemicals, Inc., inventory management of industrial gases at customer locations is integrated with vehicle scheduling and dispatching, and the system has been saving between 6% to 10% of operating costs.
Real-Time Dispatch of Petroleum Tank Trucks
A highly automated, real-time dispatch system is described which uses embedded optimization routines to replace extensive manual operations and to reduce substantially operating costs for a
A STOCHASTIC, DYNAMIC NETWORK MODEL FOR RAILROAD CAR DISTRIBUTION
Freight cars represent a substantial portion of total railroad investment, and the low utilization of this major capital resource is certainly a contributing factor in the poor financial health of
Stochastic Inventory Routing: Route Design with Stockouts and Route Failures
TLDR
A number of solution procedures are compared on a large set of real life data and the winning strategy provides the best system performance and reduces (almost eliminates) the stockout phenomena.
The dynamic traveling repairman problem
TLDR
This work proposes and analyzes a generic mathematical model for dynamic vehicle routing problems, which is motivated by applications in which the objective is minimizing the wait for service in a stochastic and dynamically changing environment, and proposes several policies for the DTRP that have system times within a constant factor of the optimal policy in heavy traffic.
...
...