Analysis of a rollout approach to sequencing problems with stochastic routing applications

DOI10.1023/A:1025605803490zbMATH Open1043.90032MaRDI QIDQ1415519FDOQ1415519

Authors: Nicola Secomandi 

Publication date: 4 December 2003

Published in: Journal of Heuristics (Search for Journal in Brave)

Recommendations

• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Rollout algorithms for combinatorial optimization
• Rollout algorithms for stochastic scheduling problems
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits

zbMATH Keywords

stochastic shortest path problemsvehicle routing problem with stochastic demandsdynamic and stochastic sequencing problemsfilter and fan and sequential fan candidate list strategiesrollout algorithms and policiestraveling salesman problem with stochastic travel times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Traffic problems in operations research (90B20) Stochastic scheduling theory in operations research (90B36)

Cited In (21)

• Technical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic Demands
• Rollout-based routing strategies with embedded prediction: a fish trawling application
• Dynamic programming and suboptimal control: a survey from ADP to MPC
• A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
• Minimum and worst-case performance ratios of rollout algorithms
• Approximate policy optimization and adaptive control in regression models
• A customized genetic algorithm for bi-objective routing in a dynamic network
• Faster rollout search for the vehicle routing problem with stochastic demands and restocking
• Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
• A survey on metaheuristics for stochastic combinatorial optimization
• Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands
• An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
• New Rollout Algorithms for Combinatorial Optimization Problems
• A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands
• Rollout algorithms for stochastic scheduling problems
• Rollout algorithms for combinatorial optimization
• A solution method for a two-dispatch delivery problem with stochastic customers
• A multi-space sampling heuristic for the vehicle routing problem with stochastic demands

This page was built for publication: Analysis of a rollout approach to sequencing problems with stochastic routing applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1415519)