Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems

Salhi, Abdellah; Proll, L. G.; Insua, David Rı́os; Martín, Jorge

doi:10.1051/ro:2000110

Cited by 6 publications

(4 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Strawberry algorithm is an exemplar PPA which can be seen as a multipath following algorithm unlike Simulated Annealing (SA) [13,25], for instance, which is a single path following algorithm. It can, therefore, be perceived as a generalisation of SA and other path-following algorithms [26].…”

Section: The Strawberry Algorithm As Ppamentioning

confidence: 99%

“…In the exact category, one can name Branch-and-Bound, [7], Recursive Quadratic Programming, [8], the Cutting Plane Algorithm [9], Bender's decomposition [10]. Of the approximate variety, one can name Simulated Annealing, [11][12][13], the Genetic Algorithm [14][15][16], and the Particle Swarm Optimisation algorithm, [17,18], to name a few. The latter category is often referred to as the metaheuristic algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems

Sulaiman

Salhi

Selamoğlu

et al. 2014

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

Optimisation problems arising in industry are some of the hardest, often because of the tight specifications of the products involved. They are almost invariably constrained and they involve highly nonlinear, and non-convex functions both in the objective and in the constraints. It is also often the case that the solutions required must be of high quality and obtained in realistic times. Although there are already a number of well performing optimisation algorithms for such problems, here we consider the novel Plant Propagation Algorithm (PPA) which on continuous problems seems to be very competitive. It is presented in a modified form to handle a selection of problems of interest. Comparative results obtained with PPA and state-of-the-art optimisation algorithms of the Nature-inspired type are presented and discussed. On this selection of problems, PPA is found to be as good as and in some cases superior to these algorithms.

show abstract

Section: The Strawberry Algorithm As Ppamentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems

Sulaiman

Salhi

Selamoğlu

et al. 2014

Mathematical Problems in Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…It is doubtful if currently available algorithms satisfy this requirement for problems of the size we need to solve, and in the context in which many of our applications need to be tackled. However, we have developed a simulated annealing method (Salhi et al, 2000) which has successfully solved problems occurring in the linear and bilinear models. Its success arises from exploiting the structure of the problem constraints to ensure that random neighbours of the current point are always feasible.…”

Section: Global Optimization and Reformulationmentioning

confidence: 99%

Improving an optimization‐based framework for sensitivity analysis in multi‐criteria decision‐making

Proll

Salhi

Insua

2001

Multi Criteria Decision Anal

Self Cite

View full text Add to dashboard Cite

The framework for sensitivity analysis in discrete multi‐criteria decision analysis developed by Rios Insua and French allows simultaneous variation of all parameters and applies to many paradigms for decision analysis. However, its computational load may inhibit use, particularly in the context of a decision conference where results are required in near real time. In order to improve on the current algorithm and its implementation, we investigate, on the one hand, an opportunistic approach aimed at reducing the number of optimization problems solved in the original framework and, on the other, an alternative framework based on distance analysis. Computational results on linear and bilinear models are reported. Copyright © 2001 John Wiley & Sons, Ltd.

show abstract

“…Record the best food source found so far. 7: end while algorithm unlike Simulated Annealing (SA) [1,14,15], for instance, which is a single path following algorithm.…”

mentioning

confidence: 99%

The Plant Propagation Algorithm: Modifications and Implementation

Sulaiman,

Salhi,

Fraga

2014

Preprint

Self Cite

View full text Add to dashboard Cite

The Plant Propagation Algorithm, epitomised by the Strawberry Algorithm, has been previously successfully tested on low dimensional continuous optimisation problems. It is a neighbourhood search algorithm. In this paper, we introduce, robust and efficient version of the algorithm and explain how it can be implemented to compete with one of the best available alternatives, namely the Artificial Bee Colony algorithm and we present an improved and more effective variant on standard continuous optimisation test problem instances in high dimensions. Computational and comparative results are included.

show abstract

Expériences with Stochastic Algorithms fir a class of Constrained Global Optimisation Problems

Cited by 6 publications

References 0 publications

A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems

A Plant Propagation Algorithm for Constrained Engineering Optimisation Problems

Improving an optimization‐based framework for sensitivity analysis in multi‐criteria decision‐making

The Plant Propagation Algorithm: Modifications and Implementation

Contact Info

Product

Resources

About