THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

The Design and Analysis of Experiments

Swarm intelligence (SI) is briefly defined as the collective behaviour of decentralized and self-organized swarms. The well known examples for these swarms are bird flocks, fish schools and the colony of social insects such as termites, ants and bees. In 1990s, especially two approaches based on ant colony and on fish schooling/bird flocking introduced have highly attracted the interest of researchers. Although the self-organization features are required by SI are strongly and clearly seen in honey bee colonies, unfortunately the researchers have recently started to be interested in the behaviour of these swarm systems to describe new intelligent approaches, especially from the beginning of 2000s. During a decade, several algorithms have been developed depending on different intelligent behaviours of honey bee swarms. Among those, artificial bee colony (ABC) is the one which has been most widely studied on and applied to solve the real world problems, so far. Day by day the number of researchers being interested in ABC algorithm increases rapidly. This work presents a comprehensive survey of the advances with ABC and its applications. It is hoped that this survey would be very beneficial for the researchers studying on SI, particularly ABC algorithm.

A comprehensive survey: artificial bee colony (ABC) algorithm and applications

Multi-Criteria Decision Aid (MCDA) or Multi-Criteria Decision Making (MCDM) methods have received much attention from researchers and practitioners in evaluating, assessing and ranking alternatives across diverse industries. Among numerous MCDA/MCDM methods developed to solve real-world decision problems, the Technique for Order Preference by Similarity to Ideal Solution (TOPSIS) continues to work satisfactorily across different application areas. In this paper, we conduct a state-of-the-art literature survey to taxonomize the research on TOPSIS applications and methodologies. The classification scheme for this review contains 266 scholarly papers from 103 journals since the year 2000, separated into nine application areas: (1) Supply Chain Management and Logistics, (2) Design, Engineering and Manufacturing Systems, (3) Business and Marketing Management, (4) Health, Safety and Environment Management, (5) Human Resources Management, (6) Energy Management, (7) Chemical Engineering, (8) Water Resources Management and (9) Other topics. Scholarly papers in the TOPSIS discipline are further interpreted based on (1) publication year, (2) publication journal, (3) authors' nationality and (4) other methods combined or compared with TOPSIS. We end our review paper with recommendations for future research in TOPSIS decision-making that is both forward-looking and practically oriented. This paper provides useful insights into the TOPSIS method and suggests a framework for future attempts in this area for academic researchers and practitioners.

Review: A state-of the-art survey of TOPSIS applications

A simple yet powerful optimization algorithm is proposed in this paper for solving the constrained and unconstrained optimization problems. This algorithm is based on the concept that the solution obtained for a given problem should move towards the best solution and should avoid the worst solution. This algorithm requires only the common control parameters and does not require any algorithm-specific control parameters. The performance of the proposed algorithm is investigated by implementing it on 24 constrained benchmark functions having different characteristics given in Congress on Evolutionary Computation (CEC 2006) and the performance is compared with that of other well-known optimization algorithms. The results have proved the better effectiveness of the proposed algorithm. Furthermore, the statistical analysis of the experimental work has been carried out by conducting the Friedman’s rank test and Holm-Sidak test. The proposed algorithm is found to secure first rank for the ‘best’ and ‘mean’ solutions in the Friedman’s rank test for all the 24 constrained benchmark problems. In addition to solving the constrained benchmark problems, the algorithm is also investigated on 30 unconstrained benchmark problems taken from the literature and the performance of the algorithm is found better.

/pdf/jaya-a-simple-and-new-optimization-algorithm-for-solving-1ei3v5u718.pdf

R. Venkata Rao

Papers

Decision Making in Manufacturing Environment Using Graph Theory and Fuzzy Multiple Attribute Decision Making Methods

An improved teaching-learning-based optimization algorithm for solving unconstrained optimization problems

Multi-objective optimization of heat exchangers using a modified teaching-learning-based optimization algorithm

Parameter optimization of modern machining processes using teaching-learning-based optimization algorithm

A decision making methodology for material selection using an improved compromise ranking method