{"title":"Optimizing strategic and operational decisions of car sharing systems under demand uncertainty and substitution","authors":"Beste Basciftci , Esra Koca , 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.1000,"publicationDate":"2025-03-24","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":"","PubModel":"","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.
期刊介绍:
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.