By Topic

Stochastic dependent-chance programming model and hybrid adaptive genetic algorithm for vendor selection problem

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
$33 $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

3 Author(s)
Baohua Wang ; College of Traffic and Transportation, Beijing Jiaotong University, China ; Shiwei He ; Sohail S. Chaudhry

This paper proposes a stochastic dependent-chance programming model for vendor selection problem under the condition that the capacity, quality level, service level and lead time of each vendor are considered to be stochastic. Since stochastic programming is hard to solve by traditional methods, a hybrid adaptive genetic algorithm, which embeds the neutral network and stochastic simulation, is presented. To improve the performance of the algorithm, the probability of crossover and mutation will be adjusted according to the stage of evolution and fitness of the population. The solution procedure is tested on several randomly generated problems with varying parameters. The experimental results demonstrate that the hybrid adaptive genetic algorithm has strong adaptability.

Published in:

Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on  (Volume:2 )

Date of Conference:

12-15 Oct. 2008