Welcome to the InfoSci Platform
Reference Hub6
Discrete Fireworks Algorithm for Single Machine Scheduling Problems

Discrete Fireworks Algorithm for Single Machine Scheduling Problems

Mohamed Amine El Majdouli, Abdelhakim Ameur El Imrani
Copyright: © 2016 |Volume: 7 |Issue: 3 |Pages: 12
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781466691223|DOI: 10.4018/IJAMC.2016070102
Cite Article Cite Article

MLA

El Majdouli, Mohamed Amine, and Abdelhakim Ameur El Imrani. "Discrete Fireworks Algorithm for Single Machine Scheduling Problems." IJAMC vol.7, no.3 2016: pp.24-35. http://doi.org/10.4018/IJAMC.2016070102

APA

El Majdouli, M. A. & El Imrani, A. A. (2016). Discrete Fireworks Algorithm for Single Machine Scheduling Problems. International Journal of Applied Metaheuristic Computing (IJAMC), 7(3), 24-35. http://doi.org/10.4018/IJAMC.2016070102

Chicago

El Majdouli, Mohamed Amine, and Abdelhakim Ameur El Imrani. "Discrete Fireworks Algorithm for Single Machine Scheduling Problems," International Journal of Applied Metaheuristic Computing (IJAMC) 7, no.3: 24-35. http://doi.org/10.4018/IJAMC.2016070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Over the recent years, Fireworks Algorithm has recorded an increasing success on solving continuous optimization problems, due to its efficiency, simplicity and more importantly its rapid convergence to good optimums. Thus, the Fireworks Algorithm performance is now widely comparable with the most popular methods in the optimization field such as evolutionary computation and swarm intelligence techniques. This paper introduces a discrete Fireworks Algorithm for combinatorial single machine scheduling problems. Taking advantage of the robust design of the original Fireworks Algorithm, a new adaptation of sparks generation is proposed with a novel use of the control parameters. To verify the explorative performance of the algorithm, a hybridization with Variable Neighborhood Search heuristic is implemented. To validate it, the proposed method is tested with several benchmarks instances of the single machine total weighted tardiness. A comparison with other optimization algorithms is also included. The obtained results exhibit the high performance of the proposed method.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.