Genetic algorithms: Foundations and applications

DOI10.1007/BF02022092MaRDI QIDQ1813378zbMATH OpenOpenAlexFDO

Authors M. R. Hilliard, Gunar E. Liepins

Publication date 25 June 1992

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02022092

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Genetics and epigenetics (92D10)

Cited in

(25)

• New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
• The job shop scheduling problem: Conventional and new solution techniques
• Minimizing flow time variance in a single machine system using genetic algorithms
• Genetic local search in combinatorial optimization
• Unrelated parallel machine scheduling using local search
• Evolution based learning in a job shop scheduling environment
• Empirical study of the improved UNIRANDI local search method
• Efficient solutions for the far from most string problem
• A unifying approach to heuristic search
• A comparison of local search methods for flow shop scheduling
• Metaheuristics: A bibliography
• Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
• D-Wave and predecessors: from simulated to quantum annealing
• A genetic algorithm-based approach to cell composition and layout design problems
• Investigating brachistochrone trajectories with a multistage real‐parameter genetic algorithm
• A genetic algorithm for facility layout
• Optimization of multipass turning operations with genetic algorithms
• A genetic algorithm for reliability-oriented task assignment in a distributed system
• Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information
• Comparison of the performance of modern heuristics for combinatorial optimization on real data
• Finding consistent pairwise comparisons with genetic algorithms
• SCR, an efficient global optimization algorithm for constrained black-box problems
• Inconsistency reduction in pairwise comparison matrices using genetic algorithms

This page was built for publication: Genetic algorithms: Foundations and applications

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