首页 > 最新文献

EURO Journal on Transportation and Logistics最新文献

英文 中文
Accelerating the electric vehicle revolution: Policy implications of charging subsidies and green taxes 加速电动汽车革命:收费补贴和环保税的政策含义
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100152
Sanchari Guha Niyogi
Electric vehicles (EVs) are central to global efforts to reduce transportation emissions, yet limited charging infrastructure remains a primary barrier to widespread adoption. Governments worldwide have implemented various subsidies for EV purchasers and manufacturers, alongside green tax schemes, to incentivise infrastructure expansion and boost EV uptake. This research explores the efficacy of policy combinations — specifically purchase-based or per-station subsidies and green taxes — in a duopolistic market setting. By employing a game-theoretic model comprising profit-maximising EV and gasoline vehicle (GV) manufacturers, a population of utility-maximising consumers, and a social welfare-maximising government, we observe that a purchase-based subsidy in combination with a green tax provides a win–win–win outcome for the government and the manufacturers. Incorporating consumers’ EV-related anxieties, our analysis suggests that a green tax, either on its own or combined with subsidies, is the most effective policy for governments aiming to maximise social welfare. In markets characterised by diverse and sometimes misinformed consumers, a policy mix of green taxes and charging subsidies proves especially beneficial when the environmental impact of EV adoption is substantial. Additionally, when accounting for network effects, which could result in congested charging stations, pairing consumer subsidies with a green tax emerges as the preferential policy. Manufacturers and policymakers are provided with multifaceted insights that aid in conceptualising electric mobility.
电动汽车(ev)是全球减少交通排放努力的核心,但有限的充电基础设施仍然是广泛采用电动汽车的主要障碍。世界各国政府已经对电动汽车购买者和制造商实施了各种补贴,以及绿色税收计划,以激励基础设施扩建,促进电动汽车的普及。本研究探讨了在双寡头市场环境下政策组合的有效性,特别是基于购买或每站补贴和绿色税。通过采用一个由利润最大化的电动汽车和汽油车制造商、效用最大化的消费者群体和社会福利最大化的政府组成的博弈论模型,我们观察到基于购买的补贴与绿色税相结合为政府和制造商提供了一个三赢的结果。考虑到消费者对电动汽车的担忧,我们的分析表明,绿色税,无论是单独征收还是与补贴相结合,都是旨在实现社会福利最大化的政府最有效的政策。在消费者多样化、有时被误导的市场中,当采用电动汽车对环境产生重大影响时,绿色税和充电补贴的政策组合被证明特别有益。此外,考虑到可能导致充电站拥挤的网络效应,将消费者补贴与环保税结合起来就成为了优惠政策。为制造商和政策制定者提供了多方面的见解,有助于概念化电动汽车。
{"title":"Accelerating the electric vehicle revolution: Policy implications of charging subsidies and green taxes","authors":"Sanchari Guha Niyogi","doi":"10.1016/j.ejtl.2025.100152","DOIUrl":"10.1016/j.ejtl.2025.100152","url":null,"abstract":"<div><div>Electric vehicles (EVs) are central to global efforts to reduce transportation emissions, yet limited charging infrastructure remains a primary barrier to widespread adoption. Governments worldwide have implemented various subsidies for EV purchasers and manufacturers, alongside green tax schemes, to incentivise infrastructure expansion and boost EV uptake. This research explores the efficacy of policy combinations — specifically purchase-based or per-station subsidies and green taxes — in a duopolistic market setting. By employing a game-theoretic model comprising profit-maximising EV and gasoline vehicle (GV) manufacturers, a population of utility-maximising consumers, and a social welfare-maximising government, we observe that a purchase-based subsidy in combination with a green tax provides a win–win–win outcome for the government and the manufacturers. Incorporating consumers’ EV-related anxieties, our analysis suggests that a green tax, either on its own or combined with subsidies, is the most effective policy for governments aiming to maximise social welfare. In markets characterised by diverse and sometimes misinformed consumers, a policy mix of green taxes and charging subsidies proves especially beneficial when the environmental impact of EV adoption is substantial. Additionally, when accounting for network effects, which could result in congested charging stations, pairing consumer subsidies with a green tax emerges as the preferential policy. Manufacturers and policymakers are provided with multifaceted insights that aid in conceptualising electric mobility.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100152"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143422715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal departure time choices as quantiles and expectiles of the travel time distribution 最优出发时间选择作为旅行时间分布的分位数和期望
IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100162
Maria Osipenko
We consider two alternative preference specifications for optimal departure time choices: the classical asymmetric linear loss for early and late delays, and a new specification based on asymmetric quadratic loss. We demonstrate that the resulting optimal choices correspond to the tail indices of the travel time distribution—quantiles for the asymmetric linear specification and expectiles for the asymmetric quadratic specification. Additionally, we establish a correspondence between the choices induced by these two utility specifications, showing that the asymmetric quadratic preference class is a valid alternative with favorable properties, as demonstrated through examples and applications. For both utility specifications, we derive travel time reliability ratios and present a straightforward computation method using the concepts of τ-deviation and τ-variance. Moreover, we test both specifications using departure time choice data, finding that the quadratic loss specification more accurately represents actual departure time choices. Finally, using Montreal travel time data for two alternative routes, we fit a mixture of gamma distributions and compare the behavior of the optimal departure time choices and travel time reliability ratio curves induced by the different utility specifications.
我们考虑了两种最优出发时间选择的偏好规范:早期和晚期延迟的经典非对称线性损失,以及基于非对称二次损失的新规范。我们证明了所得到的最优选择对应于旅行时间分布的尾部指标——非对称线性规范的分位数和非对称二次规范的期望。此外,我们建立了由这两个效用规范引起的选择之间的对应关系,表明非对称二次偏好类是具有良好性能的有效选择,并通过实例和应用证明了这一点。对于这两种效用规范,我们推导了旅行时可靠性比,并使用τ-偏差和τ-方差的概念提出了一种简单的计算方法。此外,我们使用出发时间选择数据对两种规格进行了测试,发现二次损失规格更准确地代表了实际的出发时间选择。最后,利用蒙特利尔市两条备选路线的出行时间数据,拟合了混合伽马分布,并比较了不同效用规范下最优出发时间选择和出行时间可靠性比曲线的行为。
{"title":"Optimal departure time choices as quantiles and expectiles of the travel time distribution","authors":"Maria Osipenko","doi":"10.1016/j.ejtl.2025.100162","DOIUrl":"10.1016/j.ejtl.2025.100162","url":null,"abstract":"<div><div>We consider two alternative preference specifications for optimal departure time choices: the classical asymmetric linear loss for early and late delays, and a new specification based on asymmetric quadratic loss. We demonstrate that the resulting optimal choices correspond to the tail indices of the travel time distribution—quantiles for the asymmetric linear specification and expectiles for the asymmetric quadratic specification. Additionally, we establish a correspondence between the choices induced by these two utility specifications, showing that the asymmetric quadratic preference class is a valid alternative with favorable properties, as demonstrated through examples and applications. For both utility specifications, we derive travel time reliability ratios and present a straightforward computation method using the concepts of <span><math><mi>τ</mi></math></span>-deviation and <span><math><mi>τ</mi></math></span>-variance. Moreover, we test both specifications using departure time choice data, finding that the quadratic loss specification more accurately represents actual departure time choices. Finally, using Montreal travel time data for two alternative routes, we fit a mixture of gamma distributions and compare the behavior of the optimal departure time choices and travel time reliability ratio curves induced by the different utility specifications.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100162"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144879351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Design tasks and their complexity for the European Train Control System with Hybrid Train Detection 欧洲混合列车检测列车控制系统的设计任务及其复杂性
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100161
Stefan Engels , Tom Peham , Judith Przigoda , Nils Przigoda , Robert Wille
Railway networks have become increasingly important in recent times, especially in moving freight and public transportation from road traffic and planes to more environmentally friendly trains. Since expanding the global railway network is time- and resource-consuming, maximizing the rail capacity of the existing infrastructure is desirable. However, simply running more trains is infeasible as certain constraints enforced by the train control system must be satisfied. The capacity of a network depends (amongst others) on the distance between trains allowed by this safety system. While most signaling systems rely on fixed blocks defined by costly hardware, new specifications provided by Level 2 with Hybrid Train Detection of the European Train Control System (ETCS L2 HTD), formerly known as ETCS Hybrid Level 3, allow the usage of virtual subsections. This additional degree of freedom allows for shorter train following times and, thus, more trains on existing railway tracks. On the other hand, new design tasks arise on which automated methods might be helpful for designers of modern railway networks. However, although first approaches exist that solve design problems arising within ETCS L2 HTD, neither formal descriptions nor results on the computational complexity of the corresponding design tasks exist. In this paper, we fill this gap by providing a formal description of design tasks for ETCS L2 HTD and proof that these tasks are NP-complete or NP-hard, respectively. By that, we are providing a solid basis for the future development of methods to solve those tasks, which will be integrated into the Munich Train Control Toolkit available open-source on GitHub at https://github.com/cda-tum/mtct.
近年来,铁路网络变得越来越重要,特别是在将货运和公共交通从公路交通和飞机转移到更环保的火车方面。由于扩大全球铁路网需要耗费时间和资源,因此,最大限度地提高现有基础设施的铁路运力是可取的。然而,单纯地增加列车数量是不可行的,因为列车控制系统必须满足一定的约束条件。网络的容量(除其他外)取决于该安全系统允许的列车之间的距离。虽然大多数信号系统依赖于由昂贵硬件定义的固定模块,但欧洲列车控制系统(ETCS L2 HTD)的混合列车检测2级(以前称为ETCS混合3级)提供的新规范允许使用虚拟分段。这种额外的自由度允许更短的列车跟随时间,从而使更多的列车在现有的铁路轨道上运行。另一方面,在新的设计任务中,自动化方法可能会对现代铁路网的设计者有所帮助。然而,尽管存在解决ETCS L2 HTD中出现的设计问题的第一种方法,但没有关于相应设计任务的计算复杂性的正式描述和结果。在本文中,我们通过提供ETCS L2 HTD设计任务的正式描述并证明这些任务分别是np完全或np困难来填补这一空白。通过这种方式,我们为解决这些任务的方法的未来发展提供了坚实的基础,这些方法将集成到慕尼黑列车控制工具包中,GitHub上的开源地址为https://github.com/cda-tum/mtct。
{"title":"Design tasks and their complexity for the European Train Control System with Hybrid Train Detection","authors":"Stefan Engels ,&nbsp;Tom Peham ,&nbsp;Judith Przigoda ,&nbsp;Nils Przigoda ,&nbsp;Robert Wille","doi":"10.1016/j.ejtl.2025.100161","DOIUrl":"10.1016/j.ejtl.2025.100161","url":null,"abstract":"<div><div>Railway networks have become increasingly important in recent times, especially in moving freight and public transportation from road traffic and planes to more environmentally friendly trains. Since expanding the global railway network is time- and resource-consuming, maximizing the rail capacity of the existing infrastructure is desirable. However, simply running more trains is infeasible as certain constraints enforced by the train control system must be satisfied. The capacity of a network depends (amongst others) on the distance between trains allowed by this safety system. While most signaling systems rely on fixed blocks defined by costly hardware, new specifications provided by Level 2 with Hybrid Train Detection of the European Train Control System (ETCS L2 HTD), formerly known as ETCS Hybrid Level 3, allow the usage of virtual subsections. This additional degree of freedom allows for shorter train following times and, thus, more trains on existing railway tracks. On the other hand, new design tasks arise on which automated methods might be helpful for designers of modern railway networks. However, although first approaches exist that solve design problems arising within ETCS L2 HTD, neither formal descriptions nor results on the computational complexity of the corresponding design tasks exist. In this paper, we fill this gap by providing a formal description of design tasks for ETCS L2 HTD and proof that these tasks are NP-complete or NP-hard, respectively. By that, we are providing a solid basis for the future development of methods to solve those tasks, which will be integrated into the <em>Munich Train Control Toolkit</em> available open-source on GitHub at <span><span>https://github.com/cda-tum/mtct</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100161"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144548727","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
50 years of Operations Research for the tactical planning of consolidation-based freight transportation 集散货运战术规划运筹学研究50年
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100157
Teodor Gabriel Crainic, Walter Rei
Consolidation-based freight transportation supports a large and valuable part of world trade, over short, medium, long, and intercontinental distances, which all societies depend on and thrive on. It is carried out by carriers that supply the resources and services that meet the demands expressed by shippers. Consolidation aims at increased operational and economic efficiency, by combining cargo of different shippers into the same loading units for their complete or partial journeys. The scope of this paper is consolidation-based freight transport and the tactical planning challenges faced by carriers, who need to design a set of scheduled services that profitably and efficiently align the allocation of resources with anticipated shipping needs over a medium to long-term horizon. The tactical plan then guides day-to-day operations and informs strategic decisions. Building it represents a very complex problem, however, that requires powerful decision-support tools. Operations Research, O.R., has a long and rich history of fruitful interactions with the decision-making and planning of freight transportation, leading to significant methodological developments and delivering high-quality solutions within the necessary decision-making time frames. The paper focuses on this history, emphasizing the developments in Service Network Design, SND, the primary O.R. methodology proposed to address the challenges of tactical planning problems pertinent to consolidation-based freight transportation systems. The paper is structured to explore key dimensions in the inherent complexity of carrier tactical planning and the SND innovations developed to address them. These dimensions include the explicit consideration of temporal aspects of system elements and dynamics; integrative decision making, particularly in managing the resources carriers require to support their services and operations; and accounting for the uncertainty that directly impacts the planning of consolidation-based freight transportation systems. The paper offers insights into the main developments over the last 50 years and identifies promising research avenues.
以联运为基础的货物运输,在短途、中程、长途和洲际范围内,为世界贸易提供了很大一部分有价值的支持,所有社会都依赖于联运并据此繁荣发展。它是由承运人提供资源和服务来满足托运人表达的需求。通过将不同托运人的货物合并到相同的装载单元中,以完成其全部或部分旅程,目的是提高运营和经济效率。本文的范围是基于合并的货物运输和承运人所面临的战术规划挑战,承运人需要设计一套计划服务,这些服务能够在中长期内有效地将资源分配与预期的运输需求相一致。然后,战术计划指导日常行动,并为战略决策提供信息。然而,构建它代表了一个非常复杂的问题,需要强大的决策支持工具。运筹学在货运决策和规划方面有着悠久而丰富的互动历史,导致了重要的方法发展,并在必要的决策时间框架内提供了高质量的解决方案。本文着重于这段历史,强调了服务网络设计(SND)的发展,SND是提出的主要O.R.方法,用于解决与基于合并的货运系统相关的战术规划问题的挑战。本文旨在探讨航母战术规划固有复杂性的关键维度,以及为解决这些问题而开发的SND创新。这些维度包括对系统元素和动力学的时间方面的明确考虑;综合决策,特别是在管理运营商支持其服务和运营所需的资源方面;并考虑了直接影响以合并为基础的货运系统规划的不确定性。本文提供了对过去50年主要发展的见解,并确定了有前途的研究途径。
{"title":"50 years of Operations Research for the tactical planning of consolidation-based freight transportation","authors":"Teodor Gabriel Crainic,&nbsp;Walter Rei","doi":"10.1016/j.ejtl.2025.100157","DOIUrl":"10.1016/j.ejtl.2025.100157","url":null,"abstract":"<div><div>Consolidation-based freight transportation supports a large and valuable part of world trade, over short, medium, long, and intercontinental distances, which all societies depend on and thrive on. It is carried out by carriers that supply the resources and services that meet the demands expressed by shippers. Consolidation aims at increased operational and economic efficiency, by combining cargo of different shippers into the same loading units for their complete or partial journeys. The scope of this paper is consolidation-based freight transport and the tactical planning challenges faced by carriers, who need to design a set of scheduled services that profitably and efficiently align the allocation of resources with anticipated shipping needs over a medium to long-term horizon. The tactical plan then guides day-to-day operations and informs strategic decisions. Building it represents a very complex problem, however, that requires powerful decision-support tools. Operations Research, O.R., has a long and rich history of fruitful interactions with the decision-making and planning of freight transportation, leading to significant methodological developments and delivering high-quality solutions within the necessary decision-making time frames. The paper focuses on this history, emphasizing the developments in Service Network Design, SND, the primary O.R. methodology proposed to address the challenges of tactical planning problems pertinent to consolidation-based freight transportation systems. The paper is structured to explore key dimensions in the inherent complexity of carrier tactical planning and the SND innovations developed to address them. These dimensions include the explicit consideration of temporal aspects of system elements and dynamics; integrative decision making, particularly in managing the resources carriers require to support their services and operations; and accounting for the uncertainty that directly impacts the planning of consolidation-based freight transportation systems. The paper offers insights into the main developments over the last 50 years and identifies promising research avenues.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100157"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144089439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
50 years of behavioral models for transportation and logistics 50年的运输和物流行为模型
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100156
Léa Ricard, Michel Bierlaire
Fifty years ago, transportation and logistics problems were primarily analyzed either from a supply-side or a demand-side perspective, with the fields of operations research and demand modeling evolving separately. Since then, there has been a growing interest in behavioral optimization models, aiming to integrate both supply and demand aspects. The purpose of this survey is to offer a historical perspective on the evolution of behavioral optimization models in transportation and logistics. It does so by delving into significant works in demand modeling and choice-based optimization, highlighting their interconnections. In particular, we focus on three important optimization applications, namely the facility location problem, the airline scheduling and fleet assignment problem, and the urban transportation planning problem. Additionally, we identify potential avenues for future research to bridge existing gaps in the literature and promote behavioral models in transportation and logistics.
50年前,运输和物流问题主要是从供给侧或需求侧的角度进行分析,运筹学和需求建模领域分别发展。从那时起,人们对行为优化模型越来越感兴趣,旨在整合供给和需求方面。本调查的目的是为运输和物流行为优化模型的演变提供一个历史视角。它通过深入研究需求建模和基于选择的优化方面的重要工作,突出它们的相互联系来做到这一点。我们特别关注了三个重要的优化应用,即设施选址问题、航空公司调度和机队分配问题以及城市交通规划问题。此外,我们确定了未来研究的潜在途径,以弥合文献中的现有空白,并促进运输和物流中的行为模型。
{"title":"50 years of behavioral models for transportation and logistics","authors":"Léa Ricard,&nbsp;Michel Bierlaire","doi":"10.1016/j.ejtl.2025.100156","DOIUrl":"10.1016/j.ejtl.2025.100156","url":null,"abstract":"<div><div>Fifty years ago, transportation and logistics problems were primarily analyzed either from a supply-side or a demand-side perspective, with the fields of operations research and demand modeling evolving separately. Since then, there has been a growing interest in behavioral optimization models, aiming to integrate both supply and demand aspects. The purpose of this survey is to offer a historical perspective on the evolution of behavioral optimization models in transportation and logistics. It does so by delving into significant works in demand modeling and choice-based optimization, highlighting their interconnections. In particular, we focus on three important optimization applications, namely the facility location problem, the airline scheduling and fleet assignment problem, and the urban transportation planning problem. Additionally, we identify potential avenues for future research to bridge existing gaps in the literature and promote behavioral models in transportation and logistics.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100156"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143739186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Integrated optimization of timetabling and Electric Vehicle Scheduling 调度与电动汽车调度的集成优化
IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100168
Vladimir Stadnichuk , Jenny Segschneider , Arie M.C.A. Koster , Grit Walther
We tackle the integrated planning problem of periodic timetabling and electric vehicle scheduling, crucial for cities transitioning to electric bus fleets. Given existing timetables, we allow only minor modifications and propose an iterative solution approach that addresses the Electric Vehicle Scheduling Problem (EVSP) in each iteration. Due to the NP-hard nature of EVSP, we employ well-established heuristics and evaluate the quality of the solutions obtained. Specifically, we establish tight approximation bounds for certain iterative heuristics that first solve the Vehicle Scheduling Problem and subsequently adjust solutions to meet battery constraints. We make several key contributions: We provide general insights into heuristic solution quality, establish theoretical performance bounds, and validate these findings through a case study using real-world data from Aachen, Germany. Additionally, we employ our iterative framework to derive managerial insights for bus operators in Aachen by quantifying potential gains from adjusting the timetable to support the transition to a fully electric bus fleet.
我们解决了定期时间表和电动汽车调度的综合规划问题,这对城市向电动公交车队过渡至关重要。给定现有的时间表,我们只允许微小的修改,并提出一个迭代的解决方案,在每次迭代中解决电动汽车调度问题(EVSP)。由于EVSP的NP-hard性质,我们采用完善的启发式方法并评估获得的解的质量。具体来说,我们建立了一些迭代启发式算法的严密逼近边界,这些迭代启发式算法首先解决车辆调度问题,然后调整解以满足电池约束。我们做出了几个关键贡献:我们提供了启发式解决方案质量的一般见解,建立了理论性能界限,并通过使用来自德国亚琛的实际数据的案例研究验证了这些发现。此外,我们采用迭代框架,通过量化调整时间表以支持向全电动公交车队过渡的潜在收益,为亚琛公交运营商提供管理见解。
{"title":"Integrated optimization of timetabling and Electric Vehicle Scheduling","authors":"Vladimir Stadnichuk ,&nbsp;Jenny Segschneider ,&nbsp;Arie M.C.A. Koster ,&nbsp;Grit Walther","doi":"10.1016/j.ejtl.2025.100168","DOIUrl":"10.1016/j.ejtl.2025.100168","url":null,"abstract":"<div><div>We tackle the integrated planning problem of periodic timetabling and electric vehicle scheduling, crucial for cities transitioning to electric bus fleets. Given existing timetables, we allow only minor modifications and propose an iterative solution approach that addresses the Electric Vehicle Scheduling Problem (EVSP) in each iteration. Due to the NP-hard nature of EVSP, we employ well-established heuristics and evaluate the quality of the solutions obtained. Specifically, we establish tight approximation bounds for certain iterative heuristics that first solve the Vehicle Scheduling Problem and subsequently adjust solutions to meet battery constraints. We make several key contributions: We provide general insights into heuristic solution quality, establish theoretical performance bounds, and validate these findings through a case study using real-world data from Aachen, Germany. Additionally, we employ our iterative framework to derive managerial insights for bus operators in Aachen by quantifying potential gains from adjusting the timetable to support the transition to a fully electric bus fleet.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100168"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145579013","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explaining the performance impact of opportunity costs approximation in integrated demand management and vehicle routing 解释机会成本近似在综合需求管理和车辆路线中的性能影响
IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100166
David Fleckenstein , Robert Klein , Vienna Klein , Claudius Steinhardt
The widespread adoption of digital distribution channels both enables and forces more and more logistics service providers to manage booking processes actively to maintain competitiveness. As a result, their operational planning is no longer limited to solving vehicle routing problems. Instead, demand management decisions and vehicle routing decisions are optimized integratively with the aim of maximizing revenue and minimizing fulfillment cost. The resulting integrated demand management and vehicle routing problems (i-DMVRPs) can be formulated as Markov decision process models and, theoretically, can be solved via the well-known Bellman equation. Unfortunately, the Bellman equation is intractable for realistic-sized instances. Thus, in the literature, i-DMVRPs are often addressed via decomposition-based solution approaches involving an opportunity costs approximation as a key component. Despite its importance, to the best of our knowledge, there is no technique to systematically analyze how the accuracy of the opportunity costs approximation affects the performance, e.g., the profit, the revenue, the number of accepted customers, or the cost of the overall logistics system, which is represented by a vehicle routing problem, nor are there general guidelines on when to apply which class of approximation approach. In this work, we address this research gap by proposing an explainability technique that quantifies and visualizes the magnitude of approximation errors, their immediate impact on the underlying vehicle routing problem and its profitability, and the relevance of approximation errors in specific regions of the state space. Exploiting reward decomposition, it further yields a characterization of different types of approximation errors. Applying the technique to a generic i-DMVRP in a full-factorial computational study and comparing the results with observations in existing literature, we show that the technique contributes to better explaining algorithmic performance and provides guidance for the algorithm selection and development process.
数字分销渠道的广泛采用,既促使也迫使越来越多的物流服务提供商积极管理预订流程,以保持竞争力。因此,他们的业务规划不再局限于解决车辆路线问题。相反,需求管理决策和车辆路线决策是为了实现收益最大化和实现成本最小化而综合优化的。由此产生的综合需求管理和车辆路线问题(i- dmvrp)可以被表述为马尔可夫决策过程模型,理论上可以通过著名的Bellman方程来解决。不幸的是,对于现实大小的实例,Bellman方程是难以处理的。因此,在文献中,i- dmvrp通常通过基于分解的解决方案来解决,其中包括机会成本近似作为关键组成部分。尽管机会成本近似很重要,但据我们所知,目前还没有一种技术可以系统地分析机会成本近似的准确性如何影响绩效,例如利润、收入、可接受客户的数量或整个物流系统的成本(由车辆路线问题表示),也没有关于何时应用哪类近似方法的一般指导方针。在这项工作中,我们通过提出一种可解释性技术来解决这一研究差距,该技术可以量化和可视化近似误差的大小,它们对潜在车辆路线问题及其盈利能力的直接影响,以及近似误差在状态空间特定区域的相关性。利用奖励分解,它进一步产生了不同类型的近似误差的特征。将该技术应用于通用i-DMVRP的全因子计算研究,并将结果与现有文献中的观察结果进行比较,我们表明该技术有助于更好地解释算法性能,并为算法选择和开发过程提供指导。
{"title":"Explaining the performance impact of opportunity costs approximation in integrated demand management and vehicle routing","authors":"David Fleckenstein ,&nbsp;Robert Klein ,&nbsp;Vienna Klein ,&nbsp;Claudius Steinhardt","doi":"10.1016/j.ejtl.2025.100166","DOIUrl":"10.1016/j.ejtl.2025.100166","url":null,"abstract":"<div><div>The widespread adoption of digital distribution channels both enables and forces more and more logistics service providers to manage booking processes actively to maintain competitiveness. As a result, their operational planning is no longer limited to solving vehicle routing problems. Instead, demand management decisions and vehicle routing decisions are optimized integratively with the aim of maximizing revenue and minimizing fulfillment cost. The resulting integrated demand management and vehicle routing problems (i-DMVRPs) can be formulated as Markov decision process models and, theoretically, can be solved via the well-known Bellman equation. Unfortunately, the Bellman equation is intractable for realistic-sized instances. Thus, in the literature, i-DMVRPs are often addressed via decomposition-based solution approaches involving an opportunity costs approximation as a key component. Despite its importance, to the best of our knowledge, there is no technique to systematically analyze how the accuracy of the opportunity costs approximation affects the performance, e.g., the profit, the revenue, the number of accepted customers, or the cost of the overall logistics system, which is represented by a vehicle routing problem, nor are there general guidelines on when to apply which class of approximation approach. In this work, we address this research gap by proposing an explainability technique that quantifies and visualizes the magnitude of approximation errors, their immediate impact on the underlying vehicle routing problem and its profitability, and the relevance of approximation errors in specific regions of the state space. Exploiting reward decomposition, it further yields a characterization of different types of approximation errors. Applying the technique to a generic i-DMVRP in a full-factorial computational study and comparing the results with observations in existing literature, we show that the technique contributes to better explaining algorithmic performance and provides guidance for the algorithm selection and development process.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100166"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145319637","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Computing all shortest passenger routes with a tropical Dijkstra algorithm 用热带Dijkstra算法计算所有最短客运路线
IF 2.7 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100163
Berenike Masing , Niels Lindner, Enrico Bortoletto
Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs on their arcs and is closely linked to multi-objective optimisation. We introduce a Dijkstra algorithm based on polynomials over the tropical semiring that computes complete or minimal sets of efficient paths. We demonstrate that this approach is computationally feasible by employing it on the public transport network of the city of Wuppertal and instances of the benchmarking set TimPassLib, and we evaluate the resulting sets of passenger routes.
给定一个公共交通网络,当考虑到所有可能的时间表时,哪些和多少条客运路线可能是最短的路径?这个问题导致了图的最短路径问题,图的弧线上有区间代价,并且与多目标优化密切相关。我们介绍了一种基于热带半环上多项式的Dijkstra算法,用于计算有效路径的完全集或最小集。我们通过在伍珀塔尔市的公共交通网络和基准集TimPassLib的实例上使用它来证明这种方法在计算上是可行的,并且我们评估了结果集的乘客路线。
{"title":"Computing all shortest passenger routes with a tropical Dijkstra algorithm","authors":"Berenike Masing ,&nbsp;Niels Lindner,&nbsp;Enrico Bortoletto","doi":"10.1016/j.ejtl.2025.100163","DOIUrl":"10.1016/j.ejtl.2025.100163","url":null,"abstract":"<div><div>Given a public transportation network, which and how many passenger routes can potentially be shortest paths, when all possible timetables are taken into account? This question leads to shortest path problems on graphs with interval costs on their arcs and is closely linked to multi-objective optimisation. We introduce a Dijkstra algorithm based on polynomials over the tropical semiring that computes complete or minimal sets of efficient paths. We demonstrate that this approach is computationally feasible by employing it on the public transport network of the city of Wuppertal and instances of the benchmarking set <span>TimPassLib</span>, and we evaluate the resulting sets of passenger routes.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100163"},"PeriodicalIF":2.7,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144932198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fifty years on maritime transportation 五十年的海上运输
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2024.100148
Marielle Christiansen , Kjetil Fagerholt , David Pisinger
This paper gives a detailed overview of the last 50 years of research in maritime transportation, with special focus on operations research techniques applied to the seaside operations. We describe the evolution in industrial, tramp and liner shipping, identify the driving trends, and discuss future challenges.
本文详细概述了近50年来海上运输的研究,特别侧重于运筹学技术在海边作业中的应用。我们描述了工业、不定期和班轮运输的演变,确定了驱动趋势,并讨论了未来的挑战。
{"title":"Fifty years on maritime transportation","authors":"Marielle Christiansen ,&nbsp;Kjetil Fagerholt ,&nbsp;David Pisinger","doi":"10.1016/j.ejtl.2024.100148","DOIUrl":"10.1016/j.ejtl.2024.100148","url":null,"abstract":"<div><div>This paper gives a detailed overview of the last 50 years of research in maritime transportation, with special focus on operations research techniques applied to the seaside operations. We describe the evolution in industrial, tramp and liner shipping, identify the driving trends, and discuss future challenges.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100148"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143104237","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
50 years of OR in railway timetabling and rolling stock planning 50年的铁路调度和车辆规划经验
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2025-01-01 DOI: 10.1016/j.ejtl.2025.100155
Pedro José Correia Duarte , Stéphane Dauzère-Pérès , Dennis Huisman , Carlo Mannino , Giorgio Sartor , Norman Weik , Philipp Widmann
This survey paper discusses the literature on Operations Research (OR) models and algorithms for railway planning in the last decades. Since infrastructure and rolling stock are two resources that are both very capital-intensive and characterize the railway system, we focus on timetabling and rolling stock planning problems. For timetabling, we also classify the literature among two dimensions, namely the decision level (strategic, tactical, operational) and the type of network infrastructure (dependent routes, independent routes). We also discuss robustness aspects in both planning problems.
We focus the discussion of the literature on the applicability of the models in the European context, where different types of trains (high-speed passenger trains, high-frequent suburban trains and freight trains) often share the same tracks and the organization of the railways is usually split between an infrastructure manager and one or more railway undertakings operating the trains.
We conclude the paper with some challenges and future research directions.
本文综述了近几十年来有关铁路规划运筹学模型和算法的文献。由于基础设施和铁路车辆是两种资源,它们都是资本密集型的,并且是铁路系统的特征,因此我们将重点放在时间表和铁路车辆规划问题上。对于时间表,我们也将文献分为两个维度,即决策水平(战略,战术,操作)和网络基础设施类型(依赖路线,独立路线)。我们还讨论了这两个规划问题的鲁棒性方面。我们将文献的讨论重点放在模型在欧洲背景下的适用性上,在欧洲,不同类型的列车(高速客运列车、高频郊区列车和货运列车)通常共享相同的轨道,铁路的组织通常在基础设施管理者和运营列车的一个或多个铁路企业之间进行分割。最后,提出了本文面临的挑战和未来的研究方向。
{"title":"50 years of OR in railway timetabling and rolling stock planning","authors":"Pedro José Correia Duarte ,&nbsp;Stéphane Dauzère-Pérès ,&nbsp;Dennis Huisman ,&nbsp;Carlo Mannino ,&nbsp;Giorgio Sartor ,&nbsp;Norman Weik ,&nbsp;Philipp Widmann","doi":"10.1016/j.ejtl.2025.100155","DOIUrl":"10.1016/j.ejtl.2025.100155","url":null,"abstract":"<div><div>This survey paper discusses the literature on Operations Research (OR) models and algorithms for railway planning in the last decades. Since infrastructure and rolling stock are two resources that are both very capital-intensive and characterize the railway system, we focus on timetabling and rolling stock planning problems. For timetabling, we also classify the literature among two dimensions, namely the decision level (strategic, tactical, operational) and the type of network infrastructure (dependent routes, independent routes). We also discuss robustness aspects in both planning problems.</div><div>We focus the discussion of the literature on the applicability of the models in the European context, where different types of trains (high-speed passenger trains, high-frequent suburban trains and freight trains) often share the same tracks and the organization of the railways is usually split between an infrastructure manager and one or more railway undertakings operating the trains.</div><div>We conclude the paper with some challenges and future research directions.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"14 ","pages":"Article 100155"},"PeriodicalIF":2.1,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143578362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
EURO Journal on Transportation and Logistics
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
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