Abstract
In this paper the box constrained global optimization problem in presence of a limited solution time is considered. A method is studied based on a combination of multistart and singlestart which implies a decision sequence on the number of random points to be generated. Search strategies are numerically illustrated. Criteria are introduced to measure the performance of solution methods for the problem class. Moreover, the performance of search strategies, specifically the efficiency of generating random points is analyzed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
BetroB. and SchoenF. (1987), Sequential Stopping Rules for the Multistart Algorthm in Global Optimization,Mathematical Programming 38, 271–286.
BoenderC.G.E. and Rinnooy KanA.H.G. (1987), Bayasian Stopping Rules for Multistart Global Optimization Methods,Mathematical Programming 37, 59–80.
BohachevskyI.O., JohnsonM.E., and SteinM.L. (1986), Generalized Simulated Annealing for Function Optimization,Technometrics 28, 209–217.
Brazil, L.E. and Krajevski, W.F. (1987), Optimization of Complex Hydrologic Models Using Random Search Methods, inEngineering Hydrology Proceedings, Williamsburg, ASCE, 726–731.
KlepperO. and HendrixE.M.T. (1994), A Method for Robust Calibration of Ecological Models under Different Types of Uncertainty,Ecological Modelling 74, 161–182.
PowellM.J.D. (1964), An Efficient Method for Finding the Minimum of a Function of Several Variables without Calculating Derivatives,The Computer Journal 7, 155–162.
PronzatoL., WalterE., VenotA., and LebruchecJ.F. (1984), A General Purpose Global Optimizer: Implementation and Applications,Mathematics and Computers in Simulation 24, 412–422.
Romeijn, H.E. (1992), Global Optimization by Random Walk Sampling Methods, PhD dissertation, Erasmus University Rotterdam.
TörnA. and ZilinskasA. (1989),Global Optimization, Springer, Berlin.
ZabinskyZ.B. and SmithR.L. (1992), Pure Adaptive Search in Global Optimization,Mathematical Programming 53, 323–338.
ZhigljavskyA.A. (editor J.Pintér) (1991),Theory of Global Random Search, Kluwer, Dordrecht.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hendrix, E.M.T., Roosma, J. Global optimization with a limited solution time. J Glob Optim 8, 413–427 (1996). https://doi.org/10.1007/BF00554016
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00554016