Parallelization strategies for rollout algorithms

Computational Optimization and Applications

Volumn 31, Issue 2, 2005, Pages 221-244

  Guerriero, F ^a   Mancini, M ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Parallel synchronous model; Rollout algorithms; Speculative approach; Speedup

Indexed keywords

COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; MATHEMATICAL MODELS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

PARALLEL SYNCHRONOUS MODEL; ROLLOUT ALGORITHMS; SPECULATIVE APPROACH; SPEEDUP;

ALGORITHMS;

EID: 21144455800     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10589-005-2181-1     Document Type: Article

References (18)

1. J.L. Bentley, "Experiments on traveling salesman heuristics," in Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms, Philadelphia, PA, SIAM, 1990.
2. D.P. Bertsekas and D.A. Castanon, "Rollout algorithms for stochastic scheduling problems," Journal of Heuristics, vol. 5, pp. 89-108, 1999.
3. D.P. Bertsekas, J.N. Tsitsiklis, and C. Wu, "Rollout algorithms for combinatorial optimization problems," Journal of Heuristics, vol. 3, pp. 245-262, 1997.
4. D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific: Belmont, MA, 1996.
5. F. Bock, "An algorithm for solving traveling-salesman and related network optimization problems," 1958.
6. M. Dorigo and L. Gambardella, "HAS-SOP: An hybrid ant system for the sequential ordering problem," Technical Report IDSIA/11-97, IDSIA, Lugano, Switzerland, 1997.
7. L.F. Escudero, "An inexact algorithm for the sequential ordering problem," European Journal of Operational Research, vol. 37, pp. 232-253, 1988.
8. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.
9. F. Guerriero, M. Mancini, and R. Musmanno, "New rollout algorithms for combinatorial optimization problems," Optimization Methods and Software, vol. 17, pp. 627-654, 2002.
10. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
11. E.L. Lawler, A.H. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, The Traveling Salesman Problem, John Wiley & Sons, Chichester, 1985.
12. R. Moll, A. Barto, T. Perkins, and R. Sutton, "Reinforcement and local search: A case study," UM-CS-1997-044, Computer Science, University of Massachusetts, Amherst, MA, 1997.
13. W.H. Press, S.A. Teukolsky, W.T. Velterling, and B.P. Flannery, "Numerical Recipes in C: The Art of Scientific Computing." 2nd edn. Cambridge University Press, 1992.
14. G. Reinelt, "A traveling salesman problem library," ORSA Journal on Computing, vol. 3, pp. 376-384, 1991.
15. N. Secomandi, "Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochaslic demands," PhD thesis, College of Business Administration, University of Houston, Houston, TX, 1998.
16. N. Secomandi, "A rollout algorithm for sequencing problems," Technical Report, Department of Decision and Information Sciences, College of Business Administration, University of Houston, Houston, TX, 1998.
17. N. Secomandi,"Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands," Computers and Operation Research, Special Issue on Neural Networks for Business Applications, vol. 27, pp. 1171-1200, 2000.
18. C. Wu, "The job shop scheduling problem," Technical report, L.I.D.S., May 1999.