Conception de séquences de séparation par un algorithme génétique

DOI10.1051/RO/1997310403751zbMATH Open0886.68111OpenAlexW2515677939MaRDI QIDQ4372113

Author name not available (Why is that?)

Publication date: 4 May 1998

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105157

zbMATH Keywords

non elitist genetic algorithmsynthesis of separation sequences

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Related Items (1)

Optimal disassembly sequence generation using a genetic programming

Recommendations

• Title not available (Why is that?) 👍 👎
• A sequential sampling procedure for genetic algorithms 👍 👎
• A genetic algorithm for flowshop sequencing 👍 👎
• A two-phase genetic algorithm to solve variants of the batch sequencing problem 👍 👎
• Genetic Algorithms and Random Keys for Sequencing and Optimization 👍 👎
• A genetic algorithm for sequencing type problems in engineering design 👍 👎
• A genetic algorithm on multiple sequences alignment problems in biology 👍 👎

This page was built for publication: Conception de séquences de séparation par un algorithme génétique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4372113)