0-1整数规划的遗传-二进制组合算法

Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449) Pub Date : 2000-09-21 DOI:10.1109/IWADS.2000.880908

Yan Yusong

{"title":"0-1整数规划的遗传-二进制组合算法","authors":"Yan Yusong","doi":"10.1109/IWADS.2000.880908","DOIUrl":null,"url":null,"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.","PeriodicalId":248775,"journal":{"name":"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Genetic-binary combinatorial algorithm for 0-1 integer programming\",\"authors\":\"Yan Yusong\",\"doi\":\"10.1109/IWADS.2000.880908\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":248775,\"journal\":{\"name\":\"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWADS.2000.880908\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWADS.2000.880908","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在对整数规划组合算法和遗传算法进行分析的基础上，提出了一种改进算法——遗传-二进制组合算法。介绍了遗传二进制组合算法的关键方法——变零加一法。最后通过实例验证了新算法的正确性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Genetic-binary combinatorial algorithm for 0-1 integer programming

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings 2000 International Workshop on Autonomous Decentralized System (Cat. No.00EX449)

自引率

0.00%

发文量