Facility layout selection is a multi-criteria decision-making (MCDM) problem which primarily involves in evaluating multiple candidate layouts, designed according to a set of common criteria for choosing the best one. Designing multiple facility layouts is an easy task, thank to availability of different facility layout design software. However, the decision of selecting the best layout becomes...

Multiple sequence alignment has been a useful method in the study of molecular evolution and sequence-structure relationships. This paper presents a new method for multiple sequence alignment based on simulated annealing technique. Dynamic programming has been widely used to find an optimal alignment. However, dynamic programming has several limitations to obtain optimal alignment. It requires ...

Selection is an essential component of evolutionary algorithms, playing an important role especially in solving hard optimization problems. Most previous studies on selection have focused on more or less ideal properties based on asymptotic analysis. In this paper, we address the selection problem from a more practical point of view by considering solution quality achievable within acceptable t...

assigning facilities to locations is one of the important problems, which significantly is influence in transportation cost reduction. in this study, we solve quadratic assignment problem (qap), using a meta-heuristic algorithm with deterministic tasks and equality in facilities and location number. it should be noted that any facility must be assign to only one location. in this paper, first o...

An appropriate combination of multiple biometric sensors increases the reliability of verification through biometrics. In this paper we propose an effective method of fusion of biometrics based on a dynamic selection of threshold point of fingerprint and iris biometrics towards identifier of an optimal set of rules for fusion. The effectiveness of the method has been established using several b...

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and particle swarm optim...

In this paper, we propose a novel chaotic neural network embedded with stochastic simulated annealing noise and a heuristic mechanism to solve minimum vertex cover problem. The proposed network can make a global search with the affection of stochastic noise and obtain a chaotic search by the chaotic dynamics. The stochastic noise with simulated annealing is able to find a global optimum solutio...