Mapping the convergence of genetic algorithms

DOI10.1155/JAMDS/2006/70240zbMath1153.65342MaRDI QIDQ955480

Zvi Drezner, George A. Marcoulides

Publication date: 20 November 2008

Published in: Journal of Applied Mathematics and Decision Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/129558

zbMATH Keywords

convergencegenetic algorithmsquadratic assignment problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Discrete location and assignment (90B80)

Related Items

An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems

Uses Software

• HAS-QAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A level-2 reformulation-linearization technique bound for the quadratic assignment problem
• A genetic approach to the quadratic assignment problem
• The quadratic assignment problem. Theory and algorithms
• A new heuristic for the quadratic assignment problem
• A greedy genetic algorithm for the quadratic assignment problem
• Lower bounds based on linear programming for the quadratic assignment problem
• Solving large quadratic assignment problems on computational grids
• The extended concentric tabu for the quadratic assignment problem
• Compounded genetic algorithms for the quadratic assignment problem
• Lower Bounds for the Quadratic Assignment Problem Based upon a Dual Formulation
• The Quadratic Assignment Problem
• A New Genetic Algorithm for the Quadratic Assignment Problem
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• Ant colonies for the quadratic assignment problem
• DISCON: A New Method for the Layout Problem
• Tabu Search Applied to the Quadratic Assignment Problem
• Comparison of iterative searches for the quadratic assignment problem
• The Reactive Tabu Search
• Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• A new bound for the quadratic assignment problem based on convex quadratic programming