Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation
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
Meta-heuristics: The State of the Art
ECAI '00 Proceedings of the Workshop on Local Search for Planning and Scheduling-Revised Papers
A review of particle swarm optimization. Part I: background and development
Natural Computing: an international journal
Natural Computing: an international journal
Computers and Operations Research
A Novel Discrete Particle Swarm Optimization Based on Estimation of Distribution
ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Genetic particle swarm optimization based on estimation of distribution
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
An estimation of distribution particle swarm optimization algorithm
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
A new Chance-Variance optimization criterion for portfolio selection in uncertain decision systems
Expert Systems with Applications: An International Journal
Hi-index | 12.05 |
In this paper we propose PSO-EDA, a hybrid particle swarm optimization (PSO) with estimation of distribution algorithm (EDA) to solve permutation flowshop scheduling problem (PFSP). PFSP is an NP-complete problem, for which PSO was recently applied. The social cognition in the metaphor of canonical PSO is incomplete, since information conveyed in the non-gbest particles is lost. Also, the intelligence of the particles is totally neglected by the canonical PSO and most of other literatures. To tackle such problems, we propose to enable the sharing of information from the collective experience of the swarm by hybridizing an EDA operator with PSO and to add the primitive intelligence to each particle by using a local search mechanism. To enhance the performance of the algorithm proposed, a new local search algorithm, the minimization-of-waiting-time local search (MWL), is applied. The computational experiment on different benchmark suites in PFSP, in which two new best known solutions have been found, shows a superiority of PSO-EDA over other counterpart algorithms in terms of accuracy.