Computers and Operations Research
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
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
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
Addressing sampling errors and diversity loss in UMDA
Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
Computers and Operations Research
Triangulation of Bayesian networks with recursive estimation of distribution algorithms
International Journal of Approximate Reasoning
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Constraint-based agents: an architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
Expert Systems with Applications: An International Journal
A Self-guided Genetic Algorithm for permutation flowshop scheduling problems
Computers and Operations Research
Diversity loss in general estimation of distribution algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Hybrid Estimation of Distribution Algorithm for solving Single Row Facility Layout Problem
Computers and Industrial Engineering
Hi-index | 0.00 |
In our previous researches, we proposed the artificial chromosomes with genetic algorithm (ACGA) which combines the concept of the Estimation of Distribution Algorithms (EDAs) with genetic algorithms (GAs). The probabilistic model used in the ACGA is the univariate probabilistic model. We showed that ACGA is effective in solving the scheduling problems. In this paper, a new probabilistic model is proposed to capture the variable linkages together with the univariate probabilistic model where most EDAs could use only one statistic information. This proposed algorithm is named extended artificial chromosomes with genetic algorithm (eACGA). We investigate the usefulness of the probabilistic models and to compare eACGA with several famous permutation-oriented EDAs on the benchmark instances of the permutation flowshop scheduling problems (PFSPs). eACGA yields better solution quality for makespan criterion when we use the average error ratio metric as their performance measures. In addition, eACGA is further integrated with well-known heuristic algorithms, such as NEH and variable neighborhood search (VNS) and it is denoted as eACGA"h"y"b"r"i"d to solve the considered problems. No matter the solution quality and the computation efficiency, the experimental results indicate that eACGA"h"y"b"r"i"d outperforms other known algorithms in literature. As a result, the proposed algorithms are very competitive in solving the PFSPs.