Genetic algorithms: Foundations and applications
From MaRDI portal
Cited in
(22)- Genetic local search in combinatorial optimization
- A unifying approach to heuristic search
- New evolutionary genetic algorithms for NP-complete combinatorial optimization problems
- A genetic algorithm-based approach to cell composition and layout design problems
- D-Wave and predecessors: from simulated to quantum annealing
- A comparison of local search methods for flow shop scheduling
- Empirical study of the improved UNIRANDI local search method
- Minimizing flow time variance in a single machine system using genetic algorithms
- A genetic algorithm for reliability-oriented task assignment in a distributed system
- 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
- The job shop scheduling problem: Conventional and new solution techniques
- Comparison of the performance of modern heuristics for combinatorial optimization on real data
- A combined procedure for discrete simulation-optimization problems based on the simulated annealing framework
- Investigating brachistochrone trajectories with a multistage real‐parameter genetic algorithm
- Unrelated parallel machine scheduling using local search
- Metaheuristics: A bibliography
- Optimization of multipass turning operations with genetic algorithms
- Evolution based learning in a job shop scheduling environment
- A genetic algorithm for facility layout
- Efficient solutions for the far from most string problem
- Derivative-free optimization: a review of algorithms and comparison of software implementations
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)
