Research on solving multi-objective flexible workshop scheduling problem based on genetic ant colony algorithm

This article is based on the optimization idea of genetic algorithm for multi-objective flexible workshop scheduling. Firstly, the problem domain is described, and three objective functions including minimum cycle time are defined. Then, genetic algorithm is used to search for preliminary optimization solutions. During this period, information entropy strategy is used to adaptively adjust parameters to ensure population diversity; Subsequently, the ant colony algorithm is used for precise search, and pheromones are allocated based on the dominant relationship obtained from the search, ultimately obtaining the non dominated solution of the Pareto frontier. The experimental results show that the genetic ant colony algorithm has obvious improvement in efficiency and solution accuracy compared with the ordinary genetic algorithm. The innovation of this paper lies in the use of genetic algorithm to initialise the population, and then the use of ant colony algorithm to carry out local accurate search; as well as adding the concept of information entropy in the genetic algorithm, and the use of control information entropy is relatively stable to self-adaptively regulate the rate of variation and crossover rate, balancing the exploration and utilisation of the algorithm.

Authors

Institutions

Publication Details

Published
2024-09-23
DOI
https://doi.org/10.1109/icedcs64328.2024.00172
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on solving multi-objective flexible workshop scheduling problem based on genetic ant colony algorithm

Xinyu Zhao
Scheduling and Optimization Algorithms
article

Research on solving multi-objective flexible workshop scheduling problem based on genetic ant colony algorithm

Xinyu Zhao
article en

Abstract

This article is based on the optimization idea of genetic algorithm for multi-objective flexible workshop scheduling. Firstly, the problem domain is described, and three objective functions including minimum cycle time are defined. Then, genetic algorithm is used to search for preliminary optimization solutions. During this period, information entropy strategy is used to adaptively adjust parameters to ensure population diversity; Subsequently, the ant colony algorithm is used for precise search, and pheromones are allocated based on the dominant relationship obtained from the search, ultimately obtaining the non dominated solution of the Pareto frontier. The experimental results show that the genetic ant colony algorithm has obvious improvement in efficiency and solution accuracy compared with the ordinary genetic algorithm. The innovation of this paper lies in the use of genetic algorithm to initialise the population, and then the use of ant colony algorithm to carry out local accurate search; as well as adding the concept of information entropy in the genetic algorithm, and the use of control information entropy is relatively stable to self-adaptively regulate the rate of variation and crossover rate, balancing the exploration and utilisation of the algorithm.

Tongji University (CN)
Openalex Percentile: Top 62%
Scheduling and Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.