694 research outputs found
An ESPC algorithm based approach to solve inventory deployment problem
Global competitiveness has enforced the hefty industries to become more customized. To compete in the market they are targeting the customers who want exotic products, and faster and reliable deliveries. Industries are exploring the option of satisfying a portion of their demand by converting strategically placed products, this helps in increasing the variability of product produced by them in short lead time. In this paper, authors have proposed a new hybrid evolutionary algorithm named Endosymbiotic-Psychoclonal (ESPC) algorithm to determine the amount and type of product to stock as a semi product in inventory. In the proposed work the ability of previously proposed Psychoclonal algorithm to exploit the search space has been increased by making antibodies and antigen more cooperative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results obtained, are compared with other evolutionary algorithms such as Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained, and convergence time required to reach the optimal /near optimal value of the solution
Stochastic make-to-stock inventory deployment problem: an endosymbiotic psychoclonal algorithm based approach
Integrated steel manufacturers (ISMs) have no specific product, they just produce finished product from the ore. This enhances the uncertainty prevailing in the ISM regarding the nature of the finished product and significant demand by customers. At present low cost mini-mills are giving firm competition to ISMs in terms of cost, and this has compelled the ISM industry to target customers who want exotic products and faster reliable deliveries. To meet this objective, ISMs are exploring the option of satisfying part of their demand by converting strategically placed products, this helps in increasing the variability of product produced by the ISM in a short lead time. In this paper the authors have proposed a new hybrid evolutionary algorithm named endosymbiotic-psychoclonal (ESPC) to decide what and how much to stock as a semi-product in inventory. In the proposed theory, the ability of previously proposed psychoclonal algorithms to exploit the search space has been increased by making antibodies and antigen more co-operative interacting species. The efficacy of the proposed algorithm has been tested on randomly generated datasets and the results compared with other evolutionary algorithms such as genetic algorithms (GA) and simulated annealing (SA). The comparison of ESPC with GA and SA proves the superiority of the proposed algorithm both in terms of quality of the solution obtained and convergence time required to reach the optimal/near optimal value of the solution
Traveling Salesman Problem
This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the TSP problem. It brings together researchers with applications in Artificial Immune Systems, Genetic Algorithms, Neural Networks and Differential Evolution Algorithm. Hybrid systems, like Fuzzy Maps, Chaotic Maps and Parallelized TSP are also presented. Most importantly, this book presents both theoretical as well as practical applications of TSP, which will be a vital tool for researchers and graduate entry students in the field of applied Mathematics, Computing Science and Engineering
Artificial Immune System for Solving Global Optimization Problems
In this paper, we present a novel model of an artificial immune system (AIS), based on the process that suffers the T-Cell. The proposed model is used for global optimization problems. The model operates on four populations: Virgins, Effectors (CD4 and CD8) and Memory. Each of them has a different role, representation and procedures. We validate our proposed approach with a set of test functions taken from the specialized literature, we also compare our results with the results obtained by different bio-inspired approaches and we statistically analyze the results gotten by our approach.Fil: Aragon, Victoria Soledad. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo En Inteligencia Computacional; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico San Luis; ArgentinaFil: Esquivel, Susana C.. Universidad Nacional de San Luis. Facultad de Ciencias Físico Matemáticas y Naturales. Departamento de Informática. Laboratorio Investigación y Desarrollo en Inteligencia Computacional; ArgentinaFil: Coello Coello, Carlos A.. CINVESTAV-IPN; Méxic
Review of Metaheuristics and Generalized Evolutionary Walk Algorithm
Metaheuristic algorithms are often nature-inspired, and they are becoming
very powerful in solving global optimization problems. More than a dozen of
major metaheuristic algorithms have been developed over the last three decades,
and there exist even more variants and hybrid of metaheuristics. This paper
intends to provide an overview of nature-inspired metaheuristic algorithms,
from a brief history to their applications. We try to analyze the main
components of these algorithms and how and why they works. Then, we intend to
provide a unified view of metaheuristics by proposing a generalized
evolutionary walk algorithm (GEWA). Finally, we discuss some of the important
open questions.Comment: 14 page
Artificial Immune System based on Hybrid and External Memory for Mathematical Function Optimization
Artificial immune system (AIS) is one of the natureinspired
algorithm for optimization problem. In AIS, clonal
selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy can be further improved because the hypermutation in CSA itself cannot always guarantee a better solution. Alternatively, Genetic Algorithms (GAs) and Particle Swarm Optimization (PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. Thus, a hybrid PSO-AIS and a new external memory CSA based scheme called EMCSA are proposed. In hybrid PSO-AIS, the good features of PSO and AIS are combined in order to reduce any limitation. Alternatively, EMCSA captures all the best antibodies into the memory in order to enhance global searching capability. In this preliminary study, the results show that the performance
of hybrid PSO-AIS compares favourably with other algorithms
while EMCSA produced moderate results in most of the simulations
Antibody Remainder Method Based Artificial Immune System for Mathematical Function Optimization
Artificial immune system (AIS) is one of the natureinspired
algorithm for solving optimization problem. In AIS, clonal selection algorithm (CSA) is able to improve global searching ability. However, the CSA convergence and accuracy
can be improved further because the hypermutation in CSA
itself cannot always guarantee a better solution. Alternatively,Genetic Algorithms (GAs) and Particle Swarm Optimization(PSO) have been used efficiently in solving complex optimization problems, but they have a tendency to converge prematurely. In this study, the CSA is modified using the best solution for each exposure (iteration) namely Single Best Remainder (SBR) CSA. In this study, the results show that the performance of the proposed algorithm (SBR-CSA) compares favourably with other algorithms while Half Best Insertion (HBI) CSA produced moderate results in most of the simulations
- …