首页 > 最新文献

EURO Journal on Transportation and Logistics最新文献

英文 中文
A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport 铁路货运中机车调度和司机分配一体化的分解方法
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100145
Andreas Bärmann , Alexander Martin , Jonasz Staszek
In this work, we consider the integrated problem of locomotive scheduling and driver assignment in rail freight companies. Our aim is to compute an optimal simultaneous assignment of locomotives and drivers to the trains listed in a given order-book. Mathematically, this leads to the combination of a set-packing problem with compatibility constraints and a multi-commodity-flow problem. We develop a binary-programming formulation to model the given task and improve it by performing a clique-based tightening of the original set-packing inequalities. The objective function of this model makes sure that as many trains as possible are running. To handle the computational complexity of the problem, we introduce a novel decomposition approach which decomposes the problem into a master locomotive scheduling problem and a subproblem for driver assignment. It exploits the fact that the master problem is empirically much easier to solve than the subproblem. For any fixed solution of the master problem, we can use the subproblem to either confirm feasibility of the master solution or to derive valid inequalities from various constraint classes to cut the infeasible master solution off and reiterate. To further improve solution times, we also develop a presolve heuristic. We demonstrate the potential of the presented method by solving a large-scale real-world problem instance provided by our industry partner DB Cargo Polska S.A., as well as a set of derived realistic instances.
在这项工作中,我们考虑的是铁路货运公司机车调度和司机分配的综合问题。我们的目标是计算出机车和司机对给定订单所列列车的最优同步分配。在数学上,这导致了一个带有兼容性约束的集合包装问题和一个多商品流问题的结合。我们开发了一种二元编程模型来模拟给定任务,并通过对原始的集合包装不等式进行基于类群的紧缩来改进该模型。该模型的目标函数确保尽可能多的列车运行。为了解决该问题的计算复杂性,我们引入了一种新颖的分解方法,将该问题分解为主机车调度问题和司机分配子问题。它利用了主问题比子问题更容易解决这一事实。对于主问题的任何固定解,我们都可以利用子问题来确认主问题解的可行性,或者从各种约束类别中推导出有效的不等式,以切断不可行的主问题解,并重新进行求解。为了进一步缩短求解时间,我们还开发了一种预解启发式。我们通过解决我们的行业合作伙伴 DB Cargo Polska S.A. 提供的一个大型实际问题实例以及一组衍生的现实实例,展示了所介绍方法的潜力。
{"title":"A decomposition approach for integrated locomotive scheduling and driver assignment in rail freight transport","authors":"Andreas Bärmann ,&nbsp;Alexander Martin ,&nbsp;Jonasz Staszek","doi":"10.1016/j.ejtl.2024.100145","DOIUrl":"10.1016/j.ejtl.2024.100145","url":null,"abstract":"<div><div>In this work, we consider the integrated problem of locomotive scheduling and driver assignment in rail freight companies. Our aim is to compute an optimal simultaneous assignment of locomotives and drivers to the trains listed in a given order-book. Mathematically, this leads to the combination of a set-packing problem with compatibility constraints and a multi-commodity-flow problem. We develop a binary-programming formulation to model the given task and improve it by performing a clique-based tightening of the original set-packing inequalities. The objective function of this model makes sure that as many trains as possible are running. To handle the computational complexity of the problem, we introduce a novel decomposition approach which decomposes the problem into a master locomotive scheduling problem and a subproblem for driver assignment. It exploits the fact that the master problem is empirically much easier to solve than the subproblem. For any fixed solution of the master problem, we can use the subproblem to either confirm feasibility of the master solution or to derive valid inequalities from various constraint classes to cut the infeasible master solution off and reiterate. To further improve solution times, we also develop a presolve heuristic. We demonstrate the potential of the presented method by solving a large-scale real-world problem instance provided by our industry partner DB Cargo Polska S.A., as well as a set of derived realistic instances.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100145"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561283","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
The role of traffic simulation in shaping effective and sustainable innovative urban delivery interventions 交通模拟在形成有效和可持续的创新型城市交付干预措施中的作用
IF 2.4 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100130
Yijie Su , Hadi Ghaderi , Hussein Dia

Cities around the globe face major last mile delivery (LMD) challenges as a result of surging online commerce activity, increased parcel delivery demands, lack of parking capacity, and severe traffic congestion particularly in inner city areas. Although a number of innovative solutions and pathways have been proposed to address these challenges, their full impacts are still not well understood due to the lack of comprehensive field studies and real-world data on their performance. Traffic simulation techniques, which are widely used to model and evaluate the impacts of a wide range of urban mobility interventions, offer opportunities to investigate the impacts of city logistics interventions. However, research evidence on this topic remains fragmented, hindering constructive analysis of the role of traffic simulation and modelling in shaping sustainable urban delivery interventions. Given the growing research interest in the nexus of traffic simulation and city logistics, this paper aims to identify and evaluate primary studies related to the simulation forms, evolution, effectiveness, and their feasibility in evaluating the impacts of urban delivery interventions. The paper achieves this through a holistic systematic review that consolidates diverse perspectives on the topic. The paper analysed 79 articles, published by December 2023, that have used traffic simulation to model and evaluate a wide range of city logistics interventions. The review identified five main themes in the literature surrounding development and applications of traffic simulation, namely their use in evaluating the role of information and communication technologies, evaluations of advances in types and forms of delivery vehicles, their application in supporting policy interventions, evaluations of innovations in city logistics facilities and impacts of the collaborative economy. The review also helped in gaining insights about urban delivery interventions and their impacts as stand-alone or in combination with other solutions. The analysis confirms the validity and versatility of traffic simulation as an approach to model the impacts of urban delivery interventions on traffic flow, delivery service and customers, but also the sustainability implications of interventions. The paper also provides a future research agenda to guide future studies in developing and evaluating applications of various interventions with the leverage of traffic simulation.

由于在线商务活动激增、包裹递送需求增加、停车场容量不足以及严重的交通拥堵(尤其是在城市内部地区),全球各地的城市都面临着最后一英里递送(LMD)的重大挑战。尽管已经提出了许多创新解决方案和途径来应对这些挑战,但由于缺乏全面的实地研究和有关其性能的实际数据,人们对它们的全面影响仍不甚了解。交通模拟技术被广泛用于模拟和评估各种城市交通干预措施的影响,为研究城市物流干预措施的影响提供了机会。然而,有关这一主题的研究证据仍然零散,阻碍了对交通模拟和建模在形成可持续城市配送干预措施中的作用进行建设性分析。鉴于对交通仿真与城市物流之间关系的研究兴趣与日俱增,本文旨在确定和评估与仿真形式、演变、有效性及其在评估城市配送干预措施影响方面的可行性相关的主要研究。本文通过全面系统的综述,整合了有关该主题的各种观点,从而实现了这一目标。论文分析了截至 2023 年 12 月发表的 79 篇文章,这些文章利用交通仿真对各种城市物流干预措施进行了建模和评估。综述确定了围绕交通仿真开发和应用的五大文献主题,即用于评估信息和通信技术的作用、评估配送车辆类型和形式的进步、应用于支持政策干预、评估城市物流设施的创新以及协作经济的影响。审查还有助于深入了解城市配送干预措施及其作为独立解决方案或与其他解决方案相结合所产生的影响。分析证实了交通模拟作为模拟城市配送干预措施对交通流量、配送服务和客户影响的一种方法的有效性和多功能性,以及干预措施的可持续性影响。本文还提出了未来的研究议程,以指导今后利用交通模拟开发和评估各种干预措施应用的研究。
{"title":"The role of traffic simulation in shaping effective and sustainable innovative urban delivery interventions","authors":"Yijie Su ,&nbsp;Hadi Ghaderi ,&nbsp;Hussein Dia","doi":"10.1016/j.ejtl.2024.100130","DOIUrl":"10.1016/j.ejtl.2024.100130","url":null,"abstract":"<div><p>Cities around the globe face major last mile delivery (LMD) challenges as a result of surging online commerce activity, increased parcel delivery demands, lack of parking capacity, and severe traffic congestion particularly in inner city areas. Although a number of innovative solutions and pathways have been proposed to address these challenges, their full impacts are still not well understood due to the lack of comprehensive field studies and real-world data on their performance. Traffic simulation techniques, which are widely used to model and evaluate the impacts of a wide range of urban mobility interventions, offer opportunities to investigate the impacts of city logistics interventions. However, research evidence on this topic remains fragmented, hindering constructive analysis of the role of traffic simulation and modelling in shaping sustainable urban delivery interventions. Given the growing research interest in the nexus of traffic simulation and city logistics, this paper aims to identify and evaluate primary studies related to the simulation forms, evolution, effectiveness, and their feasibility in evaluating the impacts of urban delivery interventions. The paper achieves this through a holistic systematic review that consolidates diverse perspectives on the topic. The paper analysed 79 articles, published by December 2023, that have used traffic simulation to model and evaluate a wide range of city logistics interventions. The review identified five main themes in the literature surrounding development and applications of traffic simulation, namely their use in evaluating the role of information and communication technologies, evaluations of advances in types and forms of delivery vehicles, their application in supporting policy interventions, evaluations of innovations in city logistics facilities and impacts of the collaborative economy. The review also helped in gaining insights about urban delivery interventions and their impacts as stand-alone or in combination with other solutions. The analysis confirms the validity and versatility of traffic simulation as an approach to model the impacts of urban delivery interventions on traffic flow, delivery service and customers, but also the sustainability implications of interventions. The paper also provides a future research agenda to guide future studies in developing and evaluating applications of various interventions with the leverage of traffic simulation.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100130"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000050/pdfft?md5=153f2eeaae2dedbd9d5892150aafc08e&pid=1-s2.0-S2192437624000050-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140125317","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
Bundles generation and pricing in crowdshipping 众包的生成和定价
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100142
Giusy Macrina , Claudia Archetti , Francesca Guerriero

Crowdshipping is a new delivery paradigm that exploits the capacity of ordinary people who offer their own vehicles and free time to perform deliveries against compensation. In this work, we consider a peer-to-peer logistic platform where a company receives orders from its customers and assigns them to occasional drivers (ODs), or crowdshippers, who perform the delivery operations. We first investigate the problem of deciding how the orders should be partitioned into bundles, where a bundle is a set of orders assigned to the same OD. Then, we focus on the problem of determining the compensation associated with each bundle, with the purpose of minimizing the total delivery costs. The pricing scheme is based on the assumption that each OD is associated with a willingness-to-serve function, which is modeled as a random variable that gives the probability that the OD accepts to deliver the bundle given the compensation value. This random variable captures the estimation of the willingness-to-serve function that the company has elaborated, for example on the basis of historical data. If the compensation offered by the company is greater than or equal to the willingness-to-serve value, the OD performs the delivery, otherwise she/he refuses. In case no OD is available to deliver a bundle, then all packages in the bundle are offered to a third-party delivery company. We simulate two auction systems for the assignment of bundles to ODs: a static and a dynamic auction. In exhaustive simulation tests, we compare different pricing schemes as well as the two auction systems, and outline several managerial insights.

众包送货是一种新的送货模式,它利用普通人的能力,让他们提供自己的车辆和空闲时间,进行有偿送货。在这项工作中,我们考虑了一个点对点物流平台,在这个平台上,一家公司接收客户的订单,并将其分配给临时司机(OD)或众包送货员,由他们执行送货操作。我们首先研究的问题是决定如何将订单划分为捆绑订单,其中捆绑订单是指分配给同一 OD 的一组订单。然后,我们重点研究确定与每个捆绑相关的补偿问题,目的是最大限度地降低总配送成本。定价方案基于这样一个假设,即每个 OD 都与服务意愿函数相关联,该函数被建模为一个随机变量,给出了 OD 在给定补偿值的情况下接受交付捆绑订单的概率。该随机变量反映了公司对服务意愿函数的估计,例如根据历史数据进行的估计。如果公司提供的补偿大于或等于服务意愿值,则外包商执行交付,否则拒绝交付。如果没有 OD 可以递送捆绑包裹,那么捆绑包裹中的所有包裹都会提供给第三方递送公司。我们模拟了两种将包裹分配给 OD 的拍卖系统:静态拍卖和动态拍卖。在详尽的模拟测试中,我们对不同的定价方案以及两种拍卖系统进行了比较,并概述了一些管理见解。
{"title":"Bundles generation and pricing in crowdshipping","authors":"Giusy Macrina ,&nbsp;Claudia Archetti ,&nbsp;Francesca Guerriero","doi":"10.1016/j.ejtl.2024.100142","DOIUrl":"10.1016/j.ejtl.2024.100142","url":null,"abstract":"<div><p>Crowdshipping is a new delivery paradigm that exploits the capacity of ordinary people who offer their own vehicles and free time to perform deliveries against compensation. In this work, we consider a peer-to-peer logistic platform where a company receives orders from its customers and assigns them to occasional drivers (ODs), or crowdshippers, who perform the delivery operations. We first investigate the problem of deciding how the orders should be partitioned into bundles, where a bundle is a set of orders assigned to the same OD. Then, we focus on the problem of determining the compensation associated with each bundle, with the purpose of minimizing the total delivery costs. The pricing scheme is based on the assumption that each OD is associated with a <em>willingness-to-serve</em> function, which is modeled as a random variable that gives the probability that the OD accepts to deliver the bundle given the compensation value. This random variable captures the estimation of the <em>willingness-to-serve</em> function that the company has elaborated, for example on the basis of historical data. If the compensation offered by the company is greater than or equal to the <em>willingness-to-serve</em> value, the OD performs the delivery, otherwise she/he refuses. In case no OD is available to deliver a bundle, then all packages in the bundle are offered to a third-party delivery company. We simulate two auction systems for the assignment of bundles to ODs: a static and a dynamic auction. In exhaustive simulation tests, we compare different pricing schemes as well as the two auction systems, and outline several managerial insights.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100142"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000177/pdfft?md5=c5cefe6620309fb3b6c6fb0260aced5a&pid=1-s2.0-S2192437624000177-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142021465","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
Optimizing Autonomous Transfer Hub Networks: Quantifying the potential impact of self-driving trucks 优化自动驾驶转运枢纽网络:量化自动驾驶卡车的潜在影响
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100141
Chungjae Lee , Kevin Dalmeijer , Pascal Van Hentenryck , Peibo Zhang

Autonomous trucks are expected to fundamentally transform the freight transportation industry. In particular, Autonomous Transfer Hub Networks (ATHNs), which combine autonomous trucks on middle miles with human-driven trucks on the first and last miles, are seen as the most likely deployment pathway for this technology. This paper presents a framework to optimize ATHN operations and evaluate the benefits of autonomous trucking. By exploiting the problem structure, this paper introduces a flow-based optimization model for this purpose that can be solved by blackbox solvers in a matter of hours. The resulting framework is easy to apply and enables the data-driven analysis of large-scale systems. The power of this approach is demonstrated on a system that spans all of the United States over a four-week horizon. The case study quantifies the potential impact of autonomous trucking and shows that ATHNs can have significant benefits over traditional transportation networks.

自动驾驶卡车有望从根本上改变货运业。尤其是自动驾驶转运枢纽网络(ATHN),它将中间里程的自动驾驶卡车与首末里程的人工驾驶卡车结合在一起,被视为该技术最有可能的部署途径。本文提出了一个优化 ATHN 运营和评估自主卡车运输效益的框架。通过利用问题结构,本文为此引入了一个基于流程的优化模型,黑盒求解器可在数小时内求解该模型。由此产生的框架易于应用,并能对大规模系统进行数据驱动分析。本文在一个为期四周、横跨全美的系统上展示了这种方法的威力。该案例研究量化了自动驾驶卡车运输的潜在影响,并表明自动驾驶运输网络与传统运输网络相比具有显著优势。
{"title":"Optimizing Autonomous Transfer Hub Networks: Quantifying the potential impact of self-driving trucks","authors":"Chungjae Lee ,&nbsp;Kevin Dalmeijer ,&nbsp;Pascal Van Hentenryck ,&nbsp;Peibo Zhang","doi":"10.1016/j.ejtl.2024.100141","DOIUrl":"10.1016/j.ejtl.2024.100141","url":null,"abstract":"<div><p>Autonomous trucks are expected to fundamentally transform the freight transportation industry. In particular, Autonomous Transfer Hub Networks (ATHNs), which combine autonomous trucks on middle miles with human-driven trucks on the first and last miles, are seen as the most likely deployment pathway for this technology. This paper presents a framework to optimize ATHN operations and evaluate the benefits of autonomous trucking. By exploiting the problem structure, this paper introduces a flow-based optimization model for this purpose that can be solved by blackbox solvers in a matter of hours. The resulting framework is easy to apply and enables the data-driven analysis of large-scale systems. The power of this approach is demonstrated on a system that spans all of the United States over a four-week horizon. The case study quantifies the potential impact of autonomous trucking and shows that ATHNs can have significant benefits over traditional transportation networks.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100141"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000165/pdfft?md5=50e7f65a716bd9bab7d80ed2f378b9a5&pid=1-s2.0-S2192437624000165-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141984797","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
Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications 优化人性化物流和制造系统:建模方法和应用综述
IF 2.4 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100136
Thibault Prunet , Nabil Absi , Valeria Borodin , Diego Cattaruzza

Historically, Operations Research (OR) discipline has mainly been focusing on economic concerns. Since the early 2000s, human considerations are gaining increasing attention, pushed by the growing societal concerns of sustainable development on the same terms as the economic and ecological ones. This paper is the first part of a work that aims at reviewing the efforts dedicated by the OR community to the integration of human factors into logistics and manufacturing systems. A focus is put on the modeling and solution approaches used to consider human characteristics, their practical relevance, and the complexity induced by their integration within optimization models. The material presented in this work has been retrieved through a semi-systematic search of the literature. Then, a comprehensive analysis of the retrieved corpus is carried out to map the related literature by class of problems encountered in logistics and manufacturing. These include warehousing, vehicle routing, scheduling, production planning, and workforce scheduling and management. We investigate the mathematical programming techniques used to integrate human factors into optimization models. Finally, a number of gaps in the literature are identified, and new suggestions on how to suitably integrate human factors in OR problems encountered in logistics and manufacturing systems are discussed.

从历史上看,运筹学(OR)学科主要关注经济问题。自 21 世纪初以来,随着社会对可持续发展的关注与对经济和生态的关注日益增加,人的因素正日益受到重视。本文是研究工作的第一部分,旨在回顾 OR 界在将人为因素融入物流和制造系统方面所做的努力。重点关注用于考虑人的特征的建模和解决方法、人的特征的实际意义,以及将人的特征纳入优化模型所带来的复杂性。这项工作中介绍的材料是通过半系统的文献检索获得的。然后,对检索到的语料进行了综合分析,按照物流和制造业中遇到的问题类别对相关文献进行了映射。这些问题包括仓储、车辆路由、调度、生产计划以及劳动力调度和管理。我们研究了将人为因素纳入优化模型的数学编程技术。最后,我们确定了文献中的一些空白,并讨论了如何在物流和制造系统中遇到的 OR 问题中适当整合人为因素的新建议。
{"title":"Optimization of human-aware logistics and manufacturing systems: A comprehensive review of modeling approaches and applications","authors":"Thibault Prunet ,&nbsp;Nabil Absi ,&nbsp;Valeria Borodin ,&nbsp;Diego Cattaruzza","doi":"10.1016/j.ejtl.2024.100136","DOIUrl":"10.1016/j.ejtl.2024.100136","url":null,"abstract":"<div><p>Historically, Operations Research (OR) discipline has mainly been focusing on economic concerns. Since the early 2000s, human considerations are gaining increasing attention, pushed by the growing societal concerns of sustainable development on the same terms as the economic and ecological ones. This paper is the first part of a work that aims at reviewing the efforts dedicated by the OR community to the integration of human factors into logistics and manufacturing systems. A focus is put on the modeling and solution approaches used to consider human characteristics, their practical relevance, and the complexity induced by their integration within optimization models. The material presented in this work has been retrieved through a semi-systematic search of the literature. Then, a comprehensive analysis of the retrieved corpus is carried out to map the related literature by class of problems encountered in logistics and manufacturing. These include warehousing, vehicle routing, scheduling, production planning, and workforce scheduling and management. We investigate the mathematical programming techniques used to integrate human factors into optimization models. Finally, a number of gaps in the literature are identified, and new suggestions on how to suitably integrate human factors in OR problems encountered in logistics and manufacturing systems are discussed.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100136"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000116/pdfft?md5=cab87a5e90f342a5477bd6eb33939078&pid=1-s2.0-S2192437624000116-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141415045","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
Stability metrics for a maritime inventory routing problem under sailing time uncertainty 航行时间不确定情况下的海上库存路由问题的稳定性指标
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100146
Homayoun Shaabani , Lars Magnus Hvattum , Gilbert Laporte , Arild Hoff
We study a multi-product maritime inventory routing problem (MIRP) with sailing time uncertainty. We explicitly consider the replanning that happens after uncertainty is revealed. The objective is to determine the stability of the adjusted plans after the occurrence of an uncertain event and to evaluate the effect of incorporating different stability metrics in the rescheduling process. Five stability metrics are introduced, and mathematical formulations of the MIRP incorporating each metric are presented. A reoptimization framework is then used to analyze the impact of each stability metric. Calculations are performed using 360 instances. The main result is that adjustments to the original plan occur at no additional cost almost 50% of the time. If decision makers want a more stable plan, they should accept a 5% cost deterioration, resulting in 20% more stable solutions.
我们研究了一个具有航行时间不确定性的多产品海上库存路由问题(MIRP)。我们明确考虑了不确定性暴露后的重新规划。我们的目标是确定不确定事件发生后调整后计划的稳定性,并评估在重新安排过程中采用不同稳定性指标的效果。本文介绍了五个稳定性指标,并给出了包含每个指标的 MIRP 数学公式。然后使用重新优化框架来分析每个稳定性指标的影响。计算使用了 360 个实例。主要结果是,对原始计划的调整几乎有 50%的时间不需要额外成本。如果决策者想要一个更稳定的计划,他们应该接受 5%的成本下降,从而获得 20% 更稳定的解决方案。
{"title":"Stability metrics for a maritime inventory routing problem under sailing time uncertainty","authors":"Homayoun Shaabani ,&nbsp;Lars Magnus Hvattum ,&nbsp;Gilbert Laporte ,&nbsp;Arild Hoff","doi":"10.1016/j.ejtl.2024.100146","DOIUrl":"10.1016/j.ejtl.2024.100146","url":null,"abstract":"<div><div>We study a multi-product maritime inventory routing problem (MIRP) with sailing time uncertainty. We explicitly consider the replanning that happens after uncertainty is revealed. The objective is to determine the stability of the adjusted plans after the occurrence of an uncertain event and to evaluate the effect of incorporating different stability metrics in the rescheduling process. Five stability metrics are introduced, and mathematical formulations of the MIRP incorporating each metric are presented. A reoptimization framework is then used to analyze the impact of each stability metric. Calculations are performed using 360 instances. The main result is that adjustments to the original plan occur at no additional cost almost 50% of the time. If decision makers want a more stable plan, they should accept a 5% cost deterioration, resulting in 20% more stable solutions.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100146"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142425625","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
Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework 利用不可行路径切割,在分支切割框架内精确解决具有现实充电功能的电动汽车路由问题
IF 2.4 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100131
Arne Schulz

The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real charging function in any point. As the piecewise linear charging function underestimates the real state-of-charge in some points, such an approximation excludes feasible solutions from the solution space. To overcome this drawback we introduce a new method to determine a piecewise linear charging function overestimating the real charging function in a way that the area between both functions is minimized as well as an adaptation of a known linearization to include the piecewise linear charging function in a branch-and-cut approach. Thereby, we include infeasible solutions in the solution space. To declare them infeasible again we check every integer solution obtained in the branch-and-cut procedure and add an infeasible path cut if the solution is infeasible for the real charging function such that the procedure terminates with an optimal solution for the real charging function. Our approach is evaluated in a computational study in which instances with up to 100 customers were solved to optimality. Moreover, we evaluate the trade-off between a more complex model formulation due to more binary variables if the number of supporting points for the piecewise linear approximation is increased and the higher approximation error if fewer supporting points are used.

本文研究了充电函数为非线性凹陷且严格单调递增的电动汽车路由问题。在文献中,非线性充电函数通常用片断线性充电函数来近似,该函数不会高估任何一点的实际充电函数。由于分片线性充电函数会低估某些点的实际充电状态,因此这种近似方法会将可行解排除在解空间之外。为了克服这一缺点,我们引入了一种新方法来确定一个高估实际充电函数的分片线性充电函数,使两个函数之间的面积最小,同时对已知的线性化方法进行调整,将分片线性充电函数纳入分支切割法中。因此,我们在求解空间中加入了不可行解。为了再次宣布它们不可行,我们会检查在分支-切割过程中获得的每个整数解,如果该解对实际充电函数不可行,则添加一个不可行路径切割,从而使该过程以实际充电函数的最优解结束。我们在一项计算研究中对我们的方法进行了评估,在这项研究中,多达 100 个客户的实例得到了最优解。此外,我们还评估了如果增加片断线性近似的支持点数量,由于二进制变量增多而导致模型表述更加复杂,以及如果使用较少的支持点,近似误差增大这两者之间的权衡。
{"title":"Using infeasible path cuts to solve Electric Vehicle Routing Problems with realistic charging functions exactly within a branch-and-cut framework","authors":"Arne Schulz","doi":"10.1016/j.ejtl.2024.100131","DOIUrl":"10.1016/j.ejtl.2024.100131","url":null,"abstract":"<div><p>The paper investigates the Electric Vehicle Routing Problem with a non-linear concave and strictly monotonic increasing charging function. In the literature, the non-linear charging function is typically approximated by a piecewise linear charging function which does not overestimate the real charging function in any point. As the piecewise linear charging function underestimates the real state-of-charge in some points, such an approximation excludes feasible solutions from the solution space. To overcome this drawback we introduce a new method to determine a piecewise linear charging function overestimating the real charging function in a way that the area between both functions is minimized as well as an adaptation of a known linearization to include the piecewise linear charging function in a branch-and-cut approach. Thereby, we include infeasible solutions in the solution space. To declare them infeasible again we check every integer solution obtained in the branch-and-cut procedure and add an infeasible path cut if the solution is infeasible for the real charging function such that the procedure terminates with an optimal solution for the real charging function. Our approach is evaluated in a computational study in which instances with up to 100 customers were solved to optimality. Moreover, we evaluate the trade-off between a more complex model formulation due to more binary variables if the number of supporting points for the piecewise linear approximation is increased and the higher approximation error if fewer supporting points are used.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100131"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000062/pdfft?md5=cf8749400f8456155ab286abfd962725&pid=1-s2.0-S2192437624000062-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140279825","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
Modeling optimal drone fleet size considering stochastic demand 考虑随机需求的最佳无人机机队规模建模
IF 2.4 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100127
Yuval Hadas , Miguel A. Figliozzi

The last mile delivery is particularly challenging for stochastic deliveries with narrow time windows. This topic is timely due to the rise of e-commerce and courier type services and the impacts of fleet size and vehicle type on delivery costs. A novel contribution of this research is to provide an optimization approach, extending the newsvendor model, to provide an optimal drone fleet sizing solution with stochastic demand in terms of number of deliveries and deliveries weight or payload from one central depot. The solutions obtained are robust, as shown in a comprehensive sensitivity analysis.

对于时间窗口狭窄的随机配送而言,最后一英里配送尤其具有挑战性。由于电子商务和快递类服务的兴起,以及车队规模和车辆类型对送货成本的影响,这一课题显得非常及时。本研究的一个新贡献是提供了一种优化方法,扩展了新闻供应商模型,在随机需求的情况下,从一个中心仓库出发,根据交付数量和交付重量或有效载荷,提供最佳无人机机队规模解决方案。综合敏感性分析表明,所获得的解决方案是稳健的。
{"title":"Modeling optimal drone fleet size considering stochastic demand","authors":"Yuval Hadas ,&nbsp;Miguel A. Figliozzi","doi":"10.1016/j.ejtl.2024.100127","DOIUrl":"https://doi.org/10.1016/j.ejtl.2024.100127","url":null,"abstract":"<div><p>The last mile delivery is particularly challenging for stochastic deliveries with narrow time windows. This topic is timely due to the rise of e-commerce and courier type services and the impacts of fleet size and vehicle type on delivery costs. A novel contribution of this research is to provide an optimization approach, extending the newsvendor model, to provide an optimal drone fleet sizing solution with stochastic demand in terms of number of deliveries and deliveries weight or payload from one central depot. The solutions obtained are robust, as shown in a comprehensive sensitivity analysis.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100127"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000025/pdfft?md5=6d30acb57ad7b3327b4e21a0e63766ce&pid=1-s2.0-S2192437624000025-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140295925","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
Capacity requirements and demand management strategies in meal delivery 送餐服务的能力要求和需求管理策略
IF 2.4 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100135
Ramon Auad , Alan Erera , Martin Savelsbergh

Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.

连接食客与餐厅并组织送餐的在线餐厅聚合商近年来经历了大幅增长。送餐物流具有相当大的挑战性,这主要是由于很难管理送餐资源(即众包快递员)的供应,以在非常紧迫的时间限制下满足动态和不确定的客户需求。在本文中,我们研究了送餐业务中的几个问题,重点是如何正确匹配供需水平。例如,为了确保优质的客户服务,送餐聚合商可能会决定在一个工作日内通过暂时减少一家或多家餐厅的送餐区域来暂时降低需求。我们的研究表明,这种简单的需求限制策略可以使车队的规模大大缩小,从而满足服务要求。为了简化分析,我们将重点放在问题几何图形上,以便使用风格化的混合整数程序来优化部署为大量订单提供服务的快递员队伍。我们将提出的框架应用于有一个和两个仓库的几种情况,并对以下情况对系统性能的影响进行了广泛的实验研究:(i) 允许多个仓库共享快递员;(ii) 放宽订单的交付期限;(iii) 通过对餐厅覆盖范围的有限调整来限制需求。研究结果表明,不同的调度控制和需求管理机制在满足需求所需的快递队伍规模和订单覆盖水平方面都具有潜在的有效性。
{"title":"Capacity requirements and demand management strategies in meal delivery","authors":"Ramon Auad ,&nbsp;Alan Erera ,&nbsp;Martin Savelsbergh","doi":"10.1016/j.ejtl.2024.100135","DOIUrl":"https://doi.org/10.1016/j.ejtl.2024.100135","url":null,"abstract":"<div><p>Online restaurant aggregators, which connect diners with restaurants and organize the delivery of ordered meals, have experienced significant growth in recent years. Meal delivery logistics is quite challenging, primarily due to the difficulty in managing the supply of delivery resources, i.e., crowdsourced couriers, to satisfy dynamic and uncertain customer demand under very tight time constraints. In this paper, we study several questions in meal delivery operations focused on matching the correct levels of supply with demand. To ensure excellent customer service, delivery aggregators may, for example, decide to temporarily decrease demand during an operating day by temporarily reducing the delivery area for one or more restaurants. We show that such simple demand restriction strategies allow a significantly smaller fleet to meet service requirements. To simplify analysis, we focus on problem geometries that enable the use of stylized mixed integer programs to optimally deploy a fleet of couriers serving large numbers of orders. Applying the proposed framework to several scenarios with one and two depots, we conduct an extensive experimental study of the effects on system performance of (i) allowing courier sharing between multiple depots, (ii) relaxing the delivery deadlines of placed orders, and (iii) restricting demand through limited adjustment of the coverage of restaurants. The results demonstrate the potential effectiveness of different dispatch control and demand management mechanisms, in terms of both the required courier fleet size to serve requests and the coverage level of orders.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100135"},"PeriodicalIF":2.4,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000104/pdfft?md5=7b42af90e36c255bf6d3147a2b169514&pid=1-s2.0-S2192437624000104-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141423845","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
A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network 道路网络上具有时间窗口、两支车队和同步性的随时间变化的车辆路由问题的元求和方法
IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Pub Date : 2024-01-01 DOI: 10.1016/j.ejtl.2024.100143
Fernando O. Guillen Reyes , Michel Gendreau , Jean-Yves Potvin
In this work, we extend the time-dependent vehicle routing problem with time windows on a road network by considering two types of vehicles, large and small, to serve customers. Motivated from city logistics applications, large vehicles are forbidden from the downtown area. Accordingly, goods must be transferred from large to small vehicles to serve downtown customers. This leads to synchronization issues at transfer points, which are special locations without storage capacity. The problem is not a pure two-echelon vehicle routing problem, since customers outside of the downtown area can be served directly by large vehicles. The problem is further compounded by the presence of time-dependent travel times that are defined on the arcs of the road network and are used to model congestion periods. To solve this difficult problem, we propose an adaptation of the Slack Induction by String Removals metaheuristic, which is state-of-the-art for the classical capacitated vehicle routing problem. Computational results on a set of test instances with different characteristics empirically demonstrate the optimization capabilities of this new metaheuristic on a problem which is much more complicated than the capacitated vehicle routing problem.
在这项工作中,我们通过考虑为客户提供服务的大型和小型两类车辆,扩展了道路网络上带有时间窗口的随时间变化的车辆路由问题。受城市物流应用的启发,大型车辆被禁止进入市中心区域。因此,货物必须从大型车辆转移到小型车辆,才能为市中心的客户提供服务。这就导致了转运点的同步问题,因为转运点是没有存储能力的特殊地点。这个问题并不是一个纯粹的两通道车辆路由问题,因为市中心以外的客户可以直接由大型车辆提供服务。由于路网弧线上定义了与时间相关的旅行时间,并用于模拟拥堵时段,因此问题变得更加复杂。为了解决这一难题,我们提出了一种 "通过字符串移除进行松弛诱导 "的元寻优方法,该方法在经典的有容量车辆路由问题上是最先进的。在一组具有不同特征的测试实例上的计算结果证明了这一新的元启发式对比容车路由问题复杂得多的问题的优化能力。
{"title":"A metaheuristic for a time-dependent vehicle routing problem with time windows, two vehicle fleets and synchronization on a road network","authors":"Fernando O. Guillen Reyes ,&nbsp;Michel Gendreau ,&nbsp;Jean-Yves Potvin","doi":"10.1016/j.ejtl.2024.100143","DOIUrl":"10.1016/j.ejtl.2024.100143","url":null,"abstract":"<div><div>In this work, we extend the time-dependent vehicle routing problem with time windows on a road network by considering two types of vehicles, large and small, to serve customers. Motivated from city logistics applications, large vehicles are forbidden from the downtown area. Accordingly, goods must be transferred from large to small vehicles to serve downtown customers. This leads to synchronization issues at transfer points, which are special locations without storage capacity. The problem is not a pure two-echelon vehicle routing problem, since customers outside of the downtown area can be served directly by large vehicles. The problem is further compounded by the presence of time-dependent travel times that are defined on the arcs of the road network and are used to model congestion periods. To solve this difficult problem, we propose an adaptation of the Slack Induction by String Removals metaheuristic, which is state-of-the-art for the classical capacitated vehicle routing problem. Computational results on a set of test instances with different characteristics empirically demonstrate the optimization capabilities of this new metaheuristic on a problem which is much more complicated than the capacitated vehicle routing problem.</div></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100143"},"PeriodicalIF":2.1,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142357191","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学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1