Skip to main content
SpringerLink
Log in

Parallelization Strategies for Rollout Algorithms

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

Rollout algorithms are innovative methods, recently proposed by Bertsekas et al. [3], for solving NP-hard combinatorial optimization problems. The main advantage of these approaches is related to their capability of magnifying the effectiveness of any given heuristic algorithm. However, one of the main limitations of rollout algorithms in solving large-scale problems is represented by their computational complexity. Innovative versions of rollout algorithms, aimed at reducing the computational complexity in sequential environments, have been proposed in our previous work [9]. In this paper, we show that a further reduction can be accomplished by using parallel technologies. Indeed, rollout algorithms have very appealing characteristics that make them suitable for efficient and effective implementations in parallel environments, thus extending their range of relevant practical applications.

We propose two strategies for parallelizing rollout algorithms and we analyze their performance by considering a shared-memory paradigm. The computational experiments have been carried out on a SGI Origin 2000 with 8 processors, by considering two classical combinatorial optimization problems. The numerical results show that a good reduction of the execution time can be obtained by exploiting parallel computing systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  4. D.P. Bertsekas and J.N. Tsitsiklis, Neuro-Dynamic Programming, Athena Scientific: Belmont, MA, 1996.

    Google Scholar 

  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.

    Article  Google Scholar 

  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.

    Article  Google Scholar 

  10. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  13. W.H. Press, S.A. Teukolsky, W.T. Vetterling, 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.

    Google Scholar 

  15. N. Secomandi, “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, 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.

    Google Scholar 

  18. C. Wu, “The job shop scheduling problem,” Technical report, L.I.D.S., May 1999.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Rende, Italy

    F. Guerriero & M. Mancini

Authors
  1. F. Guerriero
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Mancini
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Guerriero.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guerriero, F., Mancini, M. Parallelization Strategies for Rollout Algorithms. Comput Optim Applic 31, 221–244 (2005). https://doi.org/10.1007/s10589-005-2181-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-005-2181-1

Search

Navigation