Analysis of Optimal Recombination in Genetic Algorithm for a Scheduling Problem with Setups

2014/12/16 by A. V. Eremeev, Eremeev, A. V., Ju. V. Kovalenko +1
Computer Science · #FOS: Computer and information sciences #Neural and Evolutionary Computing (cs.NE) #cs.NE

paper · pdf · doi:10.48550/arxiv.1412.5067

13 pages, in Russian

arxiv created 2014/12/16 · arxiv updated 2014/12/17

Abstract

In this paper, we perform an experimental study of optimal recombination operator for makespan minimization problem on single machine with sequence-dependent setup times (1|s_vu|C_max). The computational experiment on benchmark problems from TSPLIB library indicates practical applicability of optimal recombination in crossover operator of genetic algorithm for 1|s_vu|C_max.

Related

• Optimal Recombination in Genetic Algorithms
• Runtime Performance of Evolutionary Algorithms for the Chance-constrained Makespan Scheduling Problem
• Multiprocessor Scheduling Using Parallel Genetic Algorithm
• Genetic Algorithm with Innovative Chromosome Patterns in the Breeding Process
• Perfect Edge-Transmitting Recombination of Permutations