基于地理信息系统的三步调度解决劳动力计划问题

Thepparit Sinthamrongruk, K. Dahal, Xinheng Wang, M. Iqbal
{"title":"基于地理信息系统的三步调度解决劳动力计划问题","authors":"Thepparit Sinthamrongruk, K. Dahal, Xinheng Wang, M. Iqbal","doi":"10.1109/SKIMA47702.2019.8982422","DOIUrl":null,"url":null,"abstract":"Routing workforce planning problem is a difficult problem, requiring a combination of the vehicle routing problem and the staff scheduling problem. This problem associates with a lot of constraints, even when having only a single criterion and homogeneous staff skill. This paper introduces three-step scheduling-a generic scheduling procedure for solving the workforce planning problems which incorporates between an optimisation tool, fuzzy inference system and geographic information system technology. The scheduling problem is hierarchically divided into sub-problems and then solved with the proposed scheduling framework. A simulated case study of the electricity meter installation service problems is employed to verify the proposed framework. In this study, we are focusing on the route scheduling which is the first step of the three-step scheduling. The total of travel distance is defined as an objective function. Particular case requirements such as lunch and parking time are also included in the model for optimisation. Our empirical study reveals that the proposed route scheduling is capable of exploring the optimal solutions for the case study with the shortest service path, compared to the original procedure.","PeriodicalId":245523,"journal":{"name":"2019 13th International Conference on Software, Knowledge, Information Management and Applications (SKIMA)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A three-step scheduling based on geographic information system for workforce-planning problem\",\"authors\":\"Thepparit Sinthamrongruk, K. Dahal, Xinheng Wang, M. Iqbal\",\"doi\":\"10.1109/SKIMA47702.2019.8982422\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing workforce planning problem is a difficult problem, requiring a combination of the vehicle routing problem and the staff scheduling problem. This problem associates with a lot of constraints, even when having only a single criterion and homogeneous staff skill. This paper introduces three-step scheduling-a generic scheduling procedure for solving the workforce planning problems which incorporates between an optimisation tool, fuzzy inference system and geographic information system technology. The scheduling problem is hierarchically divided into sub-problems and then solved with the proposed scheduling framework. A simulated case study of the electricity meter installation service problems is employed to verify the proposed framework. In this study, we are focusing on the route scheduling which is the first step of the three-step scheduling. The total of travel distance is defined as an objective function. Particular case requirements such as lunch and parking time are also included in the model for optimisation. Our empirical study reveals that the proposed route scheduling is capable of exploring the optimal solutions for the case study with the shortest service path, compared to the original procedure.\",\"PeriodicalId\":245523,\"journal\":{\"name\":\"2019 13th International Conference on Software, Knowledge, Information Management and Applications (SKIMA)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 13th International Conference on Software, Knowledge, Information Management and Applications (SKIMA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SKIMA47702.2019.8982422\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 13th International Conference on Software, Knowledge, Information Management and Applications (SKIMA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SKIMA47702.2019.8982422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

路径劳动力规划问题是一个复杂的问题,需要将车辆路径问题和人员调度问题相结合。这个问题与许多约束有关,即使只有一个标准和相同的员工技能。本文介绍了一种集优化工具、模糊推理系统和地理信息系统技术于一体的解决劳动力计划问题的通用调度程序——三步调度。将调度问题分层划分为若干子问题,然后利用所提出的调度框架进行求解。通过电表安装维修问题的仿真研究,验证了所提出的框架。在本研究中,我们重点研究路线调度,这是三步调度的第一步。总行程距离被定义为目标函数。特殊情况下的要求,如午餐和停车时间也包括在优化模型中。我们的实证研究表明,与原始程序相比,所提出的路线调度能够以最短的服务路径探索案例研究的最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A three-step scheduling based on geographic information system for workforce-planning problem
Routing workforce planning problem is a difficult problem, requiring a combination of the vehicle routing problem and the staff scheduling problem. This problem associates with a lot of constraints, even when having only a single criterion and homogeneous staff skill. This paper introduces three-step scheduling-a generic scheduling procedure for solving the workforce planning problems which incorporates between an optimisation tool, fuzzy inference system and geographic information system technology. The scheduling problem is hierarchically divided into sub-problems and then solved with the proposed scheduling framework. A simulated case study of the electricity meter installation service problems is employed to verify the proposed framework. In this study, we are focusing on the route scheduling which is the first step of the three-step scheduling. The total of travel distance is defined as an objective function. Particular case requirements such as lunch and parking time are also included in the model for optimisation. Our empirical study reveals that the proposed route scheduling is capable of exploring the optimal solutions for the case study with the shortest service path, compared to the original procedure.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
An Under-Sampling Method with Support Vectors in Multi-class Imbalanced Data Classification Big Data with Decision Tree Induction Partitioning based incremental marginalization algorithm for anonymizing missing data streams A Deep Learning Approach to Tumour Identification in Fresh Frozen Tissues An Efficient Cryptosystem based on the Logistic-Chebyshev Map
×
引用
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