Evolutionary Algorithms Based on the Automata Theory for the Multi-Objective Optimization of Combinatorial Problems

In this paper, we propose a novel framework for the parallel solution of combinatorial problems based on MODS theory (PARMODS) This framework makes use of metaheuristics based on the Deterministic Swapping (MODS) theory. These approaches represents the feasible solution space of any combinatorial problem through a Deterministic Finite Automata. Some of those methods are the Metaheuristic Of Deterministic Swapping (MODS), the Simulated Annealing Deterministic Swapping (SAMODS), the Simulated Annealing Genetic Swapping (SAGAMODS) and the Evolutionary Deterministic Swapping (EMODS) Those approaches have been utilized in different contexts such as data base optimization, operational research [1-3, 8] and multi-objective optimization. The main idea of this framework is to exploit parallel computation in order to obtain a general view of the feasible solution space of any combinatorial optimization problem. This is, all the MODS methods are used in a unique general optimization process. In parallel, each instance of MODS explores a different region of the solution space. This allows us to explore distant regions of the feasible solution which could not be explored making use of classical (sequential) MODS implementations. Some experiments are performed making use of well-known TSP instances. Partial results shows that PARMODS provides better solutions than sequential MODS based implementations.

show abstract

A survey on some possibilities for applications of genetic algorithms in the automata theory

Bogdanović¹

2016

God Uci Fak Vranje

View full text Add to dashboard Cite

One thing is for sure -the origin of life today, nature is very well aware of what's he is doing. Genetic algorithms (GA) are a family of algorithms that use some kind of genetic principles that are present in nature, in order to solve specific computational problems. Genetic algorithms are robust and adaptive methods in addition to other fields of application can be used for solving combinatorial optimization problems. The reason is that genetic algorithms can be relatively easily adapted to the specific problem. Automata have already been constructed by evolutional techniques in 60's of last century by Fogel. He created an "evolutional programming" that was the first attempt to construct an automaton by evolutionary approach. The aim of this paper was to further demonstrate the possibility of application of GA in the Automata theory.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Evolutionary Algorithms Based on the Automata Theory for the Multi-Objective Optimization of Combinatorial Problems

Cited by 3 publications

References 71 publications

A Novel, Evolutionary, Simulated Annealing inspired Algorithm for the Multi-Objective Optimization of Combinatorial Problems

A Novel, Evolutionary, Simulated Annealing inspired Algorithm for the Multi-Objective Optimization of Combinatorial Problems

PARMODS: A Parallel Framework for MODS Metaheuristics

A survey on some possibilities for applications of genetic algorithms in the automata theory

Contact Info

Product

Resources

About