Co-evolving parasites improve simulated evolution as an optimization procedure
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Theory and Practice of Uncertain Programming
Theory and Practice of Uncertain Programming
Competitive Environments Evolve Better Solutions for Complex Tasks
Proceedings of the 5th International Conference on Genetic Algorithms
A Cooperative Coevolutionary Approach to Function Optimization
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A genetic algorithm approach to job shop scheduling
A genetic algorithm approach to job shop scheduling
Stochastic Machine Scheduling with Precedence Constraints
SIAM Journal on Computing
Models and Algorithms for Stochastic Online Scheduling
Mathematics of Operations Research
Preemptive stochastic online scheduling on two uniform machines
Information Processing Letters
Hybrid particle swarm optimization for flow shop scheduling with stochastic processing time
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
A hybrid quantum-inspired genetic algorithm for flow shop scheduling
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Stochastic online scheduling on parallel machines
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization
IEEE Transactions on Evolutionary Computation
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
Expert Systems with Applications: An International Journal
Quantum-inspired evolutionary algorithms: a survey and empirical study
Journal of Heuristics
Simplified multi-objective genetic algorithms for stochastic job shop scheduling
Applied Soft Computing
Population-based neighborhood search for job shop scheduling with interval processing time
Computers and Industrial Engineering
Evolutionary algorithm for stochastic job shop scheduling with random processing time
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
In this paper, a novel competitive co-evolutionary quantum genetic algorithm (CCQGA) is proposed for a stochastic job shop scheduling problem (SJSSP) with the objective to minimize the expected value of makespan. Three new strategies named as competitive hunter, cooperative surviving and the big fish eating small fish are developed in population growth process. Based on improved co-evolution idea of multi-population and concepts of quantum theory, this algorithm could not only adjust population size dynamically to increase the diversity of genes and avoid premature convergence, but also accelerate the convergence speed with Q-bit representation and quantum rotation gate. FT benchmark-based problems where the processing times are subjected to independent normal distributions are solved effectively by CCQGA. The experiment results achieved by CCQGA are compared with quantum-inspired genetic algorithm (QGA) and standard genetic algorithm (GA), which shows that CCQGA has better feasibility and effectiveness.