DocumentCode
2926294
Title
Using Mutation to Improve Discrete Particle Swarm Optimization for Single Machine Total Weighted Tardiness Problem
Author
Huang, Cheng-Lung ; Tung, Chi-Hsiung
Author_Institution
Nat. Kaohsiung First Univ. of Sci. & Technol., Kaohsiung
fYear
2006
fDate
24-26 July 2006
Firstpage
1
Lastpage
6
Abstract
This study uses a random transposition for a dynamic mutation operator similar to those used in evolutionary algorithms to optimize the problem of the total weighted tardiness for single machine. Results show that the PSO with mutation strategy has good performances in convergence and hit ratio for finding the best objective value.
Keywords
evolutionary computation; particle swarm optimisation; single machine scheduling; discrete particle swarm optimization; dynamic mutation operator; evolutionary algorithms; single machine total weighted tardiness problem; Ant colony optimization; Automation; Evolutionary computation; Genetic algorithms; Genetic mutations; Heuristic algorithms; Information management; Particle swarm optimization; Scheduling algorithm; Single machine scheduling; Genetic algorithm; Mutation; Particle swarm optimization; Permutation problem; Scheduling; Total weighted tardiness;
fLanguage
English
Publisher
ieee
Conference_Titel
Automation Congress, 2006. WAC '06. World
Conference_Location
Budapest
Print_ISBN
1-889335-33-9
Type
conf
DOI
10.1109/WAC.2006.376018
Filename
4259934
Link To Document