模拟并解决与其他交通方式相结合的企业车辆共享问题

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE EURO Journal on Transportation and Logistics Pub Date : 2024-01-01 DOI:10.1016/j.ejtl.2023.100122
Miriam Enzi , Sophie N. Parragh , David Pisinger
{"title":"模拟并解决与其他交通方式相结合的企业车辆共享问题","authors":"Miriam Enzi ,&nbsp;Sophie N. Parragh ,&nbsp;David Pisinger","doi":"10.1016/j.ejtl.2023.100122","DOIUrl":null,"url":null,"abstract":"<div><p>We consider a car-sharing problem in a company during business hours. The employees, located at one or several offices, have to travel to one or more appointments each with a fixed location and fixed start and end times and return to one of the offices afterwards. Each employee trip can be carried out with one out of several alternative modes of transport. The considered modes of transport are a company car from the company car pool, walking, public transport, bike, and taxi. The aim is to assign modes of transport to employee trips such that the total costs of covering the trips is minimized.</p><p>We first consider that the company is operating a shared fleet of a single type of vehicle and then that the fleet consists of different vehicle types. By relying on minimizing the savings when using a vehicle compared to the cheapest alternative available mode of transport (which is used if no vehicle is assigned to a trip), we do not need to model the alternative modes explicitly. For the case where the vehicle fleet consists of a single type of vehicle, we model the vehicle-sharing problem as a minimum-cost flow problem. Secondly, if multiple types of vehicles are available the problem can be formulated as a multi-commodity flow problem. Since very efficient solution methods are available for these formulations, they are applicable in daily operations.</p><p>We provide a comprehensive computational study for both cases on instances based on demographic, spatial, and economic data of Vienna. We show that our formulations for the problem solve these instances in a few seconds, which makes them usable in an online booking system. In the analysis, we discuss different potential settings. We study different sizes and compositions of the shared fleet, restricted sets of modes of transport, and variations of the objective function.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437623000195/pdfft?md5=f124a5d29dbeed0c2acca802f4409ee7&pid=1-s2.0-S2192437623000195-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport\",\"authors\":\"Miriam Enzi ,&nbsp;Sophie N. Parragh ,&nbsp;David Pisinger\",\"doi\":\"10.1016/j.ejtl.2023.100122\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We consider a car-sharing problem in a company during business hours. The employees, located at one or several offices, have to travel to one or more appointments each with a fixed location and fixed start and end times and return to one of the offices afterwards. Each employee trip can be carried out with one out of several alternative modes of transport. The considered modes of transport are a company car from the company car pool, walking, public transport, bike, and taxi. The aim is to assign modes of transport to employee trips such that the total costs of covering the trips is minimized.</p><p>We first consider that the company is operating a shared fleet of a single type of vehicle and then that the fleet consists of different vehicle types. By relying on minimizing the savings when using a vehicle compared to the cheapest alternative available mode of transport (which is used if no vehicle is assigned to a trip), we do not need to model the alternative modes explicitly. For the case where the vehicle fleet consists of a single type of vehicle, we model the vehicle-sharing problem as a minimum-cost flow problem. Secondly, if multiple types of vehicles are available the problem can be formulated as a multi-commodity flow problem. Since very efficient solution methods are available for these formulations, they are applicable in daily operations.</p><p>We provide a comprehensive computational study for both cases on instances based on demographic, spatial, and economic data of Vienna. We show that our formulations for the problem solve these instances in a few seconds, which makes them usable in an online booking system. In the analysis, we discuss different potential settings. We study different sizes and compositions of the shared fleet, restricted sets of modes of transport, and variations of the objective function.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192437623000195/pdfft?md5=f124a5d29dbeed0c2acca802f4409ee7&pid=1-s2.0-S2192437623000195-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437623000195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437623000195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑一家公司在工作时间内的汽车共享问题。位于一个或多个办公室的员工必须前往一个或多个约会,每个约会都有固定的地点、固定的开始和结束时间,然后返回其中一个办公室。员工的每次出行可以选择几种交通方式中的一种。可供选择的交通方式包括公司汽车库中的公司汽车、步行、公共交通、自行车和出租车。我们的目标是为员工的出行分配交通方式,从而使出行的总成本最小化。我们首先考虑公司运营的是由单一类型车辆组成的共享车队,然后再考虑车队由不同类型的车辆组成。与现有最便宜的替代交通方式(如果没有为某次出行分配车辆,则使用最便宜的替代交通方式)相比,我们依靠最大限度地减少使用车辆时节省的费用,因此不需要对替代交通方式进行明确建模。对于车队由单一类型车辆组成的情况,我们将车辆共享问题建模为最小成本流量问题。其次,如果有多种类型的车辆,则可将问题表述为多商品流通问题。我们对这两种情况下基于维也纳人口、空间和经济数据的实例进行了全面的计算研究。我们对这两种情况下基于维也纳人口、空间和经济数据的实例进行了全面的计算研究,结果表明,我们的计算公式可以在几秒钟内解决这些实例,因此可以用于在线预订系统。在分析中,我们讨论了不同的潜在设置。我们研究了共享车队的不同规模和组成、受限的运输模式集以及目标函数的变化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport

We consider a car-sharing problem in a company during business hours. The employees, located at one or several offices, have to travel to one or more appointments each with a fixed location and fixed start and end times and return to one of the offices afterwards. Each employee trip can be carried out with one out of several alternative modes of transport. The considered modes of transport are a company car from the company car pool, walking, public transport, bike, and taxi. The aim is to assign modes of transport to employee trips such that the total costs of covering the trips is minimized.

We first consider that the company is operating a shared fleet of a single type of vehicle and then that the fleet consists of different vehicle types. By relying on minimizing the savings when using a vehicle compared to the cheapest alternative available mode of transport (which is used if no vehicle is assigned to a trip), we do not need to model the alternative modes explicitly. For the case where the vehicle fleet consists of a single type of vehicle, we model the vehicle-sharing problem as a minimum-cost flow problem. Secondly, if multiple types of vehicles are available the problem can be formulated as a multi-commodity flow problem. Since very efficient solution methods are available for these formulations, they are applicable in daily operations.

We provide a comprehensive computational study for both cases on instances based on demographic, spatial, and economic data of Vienna. We show that our formulations for the problem solve these instances in a few seconds, which makes them usable in an online booking system. In the analysis, we discuss different potential settings. We study different sizes and compositions of the shared fleet, restricted sets of modes of transport, and variations of the objective function.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
24
审稿时长
129 days
期刊介绍: The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
期刊最新文献
Inbound traffic capture link-design problem independent of assumptions on users’ route choices Modeling and solving a corporate vehicle-sharing problem combined with other modes of transport A fair multi-commodity two-echelon distribution problem Price optimal routing in public transportation Inbound traffic capture link-design problem independent of assumptions on users’ route choices
×
引用
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