New Rollout Algorithms for Combinatorial Optimization Problems

DOI10.1080/1055678021000049354zbMath1065.90080OpenAlexW2080797014WikidataQ58921746 ScholiaQ58921746MaRDI QIDQ4709749

No author found.

Publication date: 1 October 2003

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/1055678021000049354

zbMATH Keywords

combinatorial optimization problemsRollout algorithms, Neuro-dynamic Programming, Local Search Methods, Construction Heuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Faster rollout search for the vehicle routing problem with stochastic demands and restocking ⋮ 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 ⋮ Hybrid rollout approaches for the job shop scheduling problem ⋮ Parallelization strategies for rollout algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
• Rollout algorithms for stochastic scheduling problems
• Designing and reporting on computational experiments with heuristic methods
• Rollout algorithms for combinatorial optimization
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• TSPLIB—A Traveling Salesman Problem Library
• Data Structures for Traveling Salesmen

This page was built for publication: New Rollout Algorithms for Combinatorial Optimization Problems