Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer and Computer Intelligence (ICCCI 2011)

Yi Xie
Yi Xie
Search for other works by this author on:
No. of Pages:
ASME Press
Publication date:

In this paper we state a novel metaheuristic based on Deterministic Finite Automaton (DFA) for the multi-objective optimization of combinatorial problems. First, we propose a new DFA based on Swapping (DFAS). DFAS allows the representation of feasible solutions space of combinatorial problems. Last, we define an algorithm that works with DFAS, it is named Exchange Deterministic Algorithm (EDA). EDA has three steps. The first step consists in create the initial solutions, the second step improves the initial solutions and the last step uses transitions between the states of the DFAS for improving the solutions. EDA was tested using well known...

Key Words
1 Introduction
2. Deterministic Finite Automata
3 Deterministic Finite Automaton of Swapping
4. EDA Metaheuristic
5. Experimental Settings
6. Results and Discussions
6. Summaries
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal