Hybrid genetic bees algorithm applied to single machine scheduling with earliness and tardiness penalties

Yuce, B., Fruggiero, F., Packianather, M.S. ORCID: https://orcid.org/0000-0002-9436-8206, Pham, D.T., Mastrocinque, E., Lambiase, A. and Fera, M. 2017. Hybrid genetic bees algorithm applied to single machine scheduling with earliness and tardiness penalties. Computers and Industrial Engineering 113 , pp. 842-858. 10.1016/j.cie.2017.07.018

Full text not available from this repository.

Abstract

This paper presents a hybrid Genetic-Bees Algorithm based optimised solution for the single machine scheduling problem. The enhancement of the Bees Algorithm (BA) is conducted using the Genetic Algorithm’s (GA’s) operators during the global search stage. The proposed enhancement aims to increase the global search capability of the BA gradually with new additions. Although the BA has very successful implementations on various type of optimisation problems, it has found that the algorithm suffers from weak global search ability which increases the computational complexities on NP-hard type optimisation problems e.g. combinatorial/permutational type optimisation problems. This weakness occurs due to using a simple global random search operation during the search process. To reinforce the global search process in the BA, the proposed enhancement is utilised to increase exploration capability by expanding the number of fittest solutions through the genetical variations of promising solutions. The hybridisation process is realised by including two strategies into the basic BA, named as “reinforced global search” and “jumping function” strategies. The reinforced global search strategy is the first stage of the hybridisation process and contains the mutation operator of the GA. The second strategy, jumping function strategy, consists of four GA operators as single point crossover, multipoint crossover, mutation and randomisation. To demonstrate the strength of the proposed solution, several experiments were carried out on 280 well-known single machine benchmark instances, and the results are presented by comparing to other well-known heuristic algorithms. According to the experiments, the proposed enhancements provides better capability to basic BA to jump from local minima, and GBA performed better compared to BA in terms of convergence and the quality of results. The convergence time reduced about 60% with about 30% better results for highly constrained jobs.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Engineering
Publisher:	Elsevier
ISSN:	0360-8352
Last Modified:	25 Oct 2022 13:40
URI:	https://orca.cardiff.ac.uk/id/eprint/120477

Citation Data

Cited 24 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item