自动生成乒乓球联赛回合的时间表

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512) Pub Date : 2000-07-16 DOI:10.1109/CEC.2000.870307

Jörn Schönberger, D. Mattfeld, H. Kopfer

{"title":"自动生成乒乓球联赛回合的时间表","authors":"Jörn Schönberger, D. Mattfeld, H. Kopfer","doi":"10.1109/CEC.2000.870307","DOIUrl":null,"url":null,"abstract":"Considers the problem of scheduling rounds of a non-professional table-tennis league. We formalize the problem in terms of a timetabling optimization problem, then we solve this highly constrained problem with a permutation-based genetic algorithm for which feasibility-preserving operators are defined. Since coding and operators cannot warrant feasibility in every case, the fitness function penalizes constraint violations. This algorithm is compared to an even more elaborated variant, which additionally aims at repairing infeasible solutions produced by the genetic operators.","PeriodicalId":218136,"journal":{"name":"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Automated timetable generation for rounds of a table-tennis league\",\"authors\":\"Jörn Schönberger, D. Mattfeld, H. Kopfer\",\"doi\":\"10.1109/CEC.2000.870307\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Considers the problem of scheduling rounds of a non-professional table-tennis league. We formalize the problem in terms of a timetabling optimization problem, then we solve this highly constrained problem with a permutation-based genetic algorithm for which feasibility-preserving operators are defined. Since coding and operators cannot warrant feasibility in every case, the fitness function penalizes constraint violations. This algorithm is compared to an even more elaborated variant, which additionally aims at repairing infeasible solutions produced by the genetic operators.\",\"PeriodicalId\":218136,\"journal\":{\"name\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CEC.2000.870307\",\"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 of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC.2000.870307","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 20

摘要

考虑了一个非职业乒乓球联赛的赛程安排问题。首先将该问题形式化为调度优化问题，然后利用基于排列的遗传算法求解这一高度约束的问题，该算法定义了可保算子。由于编码和运算符不能保证在每种情况下都可行，适应度函数会惩罚违反约束的情况。该算法与一种更复杂的变体进行了比较，该变体旨在修复由遗传算子产生的不可行解。

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

查看原文本刊更多论文

Automated timetable generation for rounds of a table-tennis league

Considers the problem of scheduling rounds of a non-professional table-tennis league. We formalize the problem in terms of a timetabling optimization problem, then we solve this highly constrained problem with a permutation-based genetic algorithm for which feasibility-preserving operators are defined. Since coding and operators cannot warrant feasibility in every case, the fitness function penalizes constraint violations. This algorithm is compared to an even more elaborated variant, which additionally aims at repairing infeasible solutions produced by the genetic operators.

求助全文

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

来源期刊

Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512)

自引率

0.00%

发文量