Genetic algorithms: Foundations and applications
From MaRDI portal
Publication:1813378
DOI10.1007/BF02022092zbMath0796.68167OpenAlexW1998456004MaRDI QIDQ1813378
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
Related Items
Unrelated parallel machine scheduling using local search, Evolution based learning in a job shop scheduling environment, A unifying approach to heuristic search, Empirical study of the improved UNIRANDI local search method, Derivative-free optimization: a review of algorithms and comparison of software implementations, D-Wave and predecessors: From simulated to quantum annealing, 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, Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information, Investigating brachistochrone trajectories with a multistage real‐parameter genetic algorithm, A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework, Comparison of the performance of modern heuristics for combinatorial optimization on real data, Efficient solutions for the far from most string problem, A genetic algorithm for facility layout, A genetic algorithm for reliability-oriented task assignment in a distributed system, Optimization of multipass turning operations with genetic algorithms, New evolutionary genetic algorithms for NP-complete combinatorial optimization problems, The job shop scheduling problem: Conventional and new solution techniques, A genetic algorithm-based approach to cell composition and layout design problems, Minimizing flow time variance in a single machine system using genetic algorithms, Genetic local search in combinatorial optimization
Cites Work
