检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:卢敏[1,2,3] 王莉[2] LU Min;WANG Li(Information Technology Research Base of CAUA,Civil Aviation University of China,Tianjin 300300,China;College of Computer Science and Technology,Civil Aviation University of China,Tianjin 300300,China;Key Laboratory of Machine Intelligence and Advanced Computing,Ministry of Education,Sun Yat-sen University,Guangzhou 510275,China)
机构地区:[1]中国民航大学中国民航信息技术科研基地,天津300300 [2]中国民航大学计算机科学与技术学院,天津300300 [3]中山大学机器智能与先进计算教育部重点实验室,广州510275
出 处:《交通运输系统工程与信息》2018年第4期54-60,共7页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金(61502499);中山大学机器智能与先进计算教育部重点实验室开放课题(MSC-201704A);中央高校基本科研业务费科研专项(3122013C005)~~
摘 要:面向班型动态生成的地服人员排班旨在动态生成班型,并将员工分配到班型中,以班型为航班地面保障单元.现有面向班型的人员排班算法是建立在固定班型数和班型内的员工资质数,未考虑班型数未知的重要前提.为此,提出面向班型动态生成的地服人员排班算法,其核心思想是通过block Gibbs抽样迭代优化班型内人员构成、班型内航班集和班型生成.在某机场值机人员的数据集中验证此算法,实验结果表明,在满足员工层次资质、员工白夜班和班型动态生成的约束下,算法能够生成合理的班型.The problem of scheduling airport ground staffs is to dynamically generate groups and assign employees to groups.The existing group-specific staff scheduling algorithms are built on the fixed number of groups.Nevertheless,it is impractical to know the number of groups in advance.An algorithm is proposed to address the issue via dynamically generating groups.Its key idea is to employ Gibbs sampling with replacement to iteratively optimize three sub-problems:assigning staffs to groups,allocating flights to groups and group generation.Experimental results on a real dataset demonstrate that the proposed algorithm can generate reasonable groups under the constraints of skill requirements for flights and shifts for employees.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.168