Serviços Personalizados
Journal
Artigo
Indicadores
- Citado por SciELO
- Acessos
Links relacionados
- Citado por Google
- Similares em SciELO
- Similares em Google
Compartilhar
Ingeniería y Desarrollo
versão impressa ISSN 0122-3461versão On-line ISSN 2145-9371
Resumo
NINO, Elías D e ARDILA, Carlos J. Algorithm based on finite automata for obtaining global optimum combinatorial problems. Ing. Desarro. [online]. 2009, n.25, pp.99-114. ISSN 0122-3461.
This article states a Deterministic Finite Automaton of Exchange (DFA - E). It allows modeling of the space of feasible solutions to combinatorial problems, specifically, the problems associated with the order of elements. With the structure DFA - E defined, we designed and implemented an algorithm that uses it for obtaining a global solution of combinatorial problems. The problem we treat here can be extrapolated to any of the following: an allocation of n processes machines working in parallel, selecting the optimal route in the traveling salesman problem (TSP) and the problem of Bin Packing.
Palavras-chave : automaton; graph; combinatorial optimization; global optimum.