Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Models for iterative global optimization
Models for iterative global optimization
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling
Computers and Operations Research
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
The Travelling Salesman Problem (TSP) has a "big valley" search space landscape: good solutions share common building blocks. In evolutionary computation, crossover mixes building blocks, and so crossover works well on TSP. This paper considers a more complicated and realistic single-machine problem, with batching/lotsizing, sequencedependent setup times, and time-dependent costs. Instead of a big valley, it turns out that good solutions share few building blocks. For large enough problems, good solutions have essentially nothing in common. This suggests that crossover (which mixes building blocks) is not suited to this more complex problem.