This paper proposes two modifications to the geometrically deformable template model. First, the optimization stage originally based on simulated annealing is replaced with a meta-heuristic called Variable Neighborhood Search that treats simulated annealing as a local search tool. Second, an affine deformation energy is introduced to improve the quality of the search. An example of optic disc s...

In this paper we consider a simplified version of the stock cutting (two-dimensional bin packing) problem. We compare three meta-heuristic algorithms (genetic algorithm (GA), tabu search (TS) and simulated annealing (SA)) when applied to this problem. The results show that tabu search and simulated annealing produce good quality results. This is not the case with the genetic algorithm. The prob...

Extensive research has been devoted to economic production quantity (EPQ) problem. However, little atten-tion has been paid to problems where depreciation cost and process quality cost must be considered, simulta-neously. In this paper, we consider the economic production quantity model of minimizing the annual total cost subject to depreciation cost and process quality cost, where depreciation...

mutual information (mi) is a widely used similarity metric for multimodality image registration. however, it involves an extremely high computational time especially when it is applied to volume images. moreover, its robustness is affected by existence of local maxima. the multi-resolution pyramid approaches have been proposed to speed up the registration process and increase the accuracy of th...

Fuzzy Cognitive Maps (FCMs) have successfully been applied in numerous domains to show the relations between essential components in complex systems. In this paper, a novel learning method is proposed to construct FCMs based on historical data and by using meta-heuristic: Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS). Implementation of the proposed method has demonstrat...

We present a state-of-the-art survey of parallel meta-heuristic developments and results, discuss general design and implementation principles that apply to most meta-heuristic classes, instantiate these principles for the three meta-heuristic classes currently most extensively used—genetic methods, simulated annealing, and tabu search, and identify a number of trends and promising research dir...

This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...

This paper presents two meta-heuristic algorithms to solve an extended portfolio selection model. The extended model is based on the Markowitz's Model, aiming to minimize investment risk in a specified level of return. In order to get the Markowitz model close to the real conditions, different constraints were embedded on the model which resulted in a discrete and non-convex solution space. ...

The purpose of this article is to review the literature on the topic of deterministic vehicle routing problem (VRP) and to give a review on the exact and approximate solution techniques. More specifically the approximate (meta-heuristic) solution techniques are classified into: tabu search, simulated annealing, genetic algorithm, evolutionary algorithm, hybrid algorithm, and Ant Colony Opti...