Skip Navigation

The Computer Journal 1977 20(4):367-370; doi:10.1093/comjnl/20.4.367
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (42)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Price, W. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A controlled random search procedure for global optimisation

W. L. Price *

Department of Engineering, The University, Leicester, UK

A new random search procedure is described which, while conceptually simple and easily programmed on a minicomputer, is effective in searching for global minima of a multimodal function, with or without constraints. The procedure is compared with a global optimisation algorithm devised by Becker and Lago and the results of trials, using a variety of test problems, are given.

Received February 1976.

* Department of Engineering, The University, Leicester LE1 7RH


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.