This paper proposes a novel method of global optimization based on cuckoo-host co-evaluation. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 96 benchmark functions (of which the results of 30 relatively harder problems have been reported). The proposed...

Rank-ordering of individuals or objects on multiple criteria has many important practical applications. A reasonably representative composite rank ordering of multi-attribute objects/individuals or multi-dimensional points is often obtained by the Principal Component Analysis, although much...

In the economics of joint production one often distinguishes between the two cases: the one in which a firm produces multiple products each produced under separate production process, and the other "true joint production" where a number of outputs are produced from a single production process,...

Keane's bump function is considered as a standard benchmark for nonlinear constrained optimization. It is highly multi-modal and its optimum is located at the non-linear constrained boundary. The true minimum of this function is, perhaps, unknown. We intend in this paper to optimize Keane's...

In this paper we compare the performance of the Barter method, a newly introduced population-based (stochastic) heuristic to search the global optimum of a (continuous) multi-modal function, with that of two other well-established and very powerful methods, namely, the Simulated Annealing (SA)...

The objective of this paper is to introduce a new population-based (stochastic) heuristic to search the global optimum of a (continuous) multi-modal function and to assess its performance (on a fairly large number of benchmark functions) vis-a-vis that of two other well-established and very...

The Repulsive Particle Swarm (RPS) method of global optimization is perhaps the simplest to understand and implement. Due to its simplicity, it can be easily modified to suit the purpose and therefore, it has better prospects as well. The method has been frequently used in the field of...

Programs that work very well in optimizing convex functions very often perform poorly when the problem has multiple local minima or maxima. They are often caught or trapped in the local minima/maxima. Several methods have been developed to escape from being caught in such local optima. The...

In this paper an attempt has been made to fit the Gielis curves (modified by various functions) to simulated data. The estimation has been done by two methods - the Classical Simulated Annealing (CSA) and the Particle Swarm (PS) methods - of global optimization. The Repulsive Particle Swarm...

Pena's method of construction of a synthetic indicator is very sensitive to the order in which the constituent variables (whose linear aggregation yields the synthetic indicator) are arranged. Due to this, Pena's method can at present give only an arbitrary synthetic indicator whose...