Local Search Based on Genetic Algorithms

DOI10.1007/978-3-540-72960-0_10zbMath1211.90304OpenAlexW1583006817MaRDI QIDQ3509426

Carlos García-Martínez, Manuel Lozano

Publication date: 1 July 2008

Published in: Natural Computing Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72960-0_10

zbMATH Keywords

local searchgenetic algorithmmemetic algorithmcrossover operatorgreedy randomise adaptive search procedure

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index ⋮ Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report ⋮ Gaussian Variable Neighborhood Search and Enhanced Genetic Algorithm for Continuous Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unconstrained quadratic bivalent programming problem
• Metaheuristics in combinatorial optimization
• Tackling real-coded genetic algorithms: operators and tools for behavioural analysis
• A new adaptive multi-start technique for combinatorial global optimizations
• Variable neighborhood search
• Greedy randomized adaptive search procedures
• A GA-based fuzzy modeling approach for generating TSK models
• Global and local real-coded genetic algorithms based on parent-centric crossover operators
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
• Randomized heuristics for the Max-Cut problem
• A taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study
• A Spectral Bundle Method for Semidefinite Programming
• Reducibility among Combinatorial Problems

This page was built for publication: Local Search Based on Genetic Algorithms