Research Article | OPEN ACCESS
A Hybrid Evolutionary Algorithm for Discrete Optimization
J. Bhuvana
Department of Computer Science and Engineering, SSN College of Engineering, Chennai-603110, Tamilnadu, India
Research Journal of Applied Sciences, Engineering and Technology 2015 9:770-777
Received: October 10, 2014 | Accepted: November 3, 2014 | Published: March 25, 2015
Abstract
Most of the real world multi-objective problems demand us to choose one Pareto optimal solution out of a finite set of choices. Flexible job shop scheduling problem is one such problem whose solutions are required to be selected from a discrete solution space. In this study we have designed a hybrid genetic algorithm to solve this scheduling problem. Hybrid genetic algorithms combine both the aspects of the search, exploration and exploitation of the search space. Proposed algorithm, Hybrid GA with Discrete Local Search, performs global search through the GA and exploits the locality through discrete local search. Proposed hybrid algorithm not only has the ability to generate Pareto optimal solutions and also identifies them with less computation. Five different benchmark test instances are used to evaluate the performance of the proposed algorithm. Results observed shown that the proposed algorithm has produced the known Pareto optimal solutions through exploration and exploitation of the search space with less number of functional evaluations.
Keywords:
Discrete local search, flexible job shop scheduling, genetic algorithm, memetic algorithm, multiobjective optimization, Pareto optimal,
Competing interests
The authors have no competing interests.
Open Access Policy
This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Copyright
The authors have no competing interests.
|
|
 |
ISSN (Online): 2040-7467
ISSN (Print): 2040-7459 |
 |
Information |
|
|
|
Sales & Services |
|
|
|