Parallelization strategies for rollout algorithms

DOI10.1007/s10589-005-2181-1zbMath1122.90430OpenAlexW1999649063WikidataQ58921665 ScholiaQ58921665MaRDI QIDQ812417

N. E. Zubov

Publication date: 23 January 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-005-2181-1

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Faster rollout search for the vehicle routing problem with stochastic demands and restocking, Minimum and worst-case performance ratios of rollout algorithms, A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs, Patient scheduling in hemodialysis service, A rollout algorithm for the resource constrained elementary shortest path problem, Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints

Uses Software

• TSPLIB
• Tabu search
• HAS-SOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• An inexact algorithm for the sequential ordering problem
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Rollout algorithms for stochastic scheduling problems
• Rollout algorithms for combinatorial optimization
• TSPLIB—A Traveling Salesman Problem Library
• New Rollout Algorithms for Combinatorial Optimization Problems