A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Generalizing the notion of schema in genetic algorithms
Artificial Intelligence
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
AllelesLociand the Traveling Salesman Problem
Proceedings of the 1st International Conference on Genetic Algorithms
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint
Proceedings of the 3rd International Conference on Genetic Algorithms
Applying adaptive algorithms to epistatic domains
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
On the influence of the representation granularity in heuristic forma recombination
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Embedding Branch and Bound within Evolutionary Algorithms
Applied Intelligence
Using Dynastic Exploring Recombination to Promote Diversity in Genetic Search
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
Inferring Phylogenetic Trees Using Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Using Statistical Techniques to Predict GA Performance
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
A Comparison of Several Evolutionary Heuristics for the Frequency Assignment Problem
IWANN '01 Proceedings of the 6th International Work-Conference on Artificial and Natural Neural Networks: Connectionist Models of Neurons, Learning Processes and Artificial Intelligence-Part I
Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
MICAI'07 Proceedings of the artificial intelligence 6th Mexican international conference on Advances in artificial intelligence
Evolutionary clustering search for flowtime minimization in permutation flow shop
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A new evolutionary clustering search for a no-wait flow shop problem with set-up times
Engineering Applications of Artificial Intelligence
| Hi-index | 0.00 |
This paper analyzes different representations for permutation flowshop problems. This is done using forma analysis to assess the quality of these representations with respect to makespan optimization. Classical recombination operators are studied and empirically evaluated in this context. It is shown that the best operators work on representations in which absolute positions of tasks are relevant. Subsequently, some new operators operating on these representations are proposed. These new operators are designed to exhibit specific properties regarding implicit mutation and forma transmission. Their performance is shown to be competitive with traditional operators.