An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem

This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, an...

Full description

Bibliographic Details
Main Authors: Dana Marsetiya Utama, Dian Setiya Widodo, Muhammad Faisal Ibrahim, Shanty Kusuma Dewi
Format: Article
Language:English
Published: Universitas Ahmad Dahlan 2020-03-01
Series:IJAIN (International Journal of Advances in Intelligent Informatics)
Subjects:
Online Access:http://ijain.org/index.php/IJAIN/article/view/385
_version_ 1818927777435353088
author Dana Marsetiya Utama
Dian Setiya Widodo
Muhammad Faisal Ibrahim
Shanty Kusuma Dewi
author_facet Dana Marsetiya Utama
Dian Setiya Widodo
Muhammad Faisal Ibrahim
Shanty Kusuma Dewi
author_sort Dana Marsetiya Utama
collection DOAJ
description This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEH-EDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments.
first_indexed 2024-12-20T03:18:24Z
format Article
id doaj.art-276a39a3c1b146abaff7a814612f9842
institution Directory Open Access Journal
issn 2442-6571
2548-3161
language English
last_indexed 2024-12-20T03:18:24Z
publishDate 2020-03-01
publisher Universitas Ahmad Dahlan
record_format Article
series IJAIN (International Journal of Advances in Intelligent Informatics)
spelling doaj.art-276a39a3c1b146abaff7a814612f98422022-12-21T19:55:16ZengUniversitas Ahmad DahlanIJAIN (International Journal of Advances in Intelligent Informatics)2442-65712548-31612020-03-0161233510.26555/ijain.v6i1.385131An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problemDana Marsetiya Utama0Dian Setiya Widodo1Muhammad Faisal Ibrahim2Shanty Kusuma Dewi3Departement of Industrial Engineering, University Of Muhammadiyah Malang (UMM)University of 17 Agustus 1945 SurabayaUniversitas Internasional Semen IndonesiaDepartement of Industrial Engineering, University Of Muhammadiyah Malang (UMM)This article aimed to develop an improved Ant Lion algorithm. The objective function was to minimize the mean tardiness on the flow shop scheduling problem with a focus on the permutation flow shop problem (PFSP). The Hybrid Ant Lion Optimization Algorithm (HALO) with local strategy was proposed, and from the total search of the agent, the NEH-EDD algorithm was applied. Moreover, the diversity of the nominee schedule was improved through the use of swap mutation, flip, and slide to determine the best solution in each iteration. Finally, the HALO was compared with some algorithms, while some numerical experiments were used to show the performances of the proposed algorithms. It is important to note that comparative analysis has been previously conducted using the nine variations of the PFSSP problem, and the HALO obtained was compared to other algorithms based on numerical experiments.http://ijain.org/index.php/IJAIN/article/view/385optimizationmean tardinesshybrid ant lionflow shopscheduling
spellingShingle Dana Marsetiya Utama
Dian Setiya Widodo
Muhammad Faisal Ibrahim
Shanty Kusuma Dewi
An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
IJAIN (International Journal of Advances in Intelligent Informatics)
optimization
mean tardiness
hybrid ant lion
flow shop
scheduling
title An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
title_full An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
title_fullStr An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
title_full_unstemmed An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
title_short An effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
title_sort effective hybrid ant lion algorithm to minimize mean tardiness on permutation flow shop scheduling problem
topic optimization
mean tardiness
hybrid ant lion
flow shop
scheduling
url http://ijain.org/index.php/IJAIN/article/view/385
work_keys_str_mv AT danamarsetiyautama aneffectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT diansetiyawidodo aneffectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT muhammadfaisalibrahim aneffectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT shantykusumadewi aneffectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT danamarsetiyautama effectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT diansetiyawidodo effectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT muhammadfaisalibrahim effectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem
AT shantykusumadewi effectivehybridantlionalgorithmtominimizemeantardinessonpermutationflowshopschedulingproblem