Parallel genetic algorithms with local search

DOI10.1016/0305-0548(95)00061-5zbMath0847.90116OpenAlexW2036246488MaRDI QIDQ1915976

Christopher L. Huntley, Donald E. Brown

Publication date: 1 July 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(95)00061-5

zbMATH Keywords

global optimizationlocal searchquadratic assignmentparallel implementationgenetic algorithmmultistart

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27) Parallel numerical computation (65Y05)

Related Items (3)

A survey for the quadratic assignment problem ⋮ A memetic algorithm for multi-objective dynamic location problems ⋮ Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• A parallel heuristic for quadratic assignment problems
• Bayesian stopping rules for multistart global optimization methods
• The Backboard Wiring Problem: A Placement Algorithm
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Using Confidence Limits for the Global Optimum in Combinatorial Optimization
• Stochastic global optimization methods part I: Clustering methods
• Sequential stopping rules for the multistart algorithm in global optimisation
• Tabu Search Applied to the Quadratic Assignment Problem
• Hospital Layout as a Quadratic Assignment Problem
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Interval estimation of a global optimum for large combinatorial problems
• Global optimization

This page was built for publication: Parallel genetic algorithms with local search