Abstract
The tightness of bounds is very important factor of efficiency of branch and bound based global optimization algorithms. An experimental model of interval arithmetic with controllable tightness of bounds is proposed to investigate the impact of bounds tightening in interval global optimization. A parallel version of the algorithm is implemented to cope with the computational intensity of the experiment. The experimental results on efficiency of tightening bounds are presented for several test and practical problems. The suitability of mater-slave type parallelization to speed up the experiments is justified. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Žilinskas, A., & Žilinskas, J. (2006). On efficiency of tightening bounds in interval global optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3732 LNCS, pp. 197–205). Springer Verlag. https://doi.org/10.1007/11558958_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
