Volume 34, Number 2, April June 2000
|Page(s)||183 - 197|
|Published online||15 August 2002|
Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems
Department of Mathematics,
University of Essex,Wivenhoe Park, Colchester CO4 3SQ, U.K.
2 Scheduling and Constraint Management Group, School of Computer Studies, University of Leeds, Leeds LS2 9JT, U.K.
3 Dipartimento de Inteligencia Artificial, Universidad Politecnica de Madrid, 28660-Madrid, Spain.
The solution of a variety of classes of global optimisation problems is required in the implementation of a framework for sensitivity analysis in multicriteria decision analysis. These problems have linear constraints, some of which have a particular structure, and a variety of objective functions, which may be smooth or non-smooth. The context in which they arise implies a need for a single, robust solution method. The literature contains few experimental results relevant to such a need. We report on our experience with the implementation of three stochastic algorithms for global optimisation: the multi-level single linkage algorithm, the topographical algorithm and the simulated annealing algorithm. Issues relating to their implementation and use to solve practical problems are discussed. Computational results suggest that, for the class of problems considered, simulated annealing performs well.
Key words: Global optimisation / stochastic methods / constraints / multistart / simulated annealing.
© EDP Sciences, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.