logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A Method for FlowShop Scheduling Problem by Using Hybrid Ant Algorithm

delete2026-01-01
delete0
PRE
AI
H
Haijun Liu
W
Weiyi Lv
C
Chenyan Wang *
DOI：10.1007/978-3-031-97352-9_10delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In today's rapidly evolving society, information technology is transforming into a new driving force for solving specific problems. As artificial intelligence and big data technologies mature, they significantly impact modern industrial development. This study addresses issues in the basic ant colony algorithm, such as overlooking better solutions and excessive runtime, by designing a novel hybrid optimization ant colony algorithm. By incorporating the substitution strategy from the tabu algorithm, adding an elite ant local search process, and integrating aspects of genetic algorithms, this hybrid approach effectively extends the basic ant colony algorithm. It largely avoids premature convergence and enhances algorithm efficiency. Matlab simulations demonstrate the hybrid ant colony algorithm's advantages in various aspects of the solution process through data tables and iterative graphs. This research into artificial intelligence algorithms is expected to positively impact industrial production, potentially reducing resource waste and promoting social progress.
Keywords:
artificial intelligence
the hybrid Ant colony algorithm
Flow shop scheduling problem

Journal

D
DATA INFORMATION IN ONLINE ENVIRONMENTS, DIONE 2024
IF:
0
Papers:
25
Citations:
0

Organization

No organization information available