GPU-Based Approaches for Multiobjective Local Search Algorithms. A Case Study: The Flowshop Scheduling Problem

  • Thé Van Luong
  • Nouredine Melab
  • El-Ghazali Talbi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6622)


Multiobjective local search algorithms are efficient methods to solve complex problems in science and industry. Even if these heuristics allow to significantly reduce the computational time of the solution search space exploration, this latter cost remains exorbitant when very large problem instances are to be solved. As a result, the use of graphics processing units (GPU) has been recently revealed as an efficient way to accelerate the search process. This paper presents a new methodology to design and implement efficiently GPU-based multiobjective local search algorithms. The experimental results show that the approach is promising especially for large problem instances.


Graphic Process Unit Global Memory Memory Management Thread Block Flowshop Schedule Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ryoo, S., Rodrigues, C.I., Stone, S.S., Stratton, J.A., Ueng, S.Z., Baghsorkhi, S.S., Hwu, W.-m.W.: Program optimization carving for gpu computing. J. Parallel Distribributed Computing 68(10), 1389–1401 (2008)CrossRefGoogle Scholar
  2. 2.
    Li, J.M., Wang, X.J., He, R.S., Chi, Z.X.: An efficient fine-grained parallel genetic algorithm based on gpu-accelerated. In: IFIP International Conference on Network and Parallel Computing Workshops, NPC Workshops, pp. 855–862 (2007)Google Scholar
  3. 3.
    Chitty, D.M.: A data parallel approach to genetic programming using programmable graphics hardware. In: GECCO, pp. 1566–1573 (2007)Google Scholar
  4. 4.
    Wong, T.T., Wong, M.L.: Parallel evolutionary algorithms on consumer-level graphics processing unit. In: Parallel Evolutionary Computations, pp. 133–155 (2006)Google Scholar
  5. 5.
    Fok, K.L., Wong, T.T., Wong, M.L.: Evolutionary computing on consumer graphics hardware. IEEE Intelligent Systems 22(2), 69–78 (2007)CrossRefGoogle Scholar
  6. 6.
    Taillard, E.: Benchmarks for basic scheduling problems (1989)Google Scholar
  7. 7.
    Talbi, E.G.: Metaheuristics: From design to implementation. Wiley, Chichester (2009)CrossRefzbMATHGoogle Scholar
  8. 8.
    Paquete, L.: Stochastic Local Search Algorithms for Multiobjective Combinatorial Optimization: Methods and Analysis. IOS Press, Amsterdam (2006)zbMATHGoogle Scholar
  9. 9.
    Alba, E., Talbi, E.G., Luque, G., Melab, N.: 4. Metaheuristics and Parallelism. Wiley Series on Parallel and Distributed Computing. In: Parallel Metaheuristics: A New Class of Algorithms, pp. 79–104. Wiley, Chichester (2005)CrossRefGoogle Scholar
  10. 10.
    Melab, N., Cahon, S., Talbi, E.G.: Grid computing for parallel bioinspired algorithms. J. Parallel Distributed Computing 66(8), 1052–1061 (2006)CrossRefzbMATHGoogle Scholar
  11. 11.
    NVIDIA: CUDA Programming Guide Version 3.2 (2010)Google Scholar
  12. 12.
    Group, K.: OpenCL 1.0 Quick Reference Card (2010)Google Scholar
  13. 13.
    Luong, T.V., Melab, N., Talbi, E.G.: Large neighborhood for local search algorithms. In: International Parallel and Distributed Processing Symposium. IEEE Computer Society, Los Alamitos (2010)Google Scholar
  14. 14.
    Liefooghe, A., Basseur, M., Jourdan, L., Talbi, E.G.: Combinatorial optimization of stochastic multi-objective problems: An application to the flow-shop scheduling problem. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds.) EMO 2007. LNCS, vol. 4403, pp. 457–471. Springer, Heidelberg (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Thé Van Luong
    • 1
  • Nouredine Melab
    • 1
  • El-Ghazali Talbi
    • 1
  1. 1.INRIA Dolphin Project / Opac LIFL CNRSVilleneuve d’Ascq CedexFrance

Personalised recommendations