WalkSAT解决员工调动问题的方法

S. Acharyya
{"title":"WalkSAT解决员工调动问题的方法","authors":"S. Acharyya","doi":"10.1109/ICCITECHN.2008.4803070","DOIUrl":null,"url":null,"abstract":"Staff transfer is an important issue in human resource management. It is concerned with the assignment of transfer postings to employees in large organizations. A large organization has offices and work sites at multiple locations and it is customary to transfer a subset of employees at periodic intervals. The staff transfer problem (STP) can be viewed as a constraint satisfaction problem(CSP). The deterministic methods were proved to be inferior to local search methods in solving this problem. In earlier investigation GSAT(L) easily outperformed the simulated annealing (SA) which was the then best among all approaches. In this work computer experiments indicate that WalkSAT(L,p) easily outperforms GSAT(L) in most of the instances.","PeriodicalId":335795,"journal":{"name":"2008 11th International Conference on Computer and Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"WalkSAT approach in solving the staff transfer problem\",\"authors\":\"S. Acharyya\",\"doi\":\"10.1109/ICCITECHN.2008.4803070\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Staff transfer is an important issue in human resource management. It is concerned with the assignment of transfer postings to employees in large organizations. A large organization has offices and work sites at multiple locations and it is customary to transfer a subset of employees at periodic intervals. The staff transfer problem (STP) can be viewed as a constraint satisfaction problem(CSP). The deterministic methods were proved to be inferior to local search methods in solving this problem. In earlier investigation GSAT(L) easily outperformed the simulated annealing (SA) which was the then best among all approaches. In this work computer experiments indicate that WalkSAT(L,p) easily outperforms GSAT(L) in most of the instances.\",\"PeriodicalId\":335795,\"journal\":{\"name\":\"2008 11th International Conference on Computer and Information Technology\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 11th International Conference on Computer and Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2008.4803070\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 11th International Conference on Computer and Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2008.4803070","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

员工调动是人力资源管理中的一个重要问题。它关注的是在大型组织中给员工分配调动职位。大型组织在多个地点设有办公室和工作场所,通常每隔一段时间就会调动一部分员工。员工迁移问题可以看作是约束满足问题。结果表明,确定性方法在求解该问题时优于局部搜索方法。在早期的研究中,GSAT(L)很容易超越模拟退火(SA),后者是当时所有方法中最好的。在这项工作中,计算机实验表明,WalkSAT(L,p)在大多数情况下轻松优于GSAT(L)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
WalkSAT approach in solving the staff transfer problem
Staff transfer is an important issue in human resource management. It is concerned with the assignment of transfer postings to employees in large organizations. A large organization has offices and work sites at multiple locations and it is customary to transfer a subset of employees at periodic intervals. The staff transfer problem (STP) can be viewed as a constraint satisfaction problem(CSP). The deterministic methods were proved to be inferior to local search methods in solving this problem. In earlier investigation GSAT(L) easily outperformed the simulated annealing (SA) which was the then best among all approaches. In this work computer experiments indicate that WalkSAT(L,p) easily outperforms GSAT(L) in most of the instances.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信