Abstract
This paper presents an investigation of two search techniques, tabu search (TS) and simulated annealing (SA), to assess their relative merits when applied to engineering design optimisation. Design optimisation problems are generally characterised as having multi-modal search spaces and discontinuities making global optimisation techniques beneficial. Both techniques claim to be capable of locating globally optimum solutions on a range of problems but this capability is derived from different underlying philosophies. While tabu search uses a semi-deterministic approach to escape local optima, simulated annealing uses a complete stochastic approach. The performance of each technique is investigated using a structural optimisation problem. These performances are then compared to each other as well as a steepest descent (SD) method.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Glover G and Laguna M, 1997. Tabu Search, Kluwer Academic Publishers
Kirkpatrick S, Gelatt Jr., C D, Vecchi M P, 1983. Optimization by simulated annealing, Science, 220: 4598: 671–679.
Connor A M, Tilley D G, 1998. A tabu search algorithm for the optimisation of fluid power circuits, Journal of Systems and Control212 (5): 373–381
Shea K, Cagan J, Fenves S J, 1997. A shape annealing approach to optimal truss design with dynamic grouping of members, ASME Journal of Mechanical Design, 119: 388–394.
Arostegui, M, Kadipasaoglu, S N, Khumawala, B M, 1998 Empirical evaluation of tabu search, simulated annealing, and genetic algorithms on facilities location problem, Annual Meeting of the Decision Sciences Institute, Vol. 3, pp. 1091
Pirlot M, 1996. General local search methods, European Journal of Operational Research, 92 (3): 493–511
Sinclair M, 1993. Comparison of the performance of modern heuristics for combinatorial optimization of real data, Computers in Operations Research, 20 (7): 687–695
Metropolis N, Rosenbluth A, Rosenbluth M, Teller A, Teller M, 1953. Equation of state calculations by fast computing machines, Journal of Chemical Physics, 21: 1087–1092.
Swartz W, Sechen C, 1990. New algorithms for the placement and routing of macro cells, Proceedings of the IEEE Conference on Computer-Aided Design, Santa Clara, CA, November 11–15, IEEE proceedings: Cat No. 90CH2924–9, pp. 336–339.
Hustin S. (1988), “Tun, a new standard cell placement program based on the simulated annealing algorithm,” Master of Science, University of California, Berkeley, Department of Electrical Engineering and Computer Science.
Ochotta E S, 1994. Synthesis of high-performance analog cells in ASTRX/OBLX. Ph.D. Thesis, Carnegie Mellon University.
Shea K, Cagan J, 1998. Topology Design of Truss Structures by Shape annealing, Proceedings of DETC98: 1998 ASME Design Engineering Technical Conferences, September 1998, Atlanta, GA, DETC98/DAC-5624.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag London
About this paper
Cite this paper
Connor, A.M., Shea, K. (2000). A Comparison of Semi-deterministic and Stochastic Search Techniques. In: Parmee, I.C. (eds) Evolutionary Design and Manufacture. Springer, London. https://doi.org/10.1007/978-1-4471-0519-0_23
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0519-0_23
Publisher Name: Springer, London
Print ISBN: 978-1-85233-300-3
Online ISBN: 978-1-4471-0519-0
eBook Packages: Springer Book Archive