zbMATH — the first resource for mathematics

Fitting of tabu search to optimize functions of continuous variables. (English) Zbl 0882.65049
The tabu search is considered, which is a stochastic global optimization procedure to solve combinatorial optimization problems. In the given paper, the authors present an adaptation of the tabu search to continuous optimization. The given algorithm is tested through several functions of which local and global mimima are known.

65K05 Numerical mathematical programming methods
90C27 Combinatorial optimization
90C15 Stochastic programming
Full Text: DOI
[1] Glover, Dec. Sci. 8 pp 156– (1977)
[2] Glover, Comput. Oper. Res. 13 pp 533– (1986) · Zbl 0615.90083
[3] Hertz, OR Spektrum 11 pp 131– (1989) · Zbl 0672.90089
[4] and , ’Tabu Search’, in (ed.), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, Oxford, 1993, pp. 70-150.
[5] Dubois, Comput. Math. Appl. 25 pp 35– (1993) · Zbl 0798.68128
[6] Skorin-Kapov, ORSA J. Comput. 2 pp 33– (1990) · Zbl 0752.90054
[7] Bland, IEEE Trans. C.A.D. 23 pp 195– (1991)
[8] and , ’Scheduling algorithm in data path synthesis using the Tabu Search technique’, IEEE Proc. EDAC-EUROASIC’93 Conf., Paris, 1993, pp. 398-402.
[9] Hu, Int. j. numer. methods eng. 35 pp 1055– (1992)
[10] and (eds.), Towards Global Optimization 2, North-Holland, Amsterdam, 1978.
[11] and , ’More test examples for nonlinear programming codes’, Lecture Notes in Economics and Mathematical Systems, Vol. 282, Springer, Berlin, 1987. · Zbl 0658.90060
[12] Berthiau, Adv. Eng. Software 18 pp 171– (1993)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.