A Self-guided Genetic Algorithm for permutation flowshop scheduling problems

Authors:
Shih-Hsin Chen;Pei-Chann Chang;T. C. E. Cheng;Qingfu Zhang
Affiliations:
Department of Electronic Commerce Management, Nanhua University, Taiwan, ROC;Department of Information Management, Yuan-Ze University, Taiwan, ROC;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, 11 Yuk Choi Road, Hung Hom, Kowloon, Hong Kong;School of Computer Science and Electronic Engineering, University of Essex, UK
Venue:
Computers and Operations Research
Year:
2012

Citing 17
Cited 1

A genetic algorithm for flowshop sequencing

Computers and Operations Research - Special issue on genetic algorithms
Fast probabilistic modeling for combinatorial optimization

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A Survey of Optimization by Building and Using Probabilistic Models

Computational Optimization and Applications
Using Optimal Dependency-Trees for Combinational Optimization

ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
From Recombination of Genes to the Estimation of Distributions I. Binary Parameters

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
GA-EDA: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms

IEA/AIE'2004 Proceedings of the 17th international conference on Innovations in applied artificial intelligence
Design and Analysis of Experiments

Design and Analysis of Experiments
Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems

Applied Soft Computing
A combinatorial particle swarm optimisation for solving permutation flowshop problems

Computers and Industrial Engineering
A discrete differential evolution algorithm for the permutation flowshop scheduling problem

Computers and Industrial Engineering
An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems

Computers and Operations Research
A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem

INFORMS Journal on Computing
Loopy Substructural Local Search for the Bayesian Optimization Algorithm

SLS '09 Proceedings of the Second International Workshop on Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics
The compact genetic algorithm

IEEE Transactions on Evolutionary Computation
A hybrid heuristic for the traveling salesman problem

IEEE Transactions on Evolutionary Computation
On the convergence of a class of estimation of distribution algorithms

IEEE Transactions on Evolutionary Computation

Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we develop a Self-guided Genetic Algorithm (Self-guided GA), which belongs to the category of Estimation of Distribution Algorithms (EDAs). Most EDAs explicitly use the probabilistic model to sample new solutions without using traditional genetic operators. EDAs make good use of the global statistical information collected from previous searches but they do not efficiently use the location information about individual solutions. It is recently realized that global statistical information and location information should complement each other during the evolution process. In view of this, we design the Self-guided GA based on a novel strategy to combine these two kinds of information. The Self-guided GA does not sample new solutions from the probabilistic model. Instead, it estimates the quality of a candidate offspring based on the probabilistic model used in its crossover and mutation operations. In such a way, the mutation and crossover operations are able to generate fitter solutions, thus improving the performance of the algorithm. We tested the proposed algorithm by applying it to deal with the NP-complete flowshop scheduling problem to minimize the makespan. The experimental results show that the Self-guided GA is very promising. We also demonstrate that the Self-guided GA can be easily extended to treat other intractable combinatorial problems.