This content is not included in your SAE MOBILUS subscription, or you are not logged in.

A Comparative Analysis of Metaheuristic Approaches (Genetic Algorithm/Hybridization of Genetic Algorithms and Simulated Annealing) for Planning and Scheduling Problem with Energy Aspect

Journal Article
05-14-04-0024
ISSN: 1946-3979, e-ISSN: 1946-3987
Published May 20, 2021 by SAE International in United States
A Comparative Analysis of Metaheuristic Approaches (Genetic Algorithm/Hybridization of Genetic Algorithms and Simulated Annealing) for Planning and Scheduling Problem with Energy Aspect
Sector:
Citation: Hassani, Z., El Barkany, A., Jabri, A., Abbassi, I. et al., "A Comparative Analysis of Metaheuristic Approaches (Genetic Algorithm/Hybridization of Genetic Algorithms and Simulated Annealing) for Planning and Scheduling Problem with Energy Aspect," SAE Int. J. Mater. Manf. 14(4):363-373, 2021, https://doi.org/10.4271/05-14-04-0024.
Language: English

Abstract:

This article discusses a multi-item planning and scheduling problem in a job-shop system with consideration of energy consumption. Planning is considered by a set of periods, each one is characterized by a demand, energy, and length. Scheduling is determined by the sequences of jobs on available resources. A Mixed-Integer Linear Programming (MILP) problem is formulated to integrate planning and scheduling, it is considered as an NP-difficult problem. A Genetic Algorithm (GA) is then developed to solve the MILP, and then a hybridized approach of simulated annealing with genetic algorithm (HGASA) is presented to optimize the results. Finally, numerical results are presented and analyzed to evaluate the effectiveness of the proposed algorithms.