A hybrid algorithm based on PSO and simulated annealing and its applications for partner selection in virtual enterprise

18Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Partner selection is a very popular problem in the research of virtual organization and supply chain management, the key step in the formation of virtual enterprise is the decision making on partner selection. In this paper, a activity network based multi-objective partner selection model is put forward. Then a new heuristic algorithm based on particle swarm optimization(PSO) and simulated annealing(SA) is proposed to solve the multi-objective problem. PSO employs a collaborative population-based search, which is inspired by the social behavior of bird flocking. It combines local search(by self experience) and global search(by neighboring experience), possessing high search efficiency. SA employs certain probability to avoid becoming trapped in a local optimum and the search process can be controlled by the cooling schedule. The hybrid algorithm combines the high speed of PSO with the powerful ability to avoid being trapped in local minimum of SA. We compare the hybrid algorithm to both the standard PSO and SA models, the simulation results show that the proposed model and algorithm are effective. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Zhao, F., Zhang, Q., Yu, D., Chen, X., & Yang, Y. (2005). A hybrid algorithm based on PSO and simulated annealing and its applications for partner selection in virtual enterprise. In Lecture Notes in Computer Science (Vol. 3644, pp. 380–389). Springer Verlag. https://doi.org/10.1007/11538059_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free