{"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.