Title :
Search landscape of a realistic single-machine scheduling task: peaks with big differences
Author_Institution :
Sch. of Inf. Technol. & Electr. Eng., Queensland Univ., Brisbane, Qld., Australia
fDate :
6/24/1905 12:00:00 AM
Abstract :
Some scheduling problems, including the Travelling Salesman Problem (TSP), have a "big valley" search landscape: the best solutions have common building blocks, so crossover works well. Unfortunately, in a realistic single-machine problem (TSP with batching, sequence-dependent setups, and multi-level precedence constraints) the best solutions have little in common. A mutation-only approach works better
Keywords :
genetic algorithms; travelling salesman problems; mutation-only approach; realistic single-machine scheduling task; search landscape; single-machine problem; travelling salesman problem; Australia; Cities and towns; Costs; Evolutionary computation; Information technology; Job shop scheduling; Processor scheduling; Single machine scheduling; Traveling salesman problems;
Conference_Titel :
Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on
Conference_Location :
Honolulu, HI
Print_ISBN :
0-7803-7282-4
DOI :
10.1109/CEC.2002.1004412
