By Topic

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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