Partners Selection for Dynamic Alliance Based on Chaotic Search

Author

Liu, He ; Huang, Meng

Author_Institution

Coll. of Inf. Sci. & Eng., East China Univ. of Sci. & Technol., Shanghai

Volume

2

fYear

0

fDate

0-0 0

Firstpage

6818

Lastpage

6821

Abstract

The selection of appropriate partners has decisive influence on the success of a dynamic alliance, therefore it is one of the key issues to create a dynamic alliance. In this paper, chaotic search is applied in the selection process of cooperative partners. A method based on chaotic search is proposed to solve this complex multi-object combinatorial optimization problem. Through the searching process with decreasing disturbances, local optima can be effectively avoided. The mapping of chaotic variables into optimized ones is designed and the detailed algorithm is described. Finally, results of a typical simulation show the simplicity and high efficiency of this method

Keywords

chaos; combinatorial mathematics; optimisation; production management; search problems; chaotic search; complex multiobject combinatorial optimization; dynamic alliance; partners selection; Algorithm design and analysis; Appropriate technology; Chaos; Data envelopment analysis; Design optimization; Educational institutions; Electronic mail; Helium; Information science; Optimization methods; chaotic search; dynamic alliance; partners selection;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2006. WCICA 2006. The Sixth World Congress on

Conference_Location

Dalian

Print_ISBN

1-4244-0332-4

Type

conf

DOI

10.1109/WCICA.2006.1714405

Filename

1714405