Evolution algorithms in combinatorial optimization
From MaRDI portal
Publication:1104056
DOI10.1016/0167-8191(88)90098-1zbMath0646.65054OpenAlexW2051682049MaRDI QIDQ1104056
M. Gorges-Schleuter, O. Krämer, Heinz Mühlenbein
Publication date: 1988
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(88)90098-1
combinatorial optimizationtraveling salesman problemgeneric algorithmreplicator equationNumerical resultsgraph partitioning problemevolution algorithmssuperlinear speedupnetwork algorithmDarwinian algorithm
Related Items
Chemical compound design using nuclear charge distributions ⋮ Common intervals of trees ⋮ Binary Optimal Control of Single-Flux-Quantum Pulse Sequences ⋮ Genetically improved presequences for Euclidean traveling salesman problems ⋮ A new adaptive multi-start technique for combinatorial global optimizations ⋮ Evolution based learning in a job shop scheduling environment ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ Applying designed experiments to optimize the performance of genetic algorithms used for scheduling complex products in the capital goods industry ⋮ The Parallel Genetic Algorithm for Electromagnetic Inverse Scattering of a Conductor ⋮ CONVERGENCE OF GENETIC EVOLUTION ALGORITHMS FOR OPTIMIZATION ⋮ A computer-aided process planning model based on genetic algorithms ⋮ Scatter search and star-paths: Beyond the genetic metaphor ⋮ A genetic algorithm approach to periodic railway synchronization ⋮ Combining simulated annealing with local search heuristics ⋮ Genetic algorithms for the traveling salesman problem ⋮ Genetic and hybrid algorithms for graph coloring ⋮ A comparison of local search methods for flow shop scheduling ⋮ Metaheuristics: A bibliography ⋮ Parallel local search ⋮ Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs ⋮ Resolution of pattern recognition problems using a hybrid genetic/random neural network learning algorithm ⋮ Optimal minimal variation control with quality constraint for fed-batch fermentation processes involving multiple feeds ⋮ Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing ⋮ The ``molecular traveling salesman ⋮ A hybrid genetic algorithm for the resource-constrained project scheduling problem ⋮ Memetic particle swarm optimization ⋮ Large-step Markov chains for the TSP incorporating local search heuristics ⋮ Genetic algorithms in coding theory -- a table for \(A_ 3(n, d)\) ⋮ Local search in coding theory ⋮ Performance of a neural network method with set partitioning ⋮ Neural network methods in combinatorial optimization ⋮ Variable neighborhood algebraic differential evolution: an application to the linear ordering problem with cumulative costs ⋮ Sequencing and scheduling for filling lines in dairy production ⋮ Memetic algorithms: The polynomial local search complexity theory perspective ⋮ Common intervals of multiple permutations ⋮ Unnamed Item ⋮ A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem ⋮ USPEX-evolutionary crystal structure prediction ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ Modeling and parameter identification for a nonlinear multi-stage system for \textit{dha regulon} in batch culture ⋮ Genetic algorithms and traveling salesman problems ⋮ The use of dynamic programming in genetic algorithms for permutation problems ⋮ Parallel processing for difficult combinatorial optimization problems ⋮ A framework for multi-robot node coverage in sensor networks ⋮ Searching for backbones -- an efficient parallel algorithm for the traveling salesman problem ⋮ Searching the solution space in constructive geometric constraint solving with genetic algorithms ⋮ Minimizing flow time variance in a single machine system using genetic algorithms ⋮ Genetic local search in combinatorial optimization ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
