Transportation Research Part E-Logistics and Transportation Review最新文献

{"title":"Delivery routing for electric vehicles with en-route mobile battery swapping","authors":"Jiuhong Xiao ,&nbsp;Shuyi Wang ,&nbsp;Jianhua Xiao ,&nbsp;George Q. Huang","doi":"10.1016/j.tre.2024.103838","DOIUrl":"10.1016/j.tre.2024.103838","url":null,"abstract":"<div><div>Amid increasing environmental concerns, electric vehicles (EVs) are gaining traction as a sustainable transportation alternative. However, the widespread adoption of EVs is hindered by range limitations, inadequate charging infrastructure, and unpredictable access to charging facilities. The battery swapping van (BV) has been proposed as an innovative approach to actively offer on-demand charging at designated locations. This study leverages the novel BV concept and proposes a novel electric vehicle routing model with time windows and en-route mobile battery swapping (EVRPTW-EMBS). This achieves flexible mobile battery swapping services provided by BVs to EVs that are either en route or at customer sites. A tailored heuristic algorithm called CIP-TDP-ILNS is adopted, combining improved large neighborhood search (ILNS) with tree-template dynamic programming (TDP) and cluster-aided integer programming (CIP) to reduce the search space and enhance solving efficiency. Through extensive testing, the CIP-TDP-ILNS algorithm exhibits robust performance, yielding up to 16% cost reductions for the EVRPTW-EMBS compared to the benchmark model. The findings of this study suggest that (1) the EVRPTW-EMBS system is particularly beneficial for servicing clients with wider time windows, and (2) the optimal balance between the quantity of batteries carried and their capacity should be tailored to the logistics network’s size.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103838"},"PeriodicalIF":8.3,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Two-stage optimal acquisition and remanufacturing decisions with demand and quality information updating","authors":"Juan Zhou,&nbsp;Huihui Xu,&nbsp;Qianwang Deng,&nbsp;Yinwen Ma,&nbsp;Qiang Luo","doi":"10.1016/j.tre.2024.103823","DOIUrl":"10.1016/j.tre.2024.103823","url":null,"abstract":"<div><div>Remanufacturing activities in reverse logistics hold significant theoretical and practical value for their obvious economic and environmental benefits. However, the ever-changing market demand and the uncertain quality of returned items make the management of remanufacturing production highly challenging. Previous studies have mainly focused on determining the optimal remanufacturing decisions based on static market demand and full knowledge of cores quality, while overlooking the dynamic changes in demand information and the imperfect estimation of quality distribution case. Therefore, this paper proposes a two-stage acquisition and remanufacturing method with demand and quality information updating. In the first stage, the remanufacturer formulates acquisition and remanufacturing decisions based on predicted demand and estimated quality distribution. According to updated market demand and the results of the first-stage, the remanufacturer adjusts the optimal decisions for the second stage to maximize profit. In light of this, a two-stage nonlinear mathematical model is established for the acquisition and remanufacturing problem. Based on the scenario analysis method and multivariate optimization theory, optimal strategies for each stage are obtained. To assess the effectiveness of the method put forward, numerical experiments, sensitivity analysis of parameters, and comparative analysis with single-stage acquisition and remanufacturing method are conducted. The results show that the two-stage acquisition and remanufacturing method that accounts for demand and quality information updating can demonstrate greater adaptability to external changes. Compared to the single-stage method, the remanufacturer adopting the two-stage method can achieve an expected profit growth of 6 %∼11 %. Additionally, the effectiveness of the two-stage method is significantly influenced by the reorder point, and there exists an optimal reorder point to maximize the total profit of the remanufacturer. Our research contributes to the uncertainty research in reverse logistics, providing new insights for operational decision-making in remanufacturing enterprises.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103823"},"PeriodicalIF":8.3,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Selling format selection in the presence of rebate provision","authors":"Yuan Jiang ,&nbsp;Ruixiao Dong ,&nbsp;Hao Wu ,&nbsp;Xu Guan","doi":"10.1016/j.tre.2024.103791","DOIUrl":"10.1016/j.tre.2024.103791","url":null,"abstract":"<div><div>This paper investigates the sellers’ optimal rebate provision strategies in a supply chain setting wherein two competing sellers offer substitutable products via a common platform, and can choose whether to provide rebates to boost their respective sales. We consider two selling formats: wholesale format and agency format (with exogenous commission rate) to capture the interaction between the sellers and platform. We show that the sellers always choose to provide rebates under wholesale format, while only doing so under agency format when the commission rate is low. With either selling format, the sellers target both rebate-sensitive and rebate-insensitive consumers when the ratio of sensitive consumers is low enough, otherwise targeting only rebate-sensitive consumers as a means to explore the benefits derived from the offer of a rebate. With certain conditions, intensified competition will hurt the platform under wholesale format while benefit it under agency format, a result differs from when there are no rebates provided. The preferences of the sellers and the platform over two selling formats are jointly determined by the commission rate and the composition of consumers. When the ratio of rebate-sensitive consumers increases, sellers’ preference for the agency format first decreases and then increases. When this ratio is sufficiently high, charging a high commission rate will reduce the platform’s profit under agency format, making the wholesale format more preferable. We also consider an alternative scenario wherein the commission rate is endogenous and show that the results remain qualitatively intact.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103791"},"PeriodicalIF":8.3,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540247","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A variable neighborhood search algorithm for locker-based drone delivery makespan minimization problem","authors":"Waiming Zhu ,&nbsp;Haiquan Sun ,&nbsp;Xiaoxuan Hu ,&nbsp;Yingying Ma","doi":"10.1016/j.tre.2024.103820","DOIUrl":"10.1016/j.tre.2024.103820","url":null,"abstract":"<div><div>This article studies a novel makespan minimization problem for locker-based drone delivery in which several automatic drones take lockers as launching and landing platforms. It is a vehicle routing and machine scheduling hybrid problem with formulation and solution challenges. Firstly, we formally define the problem and analyze its complexity. Secondly, we formulate an integer linear program model based on a time-expanded network. Thirdly, we develop a variable neighborhood search algorithm that embeds a translation heuristic. The translation heuristic first constructs a rough solution and then improves the solution by solving a linear program. Numerical tests are conducted on simulated instances. The results show that the algorithm finds solutions with an average gap of 7% for small-scale uniform instances and demonstrates good scalability, with CPU time growing nearly linearly as the instance size increases.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103820"},"PeriodicalIF":8.3,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Integrated optimal planning of multi-type lanes and intersections in a transportation network with mixed HVs and CAVs","authors":"Tongfei Li ,&nbsp;Zhen Qian ,&nbsp;Bo Fan ,&nbsp;Min Xu ,&nbsp;Huijun Sun ,&nbsp;Yanyan Chen","doi":"10.1016/j.tre.2024.103814","DOIUrl":"10.1016/j.tre.2024.103814","url":null,"abstract":"<div><div>In a prolonged transitional period, the urban transportation infrastructure is expected to accommodate two different types of vehicles. One type of vehicle is the human-driven vehicle (HV) and the other is the connected and autonomous vehicle (CAV). Nevertheless, the conflict between HVs and CAVs in the mixed traffic scenario significantly impedes the efficiency-improvement benefit of implementing emerging CAV technologies. To harness the full potential of CAVs in enhancing traffic efficiency and network performance, multi-type lanes (i.e., regular lanes, dedicated CAV lanes, and CAV/toll lanes) and multi-type intersections (i.e., conventional signalized intersections, novel signalized intersections with an exclusive phase and exclusive approaches, and smart signal-free intersections) are proposed to efficiently manage the heterogeneous traffic flow on roads and at intersections, respectively. From the perspective of traffic planners, in this research, the integrated planning problem of multi-type lanes and intersections (IPPLI for short) in the mixed transportation network is suggested and tackled, where the route selection behavior and the cross-group externalities of heterogeneous travelers are considered according to the user equilibrium principle. It aims to minimize the overall travel cost by making decisions on the spatial layout of multi-type lanes and intersections in the network, the toll level of CAV/toll lanes, the number of exclusive approaches at novel signalized intersections, time intervals of the cycle and green signal for each phase at both conventional and novel signalized intersections. Then, the IPPLI is formulated as a mixed-integer nonlinear programming model based on the link-node modeling method without time-consuming path enumeration and memory-consuming path storage. As a mathematical problem with complementarity constraints, it is solved by an improved evolutionary algorithm-based approach, which consists of two modules cooperating with each other. After introducing the concept of the accessibility of HVs, a heuristic technique is proposed to accelerate algorithm convergence by continuously repairing unreasonable solutions. Finally, experiments are performed on two distinct networks to showcase the properties of the problem and assess the effectiveness of the proposed model. Experimental results show that the proposed model consistently performs outstandingly across a range of CAV penetration rates. Our model achieves maximum improvements of 25.71% and 4.84% in reducing travel costs compared to models that only plan multi-type lanes and multi-type intersections, respectively. Additionally, the improved evolutionary algorithm-based approach reduces the convergence time by 20.51% and 26.81% compared to the classical evolutionary algorithm and the genetic algorithm provided by MATLAB Global Optimization Toolbox.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103814"},"PeriodicalIF":8.3,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540248","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Port-city synergism and regional development policy: Evidence from the Yangtze River Region","authors":"Jun-Qing Zhang ,&nbsp;Su-Han Woo ,&nbsp;Kevin X. Li","doi":"10.1016/j.tre.2024.103817","DOIUrl":"10.1016/j.tre.2024.103817","url":null,"abstract":"<div><div>As one of China’s three development strategies, the Yangtze River Economic Belt (YEB) strategy plays an important role in strengthening the development of port–city synergy. This study uses the difference-in-differences (DID) approach to investigate the impact of the YEB strategy on port–city synergy development, with panel data for 15 port–city pairs along the YEB over the period 2005–2019. The results show that the YEB strategy significantly promotes port–city synergy through fixed-asset investment in the transportation, warehousing, and postal industries, especially for economically developed port cities and cities far from the port. It is suggested that decision-makers prioritize the fixed asset investments in these industries and formulate differentiated collaborative development plans according to different types of cities.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103817"},"PeriodicalIF":8.3,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Contracting and advertising for e-commerce platforms with private-effectiveness information","authors":"Jun Wang ,&nbsp;Pengwen Hou ,&nbsp;Shuxia Peng ,&nbsp;Nan Yuan","doi":"10.1016/j.tre.2024.103808","DOIUrl":"10.1016/j.tre.2024.103808","url":null,"abstract":"<div><div>In online sales, e-commerce platforms commonly employ marketplace and reselling modes. Motivated by this industry practice, this study investigates which sales mode a platform should choose and how the platform should contract with a manufacturer in each mode. We consider that advertising effectiveness is the platform’s private information. A game-theoretic model is developed to explore the advertising and pricing decisions of three contracts within these modes. We also explore whether and how a platform can signal its private information to the manufacturer. Our analysis reveals significant differences in the informational role of advertising among the three contracts. In marketplace mode, the platform can signal its effectiveness through the advertising level. A proportional-fee contract is more efficient in signaling than a fixed-fee contract. Specifically, when the fixed-fee contract is employed, the platform with low effectiveness must distort its advertising level downward and thus incur signaling costs if the effectiveness uncertainty is low. In contrast, when the proportional-fee contract is employed, signaling is always costless. In reselling mode (wholesale-price contract), although the platform is unable to signal its effectiveness, the information asymmetry does not affect the manufacturer’s wholesale price decision. Moreover, we show that the effectiveness uncertainty and ex-ante decisions of fixed rent and wholesale price significantly affect the mode choice and the relevant decision-making. This study provides valuable insights for e-commerce platform managers on choosing sales mode, concluding contracts with upstream manufacturers, and conducting advertising activities under asymmetric information.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103808"},"PeriodicalIF":8.3,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142540344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Fleet sizing with time and voyage-chartered vessels for an oil shipping company under demand uncertainty","authors":"Zhijia Tan ,&nbsp;Liwei Du ,&nbsp;Ming Wang ,&nbsp;Hai Yang ,&nbsp;Lingxiao Wu","doi":"10.1016/j.tre.2024.103801","DOIUrl":"10.1016/j.tre.2024.103801","url":null,"abstract":"<div><div>The fleet sizing problem is one of the main concerns for an industry shipping company under various uncertainty of market conditions. This paper addresses the problem in a single period with uncertain shipment demand for an oil shipping company, who transports the refined petroleum products among multiple origin–destination (OD) pairs. Besides the self-owned vessels, the time-chartered and voyage-chartered vessels are considered by the company as two types of rental vessels from the potential outsourcing market. The company aims to determine the numbers of vessels with different capacity levels and different rental types, deploy them among all OD pairs to minimize the total expected cost including the rent costs of time-chartered and voyage-chartered vessels and the holding cost of time-chartered vessels. Several stochastic programming models are proposed to investigate three scenarios: the aggregative shipment demand and an available fleet with continuously separable vessel capacity in the outsourcing market, the aggregative shipment demand and an available fleet with inseparable vessel capacity, and the OD shipment demand matrix and an available fleet with inseparable vessel capacity. Assuming economies of scale in rental duration, vessel capacity, and voyage distance, we conduct theoretical analysis to deduce the necessary conditions and solution properties for optimal resolutions to the fleet sizing problems. The real-world numerical examples based on China National Petroleum Corporation are adopted to illustrate the proposed models and theoretical results.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103801"},"PeriodicalIF":8.3,"publicationDate":"2024-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142444885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Sustainability versus exclusivity in the sharing economy: Should leftover luxury fashion products be destroyed?","authors":"Yingjia Wang ,&nbsp;Tsan-Ming Choi ,&nbsp;Suyuan Luo","doi":"10.1016/j.tre.2024.103759","DOIUrl":"10.1016/j.tre.2024.103759","url":null,"abstract":"<div><div>In the luxury industry, fashion brands like Burberry and Cartier are reported to destroy leftover products at the end of the selling season (Scenario BC). This helps to maintain products’ exclusivity image but creates a loss of goodwill because consumers in the market commonly value sustainability and responsibility. In the sharing economy, luxury fashion brands can sell their leftover products to certain platforms and generate revenue (Scenario PL), but doing so reduces the image of product exclusivity. In this paper, we establish stylized models and analytically investigate this operational problem. In the basic model, we consider the case in which the luxury fashion brand can choose between Scenarios BC and PL with deterministic leftover-product-handling effects. We find that Scenario PL outperforms Scenario BC in terms of both benefit and profit risk (i.e., <em>mean</em>–<em>variance dominating</em>) when (i) the inventory service level in Scenario PL is sufficiently small and (ii) either the demand volatility is sufficiently large or the loss of goodwill cost is sufficiently large. In the extended models, we first generalize the two-period model to a multiple <em>N</em>-period model. We then explore another case in which the leftover-product-handling effects brought by Scenarios BC and PL are stochastic, and we highlight the impacts of the associated uncertainties. Finally, we consider a third scenario in which leftover products are donated for charity. We find that the main insights derived from the basic model remain robust in all of the extended models. In short, in the sharing economy, with an alternative way of using the product leftovers and consumers commonly treasure sustainability, we argue that luxury brands should no longer destroy product leftovers. Our proposal is also in line with the current measures imposed on the luxury brands by European Union in which it is no longer legal for luxury brands to “burn” the product leftovers.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103759"},"PeriodicalIF":8.3,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442184","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Decision timing, information inference, and information sharing: A robust supply chain game with two-way information asymmetry","authors":"Yujie Zhao ,&nbsp;Hong Zhou ,&nbsp;Roel Leus","doi":"10.1016/j.tre.2024.103807","DOIUrl":"10.1016/j.tre.2024.103807","url":null,"abstract":"<div><div>This paper examines a two-echelon supply chain consisting of a retailer and a manufacturer under two-way information asymmetry, in which the two actors have private demand and cost information, respectively. In response to the uncertainty caused by information asymmetry, a robust optimization approach is used to model the risk-averse behavior of the enterprises in the game. We incorporate an information transmission mechanism by which the dominated enterprise would obtain partial private information contained in the decision of the dominant enterprise through information inference. We explore the interaction between decision timing and inference, then investigate full and partial information sharing strategies to reveal the critical roles of information flow in supply chain operations. The results illustrate the impact of demand and cost information gaps on enterprise operations, where the information gap is defined as the difference between the worst-case bound and the actual value of the demand and the cost, respectively. In addition, enterprises may not prefer sharing information when the difference between the two information gaps is large or the demand is small. Hence we propose some subsidy strategies for inducing information sharing which can achieve win-win situations. Moreover, moving first and not sharing information is a pure-strategy Nash equilibrium in most situations when not considering inference. We illustrate how the equilibrium can be changed through subsidy and inference, then provide mixed-strategy Nash equilibrium for specific situations. The results also indicate moving first is not always advantageous in the game. This depends on the follower’s information gap, inference level, and information sharing strategy. Finally, in an extension, we discuss information inference costs and the impact of channel encroachment, and we validate our results based on a signaling game.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"192 ","pages":"Article 103807"},"PeriodicalIF":8.3,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142442183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}