Title :
A Binary Ant Algorithm for Partner Selection Problem in the Virtual Enterprise
Author_Institution :
Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan
Abstract :
The formation of a Virtual Enterprise and the selection of its partners is an important process in the lifecycle of a Virtual Enterprise. This paper employs a binary coded ant colony optimization (ACO) algorithm for the partner selection optimization. At first, an optimization model is presented, which includes the main crucial factors for partner selection, such as running cost, reaction time and failure risk. ACO is then presented for the solution. Then a typical example is used to illustrate the effectiveness of the algorithm. Simulation results demonstrate that the proposed optimization model and method provides a reference to partner selection in the practical VE operation.
Keywords :
optimisation; virtual enterprises; binary ant algorithm; binary coded ant colony optimization; failure risk; optimization model; partner selection optimization; partner selection problem; reaction time; running cost; virtual enterprise; Analytical models; Ant colony optimization; Collaborative work; Computer networks; Computer science; Cost function; Data envelopment analysis; Encoding; Particle swarm optimization; Virtual enterprises;
Conference_Titel :
E-Business and Information System Security, 2009. EBISS '09. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-2909-7
Electronic_ISBN :
978-1-4244-2910-3
DOI :
10.1109/EBISS.2009.5137863
