Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution

IF 4.3 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Computers & Operations Research Pub Date : 2025-08-01 Epub Date: 2025-03-24 DOI:10.1016/j.cor.2025.107052
Beste Basciftci , Esra Koca , Sinan Emre Kosunda
{"title":"Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution","authors":"Beste Basciftci ,&nbsp;Esra Koca ,&nbsp;Sinan Emre Kosunda","doi":"10.1016/j.cor.2025.107052","DOIUrl":null,"url":null,"abstract":"<div><div>Car sharing is an efficient way to improve mobility, reduce the use of personal vehicles, and lessen the associated carbon emissions. Due to increasing environmental awareness of customers and government regulations, car sharing providers must be careful about the composition of their vehicle fleet to meet diverse customer demand through vehicle types with different carbon emission levels. In this study, for a car sharing company, we consider the problems of determining service regions and purchasing decisions with a mixed fleet of vehicles under budget and carbon emission constraints, and the deployment of these vehicles to service regions under uncertain one-way and round-trip rental requests over a multi-period planning horizon. We further introduce the concept of “substitution” to the car sharing operations that provides customers with alternative vehicle options when their preferred type is unavailable. To address this complex problem, we propose a novel two-stage stochastic mixed-integer program leveraging spatial–temporal networks and multicommodity flows to capture these strategic and operational decisions of this system over the planning horizon while allowing substitution in operations. We further prove that the corresponding second-stage problem of the proposed program has a totally unimodular constraint matrix. Taking advantage of this result, we develop a branch-and-cut-based decomposition algorithm with various computational enhancements. We present an extensive computational study that highlights the value of the proposed models from different perspectives and demonstrates the performance of the proposed solution algorithm with significant speedups. Our case study provides insights for region opening and fleet allocation plans under demand uncertainty and demonstrates the value of introducing substitution to car sharing operations and the importance of integrating strategic and operational decisions and obtaining stochastic solutions.</div></div>","PeriodicalId":10542,"journal":{"name":"Computers & Operations Research","volume":"180 ","pages":"Article 107052"},"PeriodicalIF":4.3000,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Operations Research","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305054825000802","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/24 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Car sharing is an efficient way to improve mobility, reduce the use of personal vehicles, and lessen the associated carbon emissions. Due to increasing environmental awareness of customers and government regulations, car sharing providers must be careful about the composition of their vehicle fleet to meet diverse customer demand through vehicle types with different carbon emission levels. In this study, for a car sharing company, we consider the problems of determining service regions and purchasing decisions with a mixed fleet of vehicles under budget and carbon emission constraints, and the deployment of these vehicles to service regions under uncertain one-way and round-trip rental requests over a multi-period planning horizon. We further introduce the concept of “substitution” to the car sharing operations that provides customers with alternative vehicle options when their preferred type is unavailable. To address this complex problem, we propose a novel two-stage stochastic mixed-integer program leveraging spatial–temporal networks and multicommodity flows to capture these strategic and operational decisions of this system over the planning horizon while allowing substitution in operations. We further prove that the corresponding second-stage problem of the proposed program has a totally unimodular constraint matrix. Taking advantage of this result, we develop a branch-and-cut-based decomposition algorithm with various computational enhancements. We present an extensive computational study that highlights the value of the proposed models from different perspectives and demonstrates the performance of the proposed solution algorithm with significant speedups. Our case study provides insights for region opening and fleet allocation plans under demand uncertainty and demonstrates the value of introducing substitution to car sharing operations and the importance of integrating strategic and operational decisions and obtaining stochastic solutions.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
需求不确定性和替代条件下汽车共享系统的战略与运营决策优化
汽车共享是提高机动性、减少个人车辆使用和减少相关碳排放的有效途径。由于消费者的环保意识和政府法规的提高,汽车共享供应商必须小心他们的车队组成,通过不同碳排放水平的车辆类型来满足不同的客户需求。在本研究中,我们考虑了一个汽车共享公司在预算和碳排放约束下,使用混合车队确定服务区域和购买决策的问题,以及在不确定的单向和往返租赁请求下,在多期规划范围内将这些车辆部署到服务区域的问题。我们进一步将“替代”概念引入到汽车共享操作中,当客户的首选车型无法使用时,为客户提供替代车辆选择。为了解决这个复杂的问题,我们提出了一个新的两阶段随机混合整数方案,利用时空网络和多商品流来捕获该系统在规划范围内的战略和运营决策,同时允许在运营中进行替代。进一步证明了所提方案的第二阶段问题具有完全非模约束矩阵。利用这一结果,我们开发了一种具有各种计算增强的基于分支和切割的分解算法。我们提出了一个广泛的计算研究,从不同的角度突出了所提出的模型的价值,并证明了所提出的解决算法的性能显著加快。我们的案例研究为需求不确定性下的区域开放和车队分配计划提供了见解,并展示了引入替代汽车共享运营的价值,以及整合战略和运营决策以及获得随机解决方案的重要性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computers & Operations Research
Computers & Operations Research 工程技术-工程:工业
CiteScore
8.60
自引率
8.70%
发文量
292
审稿时长
8.5 months
期刊介绍: Operations research and computers meet in a large number of scientific fields, many of which are of vital current concern to our troubled society. These include, among others, ecology, transportation, safety, reliability, urban planning, economics, inventory control, investment strategy and logistics (including reverse logistics). Computers & Operations Research provides an international forum for the application of computers and operations research techniques to problems in these and related fields.
期刊最新文献
Beware of the classical benchmark instances for the Traveling Salesman Problem with Time Windows A speed-up for Helsgaun’s TSP heuristic by relaxing the positive gain criterion A memory-enhanced Greedy Randomized Adaptive Search Procedure for the Multi-Pickup and Delivery Problem with Time Windows A neural-driven constructive heuristic for the flexible job shop scheduling problem: An efficient alternative to complex deep learning methods Constraint programming approaches for stochastic Resource-Constrained Project Scheduling Problem subject to disruptions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1