Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Fitness landscapes and memetic algorithm design
New ideas in optimization
Ant algorithms for discrete optimization
Artificial Life
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.01 |
Two stage continuous parallel flow shops with limited intermediate storage are common in process industry. Because of its computational complexity and continuous nature only special cases of the general problem have been solved to optimality so far. The focal point of this paper is the examination of appropriate indirect discrete representations that allow the application of evolutionary methods combined with local search. The results give insight into the most appropriate neighborhood structure and the usefulness of heuristic information for the guidance of the search process. In particular it is shown that the conceived Memetic Algorithm when submitted to a rigid time limit yields better results by using additional heuristic information.