Ir al contenido

Documat


Elite Artificial Bee Colony for Makespan Optimisation in Job Shop with Interval Uncertainty

  • Hernán Díaz [1] ; Juan José Palacios [1] ; Inés González-Rodríguez [2] ; Camino R. Vela [1]
    1. [1] Universidad de Oviedo

      Universidad de Oviedo

      Oviedo, España

    2. [2] Universidad de Cantabria

      Universidad de Cantabria

      Santander, España

  • Localización: Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence: 9th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2022, Puerto de la Cruz, Tenerife, Spain, May 31 – June 3, 2022, Proceedings, Part II / José Manuel Ferrández Vicente (dir. congr.) Árbol académico, José Ramón Álvarez Sánchez (dir. congr.) Árbol académico, Félix de la Paz López (dir. congr.) Árbol académico, Hojjat Adeli (aut.), 2022, ISBN 978-3-031-06527-9, págs. 98-108
  • Idioma: inglés
  • Texto completo no disponible (Saber más ...)
  • Resumen
    • This paper addresses a variant of the Job Shop Scheduling Problem with makespan minimisation where uncertainty in task durations is taken into account and modelled with intervals. Given the problem’s complexity, we tackle it using a metaheuristic approach. Specifically, we propose a novel Artificial Bee Colony algorithm incorporating three different selection mechanisms that help in guiding the search towards more promising areas. A parametric analysis is conducted and a comparison of the different selection strategies is performed on a set of benchmark instances. The results illustrate the benefit of using the new guiding strategies, improving the behaviour of the ABC algorithm, which compares favourably to the state-of-the art in the problem. An additional study is conducted to assess the robustness of the solutions obtained under each guiding strategy.


Fundación Dialnet

Mi Documat

Opciones de artículo

Opciones de compartir

Opciones de entorno