版权说明 操作指南
首页 > 成果 > 详情

Simulated Annealing in Talent Scheduling Problem

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文、会议论文
作者:
Cheng Chen;Dan Wang;Gongzhao Zhang;Mao Chen(陈矛
通讯作者:
Chen, M.
作者机构:
[Wang D.; Chen M.; Cheng Chen; Zhang G.] National Engineering Research Center for E-learning, Central China Normal University, Wuhan, 430079, China
通讯机构:
[Chen, M.] N
National Engineering Research Center for E-learning, China
语种:
英文
关键词:
Meta-heuristic;Simulated annealing;Talent Scheduling Problem
期刊:
Advances in Intelligent Systems and Computing
ISSN:
2194-5357
年:
2020
卷:
1084
页码:
325-332
会议名称:
4th International Conference on Intelligent, Interactive Systems and Applications, IISA2019
会议论文集名称:
Advances in Intelligent Systems and Interactive Applications
会议时间:
28 June 2019 through 30 June 2019
主编:
Fatos Xhafa<&wdkj&>Srikanta Patnaik<&wdkj&>Madjid Tavana
出版者:
Springer, Cham
ISBN:
978-3-030-34386-6
基金类别:
Acknowledgement. The work was financially supported by the National Key R&D Program of China (2017YFB1401300, 2017YFB1401302) and the self-determined research funds of CCNU from the colleges’ basic research and operation of MOE (Grant No. CCNU19ZN011).
机构署名:
本校为第一机构
院系归属:
国家数字化学习工程技术研究中心
摘要:
Talent Scheduling is about scheduling independent activities (such as scenes in a movie) to minimize the extra cost. Simulated annealing has played an important role in combinatorial optimization since it was proposed. This article explores how the simulated annealing algorithm is applied to solve the Talent Scheduling Problem and aims to generate a sequence as optimal as possible. We also discuss the influence of some factors on the performance of the proposed algorithm and give a suggestion about how ...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com