New Rollout Algorithms for Combinatorial Optimization Problems

DOI10.1080/1055678021000049354MaRDI QIDQ4709749zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1 October 2003

Published in Optimization Methods \& 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

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

Recommendations

• Rollout algorithms for combinatorial optimization
• Parallelization strategies for rollout algorithms
• Analysis of a rollout approach to sequencing problems with stochastic routing applications
• Minimum and worst-case performance ratios of rollout algorithms
• Average-case performance of rollout algorithms for knapsack problems

Cites work

• 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
• Data Structures for Traveling Salesmen
• Designing and reporting on computational experiments with heuristic methods
• scientific article; zbMATH DE number 1321699 (Why is no real title available?)
• scientific article; zbMATH DE number 236854 (Why is no real title available?)
• Rollout algorithms for combinatorial optimization
• Rollout algorithms for stochastic scheduling problems
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• TSPLIB—A Traveling Salesman Problem Library

Cited in

(10)

• Hybrid rollout approaches for the job shop scheduling problem
• 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
• Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints
• Rollout algorithms for combinatorial optimization
• Minimum and worst-case performance ratios of rollout algorithms
• A rollout algorithm for the resource constrained elementary shortest path problem
• Optimal algorithm re-initialization for combinatorial optimization
• Parallelization strategies for rollout algorithms

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

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