An Adaptive Dynamic Programming Algorithm for Dynamic Fleet Management, I: Single Period Travel Times

Authors:
Gregory A. Godfrey;Warren B. Powell
Affiliations:
-;-
Venue:
Transportation Science
Year:
2002

Citing 0
Cited 24

The optimizing-simulator: merging simulation and optimization using approximate dynamic programming

WSC '05 Proceedings of the 37th conference on Winter simulation
Stochastic programming and scenario generation within a simulation framework: An information systems perspective

Decision Support Systems
Bias and Variance Approximation in Value Function Estimates

Management Science
The Dynamic Assignment Problem

Transportation Science
Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows

Transportation Science
A dynamic driver management scheme for less-than-truckload carriers

Computers and Operations Research
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering

Computers and Operations Research
An Optimal Approximate Dynamic Programming Algorithm for the Lagged Asset Acquisition Problem

Mathematics of Operations Research
Robust Optimization for Empty Repositioning Problems

Operations Research
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem

Transportation Science
The optimizing-simulator: An illustration using the military airlift problem

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Integrated system for smart transport services

ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Approximate Dynamic Programming Captures Fleet Operations for Schneider National

Interfaces
An improved LNS algorithm for real-time vehicle routing problem with time windows

Computers and Operations Research
Network Cargo Capacity Management

Operations Research
The Effect of Robust Decisions on the Cost of Uncertainty in Military Airlift Operations

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Lagrangian relaxation and constraint generation for allocation and advanced scheduling

Computers and Operations Research
Using low-dimensional patterns in optimizing simulators: An illustration for the military airlift problem

Mathematical and Computer Modelling: An International Journal
An algorithm for approximating piecewise linear concave functions from sample gradients

Operations Research Letters
An event-driven optimization framework for dynamic vehicle routing

Decision Support Systems
SMART: A Stochastic Multiscale Model for the Analysis of Energy Resources, Technology, and Policy

INFORMS Journal on Computing
A Lagrangian approach to dynamic resource allocation

Proceedings of the Winter Simulation Conference
Sourcing strategies in supply risk management: An approximate dynamic programming approach

Computers and Operations Research
A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a stochastic version of a dynamic resource allocation problem. In this setting, reusable resources must be assigned to tasks that arise randomly over time. We solve the problem using an adaptive dynamic programming algorithm that usesnonlinear functional approximations that give the value of resources in the future. Our functional approximations are piecewise linear and naturally provide integer solutions. We show that the approximations provide near-optimal solutions to deterministic problems and solutions that significantly outperform deterministic rolling-horizon methods on stochastic problems.