Cart (Loading....) | Create Account
Close category search window
 

Multi-objective Optimization in Partner Selection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Xuesen Ma ; Hefei Univ. of Technol., Hefei ; Jianghong Han ; Zhengfeng Hou ; Zhenchun Wei

It is a typical multi-objective optimization problem for the scientific decision of bidding to seek cooperating partner in virtual enterprise. With the optimization model proposed, partner selection is solved by the improved genetic algorithm. In the evolution process, individual survive rate is dynamic according to queue of individuals 'fitness values before roulette wheel selection, avoiding premature convergence. Crossover and mutation operators are accordingly adaptive to fitness value and iterative degree, which endows individuals with self- adaptability with the variation of the environment. Finally, the example demonstrates the validity of the adaptive genetic algorithm.

Published in:

Natural Computation, 2007. ICNC 2007. Third International Conference on  (Volume:4 )

Date of Conference:

24-27 Aug. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.