AI Chat AI Image Generator AI Video Text to Speech

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

12/16/2014

∙

by A. V. Eremeev, et al.

∙

∙

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_). 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_.

A. V. Eremeev
2 publications
Ju. V. Kovalenko
1 publication

page 1

page 2

page 3

page 4

research

∙ 08/16/2013

Genetic Algorithm for Solving Simple Mathematical Equality Problem

This paper explains genetic algorithm for novice in this field. Basic ph...

0 Denny Hermawanto, et al. ∙

research

∙ 06/21/2017

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

We propose a new genetic algorithm with optimal recombination for the as...

0 A. V. Eremeev, et al. ∙

research

∙ 07/21/2013

Optimal Recombination in Genetic Algorithms

This paper surveys results on complexity of the optimal recombination pr...

0 Anton V. Eremeev, et al. ∙

research

∙ 10/04/2019

Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art

The Order Acceptance and Scheduling (OAS) problem describes a class of r...

0 Lei He, et al. ∙

research

∙ 01/31/2010

Genetic algorithm for robotic telescope scheduling

This work was inspired by author experiences with a telescope scheduling...

0 Petr Kubanek, et al. ∙

research

∙ 05/28/2013

A Cooperative Coevolutionary Genetic Algorithm for Learning Bayesian Network Structures

We propose a cooperative coevolutionary genetic algorithm for learning B...

0 Arthur Carvalho, et al. ∙

research

∙ 04/19/2010

Genetic Algorithms for Multiple-Choice Problems

This thesis investigates the use of problem-specific knowledge to enhanc...

0 Uwe Aickelin, et al. ∙