Genetic-combinatorial algorithm of 0-1 programming

Author

Yusong, Yan

Author_Institution

Coll. of Traffic & Transp., Southwest Jiaotong Univ., Chengdu, China

fYear

2003

fDate

27-29 Aug. 2003

Firstpage

698

Lastpage

701

Abstract

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.

Keywords

combinatorial mathematics; genetic algorithms; integer programming; 0-1 programming; binary-combinatorial algorithm; crossover operator; fitness function selection; genetic algorithm; genetic-combinatorial algorithm; integer programming; mutation operator; Algorithm design and analysis; Educational institutions; Functional programming; Genetic algorithms; Genetic mutations; Heuristic algorithms; Linear programming; Mathematical programming; Optimal control; Transportation;

fLanguage

English

Publisher

ieee

Conference_Titel

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

Print_ISBN

0-7803-7840-7

Type

conf

DOI

10.1109/PDCAT.2003.1236394

Filename

1236394