Rollout algorithms for combinatorial optimization
From MaRDI portal
Publication:2567853
DOI10.1023/A:1009635226865zbMath1071.90571OpenAlexW1514588745MaRDI QIDQ2567853
John N. Tsitsiklis, Dimitri P. Bertsekas, Cynara Wu
Publication date: 13 October 2005
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009635226865
Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Dynamic programming (90C39)
Related Items
Conservative allocation models for outbound containers in container terminals ⋮ Classification of applied methods of combinatorial optimization ⋮ ExpertRNA: A New Framework for RNA Secondary Structure Prediction ⋮ Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming ⋮ Approximate policy optimization and adaptive control in regression models ⋮ Benders Decomposition for Production Routing Under Demand Uncertainty ⋮ Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands ⋮ Optimal allocation of heterogeneous resources in cooperative control scenarios ⋮ Robust flows with losses and improvability in evacuation planning ⋮ Rollout approach to sensor scheduling for remote state estimation under integrity attack ⋮ A 2-OPT procedure to reduce total inspection time in a serial inspection process ⋮ Dimension reduction based adaptive dynamic programming for optimal control of discrete-time nonlinear control-affine systems ⋮ Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach ⋮ Novel models and algorithms for location assignment for outbound containers in container terminals ⋮ Minimum and worst-case performance ratios of rollout algorithms ⋮ A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs ⋮ Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks ⋮ Patient scheduling in hemodialysis service ⋮ Managing mobile production-inventory systems influenced by a modulation process ⋮ Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems ⋮ An approximate dynamic programming approach to project scheduling with uncertain resource availabilities ⋮ Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem ⋮ A two-phase heuristic algorithm for cell formation problems considering alternative part routes and machine sequences ⋮ A rollout algorithm for the resource constrained elementary shortest path problem ⋮ Merchant Commodity Storage Practice Revisited ⋮ Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints ⋮ Dynamic programming and suboptimal control: a survey from ADP to MPC ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ New Rollout Algorithms for Combinatorial Optimization Problems ⋮ Scheduling trains as a blocking parallel-machine job shop scheduling problem ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ An approximate dynamic programming approach for the vehicle routing problem with stochastic demands ⋮ Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands ⋮ From reinforcement learning to optimal control: a unified framework for sequential decisions ⋮ Average-case performance of rollout algorithms for knapsack problems ⋮ Parallelization strategies for rollout algorithms ⋮ Looking ahead with the pilot method
This page was built for publication: Rollout algorithms for combinatorial optimization
