Tabu search and design optimization

DOI10.1016/0010-4485(91)90089-FzbMath0735.65036OpenAlexW2075499381MaRDI QIDQ1178263

G. P. Dawson, J. A. Bland

Publication date: 26 June 1992

Published in: CAD. Computer-Aided Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0010-4485(91)90089-f

zbMATH Keywords

combinatorial optimizationtabu searchhigh degree of complexitylayout design of electronic circuits

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Applications of design theory to circuits and networks (94C30) Complexity and performance of numerical algorithms (65Y20)

Related Items (14)

Large-scale layout of facilities using a heuristic hybrid algorithm ⋮ Genetic algorithms and tabu search: Hybrids for optimization ⋮ Duple-EDA and sample density balancing ⋮ A survey for the quadratic assignment problem ⋮ Nonlinear optimization of constrained functions using tabu search ⋮ Metaheuristics: A bibliography ⋮ Modelling constant weight codes using tabu search ⋮ Optimal unit commitment decision with risk assessment using tabu search ⋮ A combined global and local search method to deal with constrained optimization for continuous tabu search ⋮ Tabu search for a class of single-machine scheduling problems ⋮ A tabu search Hooke and Jeeves algorithm for unconstrained optimization ⋮ Process plan selection based on product mix and production volume ⋮ Global optimization for artificial neural networks: A tabu search application ⋮ A correlation and heuristic approach for obtaining production sequences requiring a minimum of tool replacements

This page was built for publication: Tabu search and design optimization