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

From MaRDI portal
Publication:1415519

DOI10.1023/A:1025605803490zbMath1043.90032MaRDI QIDQ1415519

Nicola Secomandi

Publication date: 4 December 2003

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




Related Items (17)

A solution method for a two-dispatch delivery problem with stochastic customersApproximate policy optimization and adaptive control in regression modelsPaired cooperative reoptimization strategy for the vehicle routing problem with stochastic demandsFaster rollout search for the vehicle routing problem with stochastic demands and restockingA multi-space sampling heuristic for the vehicle routing problem with stochastic demandsMinimum and worst-case performance ratios of rollout algorithmsAn integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickupA rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programsCyclic-order neighborhoods with application to the vehicle routing problem with stochastic demandTechnical Note—Worst-Case Benefit of Restocking for the Vehicle Routing Problem with Stochastic DemandsA customized genetic algorithm for bi-objective routing in a dynamic networkDynamic programming and suboptimal control: a survey from ADP to MPCA survey on metaheuristics for stochastic combinatorial optimizationAn approximate dynamic programming approach for the vehicle routing problem with stochastic demandsA branch-and-price algorithm for the capacitated arc routing problem with stochastic demandsA practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo samplingRollout-based routing strategies with embedded prediction: a fish trawling application




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