A Genetic Algorithm for the Arrangement of the Physical Ability Test

Qiming Feng
{"title":"A Genetic Algorithm for the Arrangement of the Physical Ability Test","authors":"Qiming Feng","doi":"10.1109/ISME.2010.126","DOIUrl":null,"url":null,"abstract":"This paper introduces the solution to time arrangement of physical ability test. It is a bin-packing problem, a kind of heuristic hybrid genetic algorithm composed by the best-fit (BF) and GA. By this way, the convergence speed is faster, the result is relatively stable, while the evolution generations is more than 90. The coded method proposed in this paper is the object-based representation which doesn’t need to give the number of the boxes before. But the objects should be put into the boxes in turn, only when the boxes are overloaded another box will be add. In this way, each box will be filled as possible as you can. So it would not result problem of overload and discontent at any time. Therefore the efficiency is greatly enhanced.","PeriodicalId":348878,"journal":{"name":"2010 International Conference of Information Science and Management Engineering","volume":"263 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference of Information Science and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISME.2010.126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper introduces the solution to time arrangement of physical ability test. It is a bin-packing problem, a kind of heuristic hybrid genetic algorithm composed by the best-fit (BF) and GA. By this way, the convergence speed is faster, the result is relatively stable, while the evolution generations is more than 90. The coded method proposed in this paper is the object-based representation which doesn’t need to give the number of the boxes before. But the objects should be put into the boxes in turn, only when the boxes are overloaded another box will be add. In this way, each box will be filled as possible as you can. So it would not result problem of overload and discontent at any time. Therefore the efficiency is greatly enhanced.
基于遗传算法的体能测试排布
介绍了体能测试时间安排的解决方案。它是一个装箱问题,是一种由最优拟合算法和遗传算法组成的启发式混合遗传算法。这样,收敛速度更快,结果相对稳定,而进化代数在90以上。本文提出的编码方法是基于对象的表示,不需要事先给出盒子的个数。但是物品应该依次放入箱子,只有当箱子超载时才会增加另一个箱子。这样每个箱子就会尽可能地装满。这样在任何时候都不会产生超负荷和不满的问题。因此,效率大大提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信