We describe a strategy for optimizing bi-objective combinatorial problems. Initially, we design and implement a metaheuristic of complexity O(n^4 ) for optimizing combinatorial problems. This metaheuristic is appointing Metaheuristic Deterministic Interchange on Automata with Simulated Annealing (MIDRS - Metaheurística de Intercambio Determinista sobre Autómatas con Recocido Simulado). MIDRS based its strategy on the theory of Deterministic Finite Automata Multi – Objective. Subsequently, we analyzed the behavior of the technique by varying the weight ratio between the objective functions. Finally, MIDRS is contrasted with high-impact global metaheuristic such as, algorithms based on Ant Colony, Evolutionary Techniques and Strategies Local Search.
http://www.asme.org/products/books/international-conference-on-computer-and-computati
No hay comentarios:
Publicar un comentario