朝着更有效的安排常规赛NBA

Derick Basbas Canceran, C. Saloma
{"title":"朝着更有效的安排常规赛NBA","authors":"Derick Basbas Canceran, C. Saloma","doi":"10.20526/PISIKA.01A18.03","DOIUrl":null,"url":null,"abstract":"Finding the optimal schedule for the 82 games played by each of its 32 teams in a regular season is a continuing challenge for the National Basketball Association (NBA). We examine the schedules of the regular NBA games in the last 22 seasons including the current one to find possible trends in its key parameters - distance traveled during road games and number of successive (e.g. back-to-back) games played. To reduce operational cost and to keep a level playing field, the total distance traveled and the number of back-to-back games must be kept to a minimal and the same for all teams. Data have shown that teams are unlikely to win twice in back-to-back games. We implement a scheduling algorithm that aims to minimize a cost function that incorporates the key parameters as its variables. For the same season duration, the algorithm has been able to reduce the number of back-to-back games by 24% while increasing the total distance traveled by 25%.","PeriodicalId":142753,"journal":{"name":"PISIKA - Journal of the Physics Society of the Philippines","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Towards a more efficient scheduling of regular NBA games\",\"authors\":\"Derick Basbas Canceran, C. Saloma\",\"doi\":\"10.20526/PISIKA.01A18.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Finding the optimal schedule for the 82 games played by each of its 32 teams in a regular season is a continuing challenge for the National Basketball Association (NBA). We examine the schedules of the regular NBA games in the last 22 seasons including the current one to find possible trends in its key parameters - distance traveled during road games and number of successive (e.g. back-to-back) games played. To reduce operational cost and to keep a level playing field, the total distance traveled and the number of back-to-back games must be kept to a minimal and the same for all teams. Data have shown that teams are unlikely to win twice in back-to-back games. We implement a scheduling algorithm that aims to minimize a cost function that incorporates the key parameters as its variables. For the same season duration, the algorithm has been able to reduce the number of back-to-back games by 24% while increasing the total distance traveled by 25%.\",\"PeriodicalId\":142753,\"journal\":{\"name\":\"PISIKA - Journal of the Physics Society of the Philippines\",\"volume\":\"30 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PISIKA - Journal of the Physics Society of the Philippines\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.20526/PISIKA.01A18.03\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PISIKA - Journal of the Physics Society of the Philippines","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.20526/PISIKA.01A18.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

对于美国职业篮球协会(NBA)来说,为32支球队每支球队的82场常规赛找到最佳赛程一直是一个挑战。我们研究了过去22个赛季的常规赛赛程,包括当前的常规赛赛程,以发现其关键参数的可能趋势-在客场比赛中行进的距离和连续(例如背靠背)比赛的数量。为了降低运营成本并保持一个公平的竞争环境,所有队伍的总路程和背靠背比赛的数量必须保持在最低限度。数据显示,球队不太可能在背靠背比赛中赢两次。我们实现了一种调度算法,其目的是最小化包含关键参数作为变量的成本函数。在同一个赛季中,该算法能够将背靠背比赛的次数减少24%,同时将总行程增加25%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Towards a more efficient scheduling of regular NBA games
Finding the optimal schedule for the 82 games played by each of its 32 teams in a regular season is a continuing challenge for the National Basketball Association (NBA). We examine the schedules of the regular NBA games in the last 22 seasons including the current one to find possible trends in its key parameters - distance traveled during road games and number of successive (e.g. back-to-back) games played. To reduce operational cost and to keep a level playing field, the total distance traveled and the number of back-to-back games must be kept to a minimal and the same for all teams. Data have shown that teams are unlikely to win twice in back-to-back games. We implement a scheduling algorithm that aims to minimize a cost function that incorporates the key parameters as its variables. For the same season duration, the algorithm has been able to reduce the number of back-to-back games by 24% while increasing the total distance traveled by 25%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Trends in the spread of global news in the English language Towards a more efficient scheduling of regular NBA games Obtaining pre-alarm thresholds for deep-seated landslides using receiver operating characteristic convex hull analysis of slope kinematics Strength and fracture analysis of polymer-granular matter composites at variable weight percent ratio Improved linearity, stability, and thermal performance of multi-mesa-channel AlGaN/GaN HEMTs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1