Modified whale optimization algorithm for solving unrelated parallel machine scheduling problems / A. A. Al-qaness Mohammed, A. Ewees Ahmed, A. M. Mokhamed Elsaed

Уровень набора: Soft ComputingОсновной Автор-лицо: Al-qaness Mohammed, A. A.Альтернативный автор-лицо: Ewees Ahmed, A.;Mokhamed Elsaed, A. M., Specialist in the field of informatics and computer technology, Professor of Tomsk Polytechnic University, 1987-, Akhmed MokhamedКоллективный автор (вторичный): Национальный исследовательский Томский политехнический университет, Инженерная школа информационных технологий и робототехники, Отделение информационных технологийЯзык: английский.Резюме или реферат: Unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times is considered a hot topic among the researchers, as it presents more complexity to be able to find an optimal solution. Many efforts have been made to solve UPMSP problems and established their performances. Therefore, in this study, a new method is introduced to address UPMSP problems with sequence-dependent and machine-dependent setup time. Our proposed method utilizes two meta-heuristic techniques, the whale optimization algorithm (WOA) and the firefly algorithm (FA), by combining their features to perform this task. The hybrid model is called WOAFA. For more detail, the operators of the FA are employed to improve the exploitation ability of the WOA by serving as a local search. Moreover, the quality of the proposed WOAFA method is tested by comparing with well-known meta-heuristic algorithms over six machines and six jobs, namely (2, 4, 6, 8, 10, and 12 machines) and (20, 40, 60, 80, 100, and 120 jobs)..Примечания о наличии в документе библиографии/указателя: [References: 47 tit.].Тематика: электронный ресурс | труды учёных ТПУ | whale optimization algorithm | firefly algorithm | meta-heuristic | unrelated parallel machine scheduling problem | local search Ресурсы он-лайн:Щелкните здесь для доступа в онлайн
Тэги из этой библиотеки: Нет тэгов из этой библиотеки для этого заглавия. Авторизуйтесь, чтобы добавить теги.
Оценка
    Средний рейтинг: 0.0 (0 голосов)
Нет реальных экземпляров для этой записи

Title screen

[References: 47 tit.]

Unrelated parallel machine scheduling problem (UPMSP) with sequence-dependent setup times is considered a hot topic among the researchers, as it presents more complexity to be able to find an optimal solution. Many efforts have been made to solve UPMSP problems and established their performances. Therefore, in this study, a new method is introduced to address UPMSP problems with sequence-dependent and machine-dependent setup time. Our proposed method utilizes two meta-heuristic techniques, the whale optimization algorithm (WOA) and the firefly algorithm (FA), by combining their features to perform this task. The hybrid model is called WOAFA. For more detail, the operators of the FA are employed to improve the exploitation ability of the WOA by serving as a local search. Moreover, the quality of the proposed WOAFA method is tested by comparing with well-known meta-heuristic algorithms over six machines and six jobs, namely (2, 4, 6, 8, 10, and 12 machines) and (20, 40, 60, 80, 100, and 120 jobs).

Для данного заглавия нет комментариев.

оставить комментарий.