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

Genetic-combinatorial algorithm of 0-1 programming

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

1 Author(s)
Yan Yusong ; Coll. of Traffic & Transp., Southwest Jiaotong Univ., Chengdu, China

Based on the analysis of research progresses on combinatorial algorithm for integer programming, the binary-combinatorial algorithm and the genetic algorithm (GA) are discussed. The improving genetic algorithm including the selection of fitness function, the improving of selection operator, the improving of crossover and mutation operator etc. is pointed out. The genetic-combinatorial algorithm including the basic algorithm thought and the basic processing steps is presented at last, which can be used to solve a kind of 0-1 programming efficiently.

Published in:

Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on

Date of Conference:

27-29 Aug. 2003

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.