GraGA:一种基于图的航空机组调度遗传算法

Proceedings 11th International Conference on Tools with Artificial Intelligence Pub Date : 1999-11-08 DOI:10.1109/TAI.1999.809761

H. Ozdemir, C. Mohan

{"title":"GraGA:一种基于图的航空机组调度遗传算法","authors":"H. Ozdemir, C. Mohan","doi":"10.1109/TAI.1999.809761","DOIUrl":null,"url":null,"abstract":"Crew scheduling is an NP-hard constrained combinatorial optimization problem, which is very important for the airline industry. We propose a genetic algorithm, GraGA, to solve this problem. A new graph based representation utilizes memory effectively, and provides a framework in which we can easily develop various genetic operators.","PeriodicalId":194023,"journal":{"name":"Proceedings 11th International Conference on Tools with Artificial Intelligence","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"GraGA: a graph based genetic algorithm for airline crew scheduling\",\"authors\":\"H. Ozdemir, C. Mohan\",\"doi\":\"10.1109/TAI.1999.809761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Crew scheduling is an NP-hard constrained combinatorial optimization problem, which is very important for the airline industry. We propose a genetic algorithm, GraGA, to solve this problem. A new graph based representation utilizes memory effectively, and provides a framework in which we can easily develop various genetic operators.\",\"PeriodicalId\":194023,\"journal\":{\"name\":\"Proceedings 11th International Conference on Tools with Artificial Intelligence\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-11-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 11th International Conference on Tools with Artificial Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TAI.1999.809761\",\"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 11th International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1999.809761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

机组调度是一个NP-hard约束组合优化问题，在航空业中具有重要意义。我们提出了一种遗传算法GraGA来解决这个问题。一种新的基于图的表示方法有效地利用了内存，并提供了一个框架，在这个框架中我们可以很容易地开发各种遗传算子。

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

查看原文本刊更多论文

GraGA: a graph based genetic algorithm for airline crew scheduling

Crew scheduling is an NP-hard constrained combinatorial optimization problem, which is very important for the airline industry. We propose a genetic algorithm, GraGA, to solve this problem. A new graph based representation utilizes memory effectively, and provides a framework in which we can easily develop various genetic operators.

求助全文

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

来源期刊

Proceedings 11th International Conference on Tools with Artificial Intelligence

自引率

0.00%

发文量