New rollout algorithms for combinatorial optimization problems

Optimization Methods and Software

Volumn 17, Issue 4, 2002, Pages 627-654

  Guerriero, F ^a   Mancini, M ^a   Musmanno, R ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Combinatorial optimization problems; Construction heuristics; Local search methods; Neuro dynamic programming; Rollout algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMBINATORIAL MATHEMATICS; HEURISTIC METHODS; NEURAL NETWORKS; OPTIMIZATION; RANDOM PROCESSES;

NEURO-DYNAMIC PROGRAMMING; ROLLOUT ALGORITHMS;

PROBLEM SOLVING;

EID: 0036703496     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/1055678021000049354     Document Type: Article

References (20)

1. J. Adams, E. Balas and D. Zawack (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391-401.
2. R.S. Barr, B.L. Golden, J.P. Kelly, M.G.C. Resende and W.R. Stewart (1995). Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics, 1(1), 9-32.
3. D.P. Bertsekas and D.A. Castanon (1999). Rollout algorithms for stochastic scheduling problems. Journal of Heuristics, 5, 89-108.
4. D.P. Bertsekas, J.N. Tsitsiklis and C. Wu (1997). Rollout algorithms for combinatorial optimization problems. Journal of Heuristics, 3, 245-262.
5. D.P. Bertsekas and J.N. Tsitsiklis (1996). Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
6. J.A. Boyan (1992). Modular neural networks for learning context-dependent game strategies. Master's Thesis, Department of Engineering and Computer Laboratory, University of Cambridge, Cambridge, UK.
7. J.A. Boyan (1998). Learning evaluation functions for global optimization. PhD Thesis, School of Computer Science, Carnegie Mellon University, Pittsburg, PA.
8. R. Crites and A. Barto (1996). Improving elevator performance using reinforcement learning. In: D. Touretzky, M. Mozer and M. Hasselmo (Eds.), Advances in Neural Information Processing Systems, 8, MIT Press, Cambridge, MA, USA.
9. M.L. Fredman, D.S. Johnson, L.A. McGeoch and G. Ostheimer (1995). Data structures for traveling salesmen. Journal of Algorithms, 18, 432-479.
10. R. Jonker and T. Volgenant (1987). A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38, 325-340.
11. R. Moll, A. Barto, T. Perkins and R. Sutton (1997). Reinforcement and local search: a case study UM-CS-1997-044. Computer Science, University of Massachusetts, Amherst, MA.
12. W.H. Press, S.A. Teukolsky, W.T. Vetterling and B.P. Flannery (1992). Numerical Recipes in C: The Art of Scientific Computing, 2nd Edn. Cambridge University Press, Cambridge, UK.
13. G. Reinelt (1991). A traveling salesman problem library. ORSA Journal on Computing, 3, 376-384.
14. N. Secomandi (1998). Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. PhD Thesis, College of Business Administration, University of Houston, Houston, TX.
15. N. Secomandi (1998). A rollout algorithm for sequencing problems. Technical Report, Department of Decision and Information Sciences, College of Business Administration, University of Houston, Houston, TX.
16. N. Secomandi. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Computer and Operation Research, 27, 1201-1225.
17. S.R. Sutton and A.G. Barto (1989). Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
18. G. Tesauro (1994). TD-Gammon, a self-teaching backgammon program, achieves master-level play. Neural Computation, 6(2), 215-219.
19. C. Wu (May 1999). The job shop scheduling problem. Technical Report, L.I.D.S., MIT, Boston, USA.
20. W. Zhang and T.G. Dietterich (1995). A reinforcement learning approach to job-shop scheduling. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 1114-1120, Montreal, Quebec, Canada.