在地理分布的参与者的共同地点优化会议旅行

Peter Hillmann, Bastian Kuhnel, Tobias Uhlig, G. Rodosek, O. Rose
{"title":"在地理分布的参与者的共同地点优化会议旅行","authors":"Peter Hillmann, Bastian Kuhnel, Tobias Uhlig, G. Rodosek, O. Rose","doi":"10.1109/SOLI.2017.8120984","DOIUrl":null,"url":null,"abstract":"Members of international organizations often meet in person at a common location for discussions. There is frequently disagreement over the place and time of the meeting due to the different travel efforts of the members. They usually travel by plane and their travel expenses depend on the flight connections. This paper presents an approach to calculate the optimized location and time, where and when distributed partners should meet. The presented system considers the requirements and specifications of each individual member. It respects earliest starting time of an event and non night flights. The optimized result is evaluated with regard to multiple objectives. We focus on the minimization of costs and travel time. Our search algorithm identifies individual travel data for all members for a potential event. The output provides recommendations for the global best appointments and offers further information for the partners. Our system saves expenses and time for all members and allows adjustment as well as compensation.","PeriodicalId":190544,"journal":{"name":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimized travel to meetings on a common location of geographical distributed participants\",\"authors\":\"Peter Hillmann, Bastian Kuhnel, Tobias Uhlig, G. Rodosek, O. Rose\",\"doi\":\"10.1109/SOLI.2017.8120984\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Members of international organizations often meet in person at a common location for discussions. There is frequently disagreement over the place and time of the meeting due to the different travel efforts of the members. They usually travel by plane and their travel expenses depend on the flight connections. This paper presents an approach to calculate the optimized location and time, where and when distributed partners should meet. The presented system considers the requirements and specifications of each individual member. It respects earliest starting time of an event and non night flights. The optimized result is evaluated with regard to multiple objectives. We focus on the minimization of costs and travel time. Our search algorithm identifies individual travel data for all members for a potential event. The output provides recommendations for the global best appointments and offers further information for the partners. Our system saves expenses and time for all members and allows adjustment as well as compensation.\",\"PeriodicalId\":190544,\"journal\":{\"name\":\"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOLI.2017.8120984\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Service Operations and Logistics, and Informatics (SOLI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOLI.2017.8120984","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

国际组织的成员经常在一个共同的地点亲自开会讨论。由于成员的出行方式不同,会议的地点和时间经常出现分歧。他们通常乘飞机旅行,他们的旅行费用取决于航班转机。本文提出了一种计算分布式伙伴相遇的最佳地点和时间的方法。所提出的系统考虑到每个成员的要求和规格。它尊重一个事件的最早开始时间和非夜间航班。对优化结果进行了多目标评价。我们专注于成本和旅行时间的最小化。我们的搜索算法为潜在事件识别所有成员的个人旅行数据。输出为全球最佳约会提供建议,并为合作伙伴提供进一步的信息。我们的系统为所有会员节省了费用和时间,并允许调整和补偿。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimized travel to meetings on a common location of geographical distributed participants
Members of international organizations often meet in person at a common location for discussions. There is frequently disagreement over the place and time of the meeting due to the different travel efforts of the members. They usually travel by plane and their travel expenses depend on the flight connections. This paper presents an approach to calculate the optimized location and time, where and when distributed partners should meet. The presented system considers the requirements and specifications of each individual member. It respects earliest starting time of an event and non night flights. The optimized result is evaluated with regard to multiple objectives. We focus on the minimization of costs and travel time. Our search algorithm identifies individual travel data for all members for a potential event. The output provides recommendations for the global best appointments and offers further information for the partners. Our system saves expenses and time for all members and allows adjustment as well as compensation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A pre-process clustering methods for the waste collection problem Logistics in omni-channel retailing: Modelling and analysis of three distribution configurations Mixed vendor/retailer management of zero-cost multill-inventory systems Maximizing road carriers profit by combining trips and sizing the carrier coalition Raw material flow optimization as a capacitated vehicle routing problem: A visual benchmarking approach for sustainable manufacturing
×
引用
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