一个真实的员工总线路由问题应用程序,带有混合负载

Hajar Bideq, Khaoula Ouaddi, Agnès Gorge, R. Ellaia
{"title":"一个真实的员工总线路由问题应用程序,带有混合负载","authors":"Hajar Bideq, Khaoula Ouaddi, Agnès Gorge, R. Ellaia","doi":"10.1109/gol53975.2022.9820604","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a real-world application of the Employee Shuttle Bus Routing (ESBR) for a transportation company that provides shuttle services for an industrial group. We present a mathematical model that enables the company with mixed loads allowance and dis-allowance options, since the appearance of Covid-19 has banned the transportation of employees belonging to different workplaces on the same bus. We solved this model using the CPLEX solver and tested it on real-world data instances. However, the data set was large which made the exact solutions hard to obtain. Therefore, we sought to divide the data set into clusters using the Agglomerative Clustering algorithm and we ran the model on these groups independently. At the end of this paper, we present a comparison, in terms of execution time and objective value, of the model’s results for mixed loads respectively allowed and forbidden.","PeriodicalId":438542,"journal":{"name":"2022 IEEE 6th International Conference on Logistics Operations Management (GOL)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A real-world Employee Bus Routing Problem application with mixed loads\",\"authors\":\"Hajar Bideq, Khaoula Ouaddi, Agnès Gorge, R. Ellaia\",\"doi\":\"10.1109/gol53975.2022.9820604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a real-world application of the Employee Shuttle Bus Routing (ESBR) for a transportation company that provides shuttle services for an industrial group. We present a mathematical model that enables the company with mixed loads allowance and dis-allowance options, since the appearance of Covid-19 has banned the transportation of employees belonging to different workplaces on the same bus. We solved this model using the CPLEX solver and tested it on real-world data instances. However, the data set was large which made the exact solutions hard to obtain. Therefore, we sought to divide the data set into clusters using the Agglomerative Clustering algorithm and we ran the model on these groups independently. At the end of this paper, we present a comparison, in terms of execution time and objective value, of the model’s results for mixed loads respectively allowed and forbidden.\",\"PeriodicalId\":438542,\"journal\":{\"name\":\"2022 IEEE 6th International Conference on Logistics Operations Management (GOL)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 6th International Conference on Logistics Operations Management (GOL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/gol53975.2022.9820604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 6th International Conference on Logistics Operations Management (GOL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/gol53975.2022.9820604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在本文中,我们考虑一个为工业集团提供班车服务的运输公司的员工班车路由(ESBR)的实际应用程序。我们提出了一个数学模型,使公司能够提供混合负载津贴和不津贴选项,因为Covid-19的出现禁止了属于不同工作场所的员工乘坐同一辆公共汽车。我们使用CPLEX求解器求解该模型,并在实际数据实例上进行了测试。然而,由于数据集很大,很难得到精确的解。因此,我们试图使用Agglomerative Clustering算法将数据集划分为簇,并在这些组上独立运行模型。在本文的最后,我们分别对允许和禁止混合负载的模型结果进行了执行时间和目标值的比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A real-world Employee Bus Routing Problem application with mixed loads
In this paper, we consider a real-world application of the Employee Shuttle Bus Routing (ESBR) for a transportation company that provides shuttle services for an industrial group. We present a mathematical model that enables the company with mixed loads allowance and dis-allowance options, since the appearance of Covid-19 has banned the transportation of employees belonging to different workplaces on the same bus. We solved this model using the CPLEX solver and tested it on real-world data instances. However, the data set was large which made the exact solutions hard to obtain. Therefore, we sought to divide the data set into clusters using the Agglomerative Clustering algorithm and we ran the model on these groups independently. At the end of this paper, we present a comparison, in terms of execution time and objective value, of the model’s results for mixed loads respectively allowed and forbidden.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Building Sustainable Relationships between Educational and Air Transport Logistics Providers Optimisation of Procure to Pay process through Blockchain technology – Case of Textile Sector– Comparing generic and dedicated tools of discrete-event simulation for examining inland waterway transportation services Perceptions and Misconceptions of Blockchain: The Potential of Applying Threshold Concept Theory The Optimal Location of the Entry and Exit Gates of the Dynamic Wireless Charging Transmitter of the Electric Vehicles on the Highway
×
引用
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