Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems
From MaRDI portal
Publication:727261
DOI10.1016/j.apm.2012.06.005zbMath1351.90170OpenAlexW2090200997MaRDI QIDQ727261
Publication date: 6 December 2016
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2012.06.005
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
A multi-parent genetic algorithm for the quadratic assignment problem ⋮ Group-shop scheduling with sequence-dependent set-up and transportation times
Cites Work
- Unnamed Item
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
- The job shop tardiness problem: A decomposition approach
- A greedy genetic algorithm for the quadratic assignment problem
- Multi-parent extension of sequential constructive crossover for the travelling salesman problem
- A self-guided genetic algorithm for permutation flowshop scheduling problems
- Analysis of speciation and niching in the multi-niche crowding GA
- Benchmarks for basic scheduling problems
- Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
- Evolutionary Multi-Criterion Optimization
This page was built for publication: Multiple parents crossover operators: a new approach removes the overlapping solutions for sequencing problems