01371502

Component

https://doi.org/10.3141/2283-13

http://scholar.google.com...ller&publication_year=2012

The problem presented in this paper was motivated by the need for a solution to be used in a search-and-rescue application and is formulated as a dynamic traveling salesman problem in a stochastic-state network setting. This problem formulation features a full-recourse decision framework and stochastic demands that are revealed only through direct observation. This problem is defined in a stochastic-state network setting, which allows the modeling of implicitly correlated demand stochasticity. The problem is then formulated as a Markovian decision process, and, finally, a heuristic solution is provided. The heuristic solution is based on a two-stage stochastic program with recourse solved on a set of aggregated networks generated by the use of an aggregating function. Subsets of the feasible solutions obtained at each stage are fixed, and the heuristic is used iteratively to further refine the routing policy.

01450929

12-2142

English

pp 122–130

2012

Transportation Research Record: Journal of the Transportation Research Board

9780309223232

Print

References; Tables

Heuristic methods; Markov processes; Networks; Routing; Search and rescue operations; Stochastic processes; Traveling salesman problem

Highways; Planning and Forecasting; Security and Emergencies; I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Feb 8 2012 5:08PM

• Algorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
• Application of Principal Component Analysis to Predict Dynamic Origin–Destination Matrices
• Case Study–Based Evaluation of Stochastic Multicommodity Emergency Inventory Management Model
• Demand and Supply Calibration of Dynamic Traffic Assignment Models: Past Efforts and Future Challenges
• Distance-Based Dynamic Pricing Strategy for Managed Toll Lanes
• Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
• Heuristic Scheme for Heterogeneous Vehicle Routing Problem on Trees Based on Generalized Assignment and Bin-Packing Upper Bounds
• Model for Optimization of Locations of Schools and Student Transportation in Rural Areas
• Model to Locate Sensors for Estimation of Static Origin–Destination Volumes Given Prior Flow Information
• Path-Constrained Traffic Assignment: Model and Algorithm
• Stochastic Model for Estimation of Time-Varying Arterial Travel Time and Its Variability with Only Link Detector Data
• Update Strategies for Restricted Master Problems for User Equilibrium Traffic Assignment Problem: Computational Study
• Welfare Effects of Congestion Pricing and Transit Services in Multiclass Multimodal Networks