This paper presents a new algorithm for solving large scale global optimization problems based on hybridization of simulated annealing and Nelder-Mead algorithm. The new algorithm is called simulated Nelder-Mead algorithm with random variables updating (SNMRVU). SNMRVU starts with an initial solution, which is generated randomly and then the solution is divided into partitions. The neighborhood...

The term ‘supply chain management’ has become common in the business world, which can be understood from the positive results of research in the area, particularly in supply chain optimization. Transportation is a frontier in achieving the objectives of the supply chain. Thrust is also given to optimization problems in transportation. The fixed-charge transportation problem is an extension of t...

A hybrid Retinex-based image enhancement algorithm is proposed to improve the quality of images captured by unmanned aerial vehicles (UAVs) in this paper. Hyperparameters employed multi-scale Retinex with chromaticity preservation (MSRCP) model are automatically tuned via a two-phase evolutionary computing algorithm. In optimization algorithm, Rao-2 applied performing global search and solution...

The active appearance models (AAM) are robust in face alignment. We use this method to analyze gesture and motions of faces in Human Machine Interfaces (HMI) for embedded systems (mobile phone, game console, PDA: Personal Digital Assistant). However these models are not only high memory consumer but also efficient especially when the aligning objects in the learning data base, which generate mo...

KINGSLEY, M. C. S. 1979. Fitting the von Bertalanffy growth equation to polar bear age-weight data. Can. J. Zool. 57: 1020-1025. Heavy sea ice in the Canadian Arctic in the winter of 19731974 reduced seal populations; polar bears, preying principally on seals, consequently lost weight. The nature and degree of this weight loss was investigated by examining the parameters of von Bertalanffy grow...

Ant colony algorithms are a class of metaheuristics which are inspired from the behaviour of real ants. The original idea consisted in simulating the stigmergic communication, therefore these algorithms are considered as a form of adaptive memory programming. A new formalization was proposed for the design of ant colony algorithms, introducing the biological notions of heterarchy and communicat...

The Nelder-Mead algorithm can stagnate and converge to a non-optimal point, even for very simple problems. In this note we propose a test for sufficient decrease which, if passed for the entire iteration, will guarantee convergence of the Nelder-Mead iteration to a stationary point if the objective function is smooth. Failure of this condition is an indicator of potential stagnation. As a remed...