DocumentCode
2583783
Title
Genetic-binary combinatorial algorithm for 0-1 integer programming
Author
Yusong, Yan
Author_Institution
Sch. of Traffic & Transp., Southwest Jiaotong Univ., Sichuan, China
fYear
2000
fDate
2000
Firstpage
205
Lastpage
209
Abstract
Based on the analysis of a combinatorial algorithm of integer programming and a genetic algorithm, an improved algorithm will be found called a genetic-binary combinatorial algorithm. The key method of the genetic-binary combinatorial algorithm that is called the change-zero and add-one method is also introduced. An example is also given to demonstrate the correction of the new algorithm
Keywords
combinatorial mathematics; genetic algorithms; integer programming; 0-1 integer programming; change-zero and add-one method; genetic-binary combinatorial algorithm; Algorithm design and analysis; Finishing; Genetic algorithms; Heuristic algorithms; Linear programming; Sun;
fLanguage
English
Publisher
ieee
Conference_Titel
Autonomous Decentralized Systems, 2000. Proceedings. 2000 International Workshop on
Conference_Location
Chengdu
Print_ISBN
0-7803-6575-5
Type
conf
DOI
10.1109/IWADS.2000.880908
Filename
880908
Link To Document