An improved society of hill-climbers and its application on batch process scheduling

Authors:
Lei Zhang
Affiliations:
Auburn University, Auburn, AL
Venue:
Proceedings of the 43rd annual Southeast regional conference - Volume 1
Year:
2005

Citing 4
Cited 0

An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A smart hill-climbing algorithm for application server configuration

Proceedings of the 13th international conference on World Wide Web
A comparative study on methods for reducing myopia of hill-climbing search in multirelational learning

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Solving distributed asymmetric constraint satisfaction problems using an evolutionary society of hill-climbers

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Quantified Score

Hi-index	0.00

Visualization

Abstract

Society of Hill-Climbers (SOHC) is a kind of powerful evolutionary optimization algorithm for a large range of problems. But the performance of the algorithm is sensitive to the mutation rate, which must be determined by the user based on the problem. In this study, the performance of SOHC with different mutation rate was evaluated on a series of large numerical problems and mutation rates robust for all the problems tested were identified. Then the algorithm was applied to an important type of optimization problem, the scheduling problem of batch process. The results show that SOHC is a very versatile and powerful method for solving the batch process scheduling problems and is superior to the widely used simulated annealing.