Pub Date : 2024-11-14DOI: 10.1016/j.tre.2024.103827
Zhixuan Lai , Gaoxiang Lou , Sai-Ho Chung , Tijun Fan , Haicheng Ma , Mingjun Yu
Low-carbon technology sharing (LTS) is often viewed as a positive factor for enterprise operations, which can not only encourage the spread of low carbon technologies but also serve as a source of financing for capital-constrained manufacturers. However, it is not clear how LTS works in a capital-constrained supply chain. This study incorporates LTS into the design of supply chain finance schemes, considering the manufacturer’s financial constraints. To this end, we compare LTS and two types of low-carbon technology licensing (LTL) schemes, namely, royalty fee licensing (LTL-V) and royalty fee portfolio fixed-fee licensing (LTL-V+F), to reveal the value of LTS to capital-constrained supply chain and the government. The conclusions indicate that boosting unit royalty rates with a high consumer’s low-carbon preference, as well as fixed fee are not conducive to the increase of manufacturers’ order quantity. Compared to manufacturer independent financing benchmark scenario and any LTL scheme, the LTS scheme can not only achieve higher unit carbon emission abatement, but also potentially lower total carbon emissions. Owing to the effective increase in expected environmental revenues, the government’s revenue under LTS may also increase significantly in some cases.
{"title":"The bright side of low-carbon technology sharing in a capital-constrained supply chain","authors":"Zhixuan Lai , Gaoxiang Lou , Sai-Ho Chung , Tijun Fan , Haicheng Ma , Mingjun Yu","doi":"10.1016/j.tre.2024.103827","DOIUrl":"10.1016/j.tre.2024.103827","url":null,"abstract":"<div><div>Low-carbon technology sharing (LTS) is often viewed as a positive factor for enterprise operations, which can not only encourage the spread of low carbon technologies but also serve as a source of financing for capital-constrained manufacturers. However, it is not clear how LTS works in a capital-constrained supply chain. This study incorporates LTS into the design of supply chain finance schemes, considering the manufacturer’s financial constraints. To this end, we compare LTS and two types of low-carbon technology licensing (LTL) schemes, namely, royalty fee licensing (LTL-V) and royalty fee portfolio fixed-fee licensing (LTL-V+F), to reveal the value of LTS to capital-constrained supply chain and the government. The conclusions indicate that boosting unit royalty rates with a high consumer’s low-carbon preference, as well as fixed fee are not conducive to the increase of manufacturers’ order quantity. Compared to manufacturer independent financing benchmark scenario and any LTL scheme, the LTS scheme can not only achieve higher unit carbon emission abatement, but also potentially lower total carbon emissions. Owing to the effective increase in expected environmental revenues, the government’s revenue under LTS may also increase significantly in some cases.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103827"},"PeriodicalIF":8.3,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637372","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}
Pub Date : 2024-11-14DOI: 10.1016/j.tre.2024.103848
Wenyu Zhao , Connor Zou , Yuntian Bai , Xiaojun Fan
Given the increasing concerns about energy consumption and rising consumer social responsibility, firms producing brown products should consider transitioning to greener alternatives that are less harmful to the environment. To examine this, we employ a Stackelberg model to analyze the price and quality of brown and green products (e.g., gasoline and electric vehicles) across three product-line strategies: producing only brown products, producing only green products, and producing both. Our study reveals that the quality of brown products in a single product line is the highest among all strategies. In terms of wholesale and retail prices, green products are priced higher than brown products, and prices for both products in a single product line exceed those in a dual product line. Interestingly, manufacturers prefer a dual product line strategy, while retailers favor selling brown products. Additionally, selling only brown products can result in higher consumer surplus, whereas producing only green products may lead to the lowest environmental impact.
{"title":"Balancing price and quality decisions of the environmental supply chain in the presence of socially responsible consumer","authors":"Wenyu Zhao , Connor Zou , Yuntian Bai , Xiaojun Fan","doi":"10.1016/j.tre.2024.103848","DOIUrl":"10.1016/j.tre.2024.103848","url":null,"abstract":"<div><div>Given the increasing concerns about energy consumption and rising consumer social responsibility, firms producing brown products should consider transitioning to greener alternatives that are less harmful to the environment. To examine this, we employ a Stackelberg model to analyze the price and quality of brown and green products (e.g., gasoline and electric vehicles) across three product-line strategies: producing only brown products, producing only green products, and producing both. Our study reveals that the quality of brown products in a single product line is the highest among all strategies. In terms of wholesale and retail prices, green products are priced higher than brown products, and prices for both products in a single product line exceed those in a dual product line. Interestingly, manufacturers prefer a dual product line strategy, while retailers favor selling brown products. Additionally, selling only brown products can result in higher consumer surplus, whereas producing only green products may lead to the lowest environmental impact.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103848"},"PeriodicalIF":8.3,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637371","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}
Pub Date : 2024-11-13DOI: 10.1016/j.tre.2024.103834
Song Huang , Jiawen Xu , Yun Wang
This study investigates the disclosure strategies for quality information in a dual-channel supply chain comprising a manufacturer and a dual-purpose online platform focusing on both profit and consumer surplus. We elaborate on two disclosure formats: the P-C format, in which the platform discloses quality information, and the M-C format, in which the manufacturer discloses quality information. The results show that firms have the same disclosure motivation when the platform pursues profit maximization because only the agency channel is retained in the supply chain, and firms share profits equally. However, the indistinguishable disclosure incentive for firms exhibits a convex relationship with the consumer surplus concern in the dual-purpose case. In addition, the M-C or P-C format is the optimal disclosure preference for firms, indicating that hitchhiking may not always be the best option. Specifically, the manufacturer (platform) will proactively disclose information in regions where the commission rate is low (high) and the consumer surplus concern is not too high. Firms in these areas have common preferences regarding different disclosure formats. Also, consumers do not necessarily benefit from the increased consumer surplus concern under the P-C format. Finally, the outcomes are robust to the scenarios with a parsimonious dual-purpose platform, ex-post disclosure, quality certification, and imperfect competition market.
{"title":"Quality disclosure in a dual-channel supply chain with an online dual-purpose platform","authors":"Song Huang , Jiawen Xu , Yun Wang","doi":"10.1016/j.tre.2024.103834","DOIUrl":"10.1016/j.tre.2024.103834","url":null,"abstract":"<div><div>This study investigates the disclosure strategies for quality information in a dual-channel supply chain comprising a manufacturer and a dual-purpose online platform focusing on both profit and consumer surplus. We elaborate on two disclosure formats: the P-C format, in which the platform discloses quality information, and the M-C format, in which the manufacturer discloses quality information. The results show that firms have the same disclosure motivation when the platform pursues profit maximization because only the agency channel is retained in the supply chain, and firms share profits equally. However, the indistinguishable disclosure incentive for firms exhibits a convex relationship with the consumer surplus concern in the dual-purpose case. In addition, the M-C or P-C format is the optimal disclosure preference for firms, indicating that hitchhiking may not always be the best option. Specifically, the manufacturer (platform) will proactively disclose information in regions where the commission rate is low (high) and the consumer surplus concern is not too high. Firms in these areas have common preferences regarding different disclosure formats. Also, consumers do not necessarily benefit from the increased consumer surplus concern under the P-C format. Finally, the outcomes are robust to the scenarios with a parsimonious dual-purpose platform, ex-post disclosure, quality certification, and imperfect competition market.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103834"},"PeriodicalIF":8.3,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637373","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}
Pub Date : 2024-11-13DOI: 10.1016/j.tre.2024.103856
Tingsong Wang , Shihao Li , Lu Zhen , Tiancheng Zhao
This paper investigates a reliable ship fleet planning problem with the uncertainties of container shipping demand, transport costs and freight rates in liner shipping services, and this problem is formulated as a two-stage robust optimization model. In our model, the first-stage decision is to determine the types and quantities of ships, as well as their allocation to different routes, and the second-stage is to fulfill container shipping demand after uncertain information is revealed. Compared to the models proposed in existing researches, our model involves multiple uncertainties aforementioned, and it can also capture the correlation between demand and freight rates. Due to the difficulty of directly solving the two-stage robust optimization model, the column-and-constraint generation algorithm and the benders-dual cutting plane algorithm are developed to address this model. Based on a real shipping network case, extensive computational experiments are conducted to test the practical significance of the presented model and the applicability of our algorithm. The computational results indicate that considering multiple uncertainties simultaneously can significantly save the worst-case costs, demonstrating that the developed two-stage robust optimization model provides a valuable decision-making reference for liner companies seeking to enhance the reliability of ship fleet planning.
{"title":"The reliable ship fleet planning problem for liner shipping services","authors":"Tingsong Wang , Shihao Li , Lu Zhen , Tiancheng Zhao","doi":"10.1016/j.tre.2024.103856","DOIUrl":"10.1016/j.tre.2024.103856","url":null,"abstract":"<div><div>This paper investigates a reliable ship fleet planning problem with the uncertainties of container shipping demand, transport costs and freight rates in liner shipping services, and this problem is formulated as a two-stage robust optimization model. In our model, the first-stage decision is to determine the types and quantities of ships, as well as their allocation to different routes, and the second-stage is to fulfill container shipping demand after uncertain information is revealed. Compared to the models proposed in existing researches, our model involves multiple uncertainties aforementioned, and it can also capture the correlation between demand and freight rates. Due to the difficulty of directly solving the two-stage robust optimization model, the column-and-constraint generation algorithm and the benders-dual cutting plane algorithm are developed to address this model. Based on a real shipping network case, extensive computational experiments are conducted to test the practical significance of the presented model and the applicability of our algorithm. The computational results indicate that considering multiple uncertainties simultaneously can significantly save the worst-case costs, demonstrating that the developed two-stage robust optimization model provides a valuable decision-making reference for liner companies seeking to enhance the reliability of ship fleet planning.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103856"},"PeriodicalIF":8.3,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637375","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}
Pub Date : 2024-11-12DOI: 10.1016/j.tre.2024.103837
Yuyun Gu , Yadong Wang , Tingsong Wang
Container shipping demands are usually classified into long-term contract demands from large shippers and ad hoc demands from spot shippers. Compared with stable long-term contract demands, spot container shipping demands are often unstable due to their high frequent cancellations during the slot booking period and their uncertain arrivals even no-shows. This poses a challenge for shipping companies in making precise and profitable decisions on slot allocations for these spot demands, to avoid the loss of slot utilization and shipping profit. This paper thus focuses on a dynamic slot allocation problem for spot containers with consideration of their random arrivals and cancellations during the booking period to maximize the expected shipping profit, and formulates it as a Markov decision process (MDP) model. Due to the well-known curse of dimensionality of MDP models, this paper uses the approximate dynamic programming (ADP) approach to approximate our MDP model, and consequently develops a series of stochastic programming models, which can yield a near-optimal slot allocation policy. Numerical experiments are conducted to examine the effectiveness and superiority of our models obtained by the ADP approach. The computational results show that our dynamic slot allocation strategy can make shipping companies achieve a high slot utilization rate, up to 91.36 %. Furthermore, compared with various slot allocation policies commonly used by shipping companies in practice, the policy obtained by the approach used in this paper performs best in terms of profit, with an improvement of up to 33.26 %.
{"title":"An approximate dynamic programming approach to dynamic slot allocation of spot containers with random arrivals, cancellations, and no-shows","authors":"Yuyun Gu , Yadong Wang , Tingsong Wang","doi":"10.1016/j.tre.2024.103837","DOIUrl":"10.1016/j.tre.2024.103837","url":null,"abstract":"<div><div>Container shipping demands are usually classified into long-term contract demands from large shippers and ad hoc demands from spot shippers. Compared with stable long-term contract demands, spot container shipping demands are often unstable due to their high frequent cancellations during the slot booking period and their uncertain arrivals even no-shows. This poses a challenge for shipping companies in making precise and profitable decisions on slot allocations for these spot demands, to avoid the loss of slot utilization and shipping profit. This paper thus focuses on a dynamic slot allocation problem for spot containers with consideration of their random arrivals and cancellations during the booking period to maximize the expected shipping profit, and formulates it as a Markov decision process (MDP) model. Due to the well-known curse of dimensionality of MDP models, this paper uses the approximate dynamic programming (ADP) approach to approximate our MDP model, and consequently develops a series of stochastic programming models, which can yield a near-optimal slot allocation policy. Numerical experiments are conducted to examine the effectiveness and superiority of our models obtained by the ADP approach. The computational results show that our dynamic slot allocation strategy can make shipping companies achieve a high slot utilization rate, up to 91.36 %. Furthermore, compared with various slot allocation policies commonly used by shipping companies in practice, the policy obtained by the approach used in this paper performs best in terms of profit, with an improvement of up to 33.26 %.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103837"},"PeriodicalIF":8.3,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637381","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}
Pub Date : 2024-11-12DOI: 10.1016/j.tre.2024.103853
Shihao Huang , Shan Li , Hang Xie , Chun-Hung Chiu
This study investigates a two-echelon supply chain comprising a retailer, who considers whether to sell products as online-exclusive (products available only online) versus hybrid (products available both online and offline), and a supplier, who considers whether to encroach the online market. Given that there are more product varieties online than offline and competitive online marketplace, it remains unclear how retailers identify products that should be offered as hybrid versus online-exclusive. Comparing to online exclusive selling strategy, two key features of the hybrid selling strategy are captured: the demand expansion and profit margin effects. The demand expansion effect refers to the phenomenon where a retailer, transitioning from an online-exclusive approach to a hybrid approach, can expand market size by appealing to consumers who exclusively prefer offline purchases. Besides, the profit margin effect relates to how customer migration impacts retailer profits due to the disparity in unit product profit margins between online and offline channels. We reveal that the products with significant demand expansion effect should be offered as hybrid, and the hybrid selling strategy is efficient in preventing supply encroachment. However, even if the profit margin and demand expansion effect are positive, the products may be better to offer as online-exclusive. This is because, under the hybrid selling strategy, the supplier would charge a high wholesale price to squeeze the retailer’s profit. Consequently, the hybrid selling strategy in this circumstance intensifies the double marginalization effect, prompting the retailer not to opt for the hybrid selling strategy as a means to prevent supplier encroachment. Finally, the cross-selling effect, in which the customers buy some other products, strengthens the profit margin effect, and the results remain robust. Therefore, our study provides management insights that high-volume products may also be offered as online-exclusive, which challenges previous findings based on the long-tail phenomenon.
{"title":"Channel merchandising strategies considering customer behavior and supplier encroachment","authors":"Shihao Huang , Shan Li , Hang Xie , Chun-Hung Chiu","doi":"10.1016/j.tre.2024.103853","DOIUrl":"10.1016/j.tre.2024.103853","url":null,"abstract":"<div><div>This study investigates a two-echelon supply chain comprising a retailer, who considers whether to sell products as <em>online-exclusive</em> (products available only online) versus <em>hybrid</em> (products available both online and offline), and a supplier, who considers whether to encroach the online market. Given that there are more product varieties online than offline and competitive online marketplace, it remains unclear how retailers identify products that should be offered as hybrid versus online-exclusive. Comparing to online exclusive selling strategy, two key features of the hybrid selling strategy are captured: the <em>demand expansion</em> and <em>profit margin effects</em>. The demand expansion effect refers to the phenomenon where a retailer, transitioning from an online-exclusive approach to a hybrid approach, can expand market size by appealing to consumers who exclusively prefer offline purchases. Besides, the profit margin effect relates to how customer migration impacts retailer profits due to the disparity in unit product profit margins between online and offline channels. We reveal that the products with significant demand expansion effect should be offered as hybrid, and the hybrid selling strategy is efficient in preventing supply encroachment. However, even if the profit margin and demand expansion effect are positive, the products may be better to offer as online-exclusive. This is because, under the hybrid selling strategy, the supplier would charge a high wholesale price to squeeze the retailer’s profit. Consequently, the hybrid selling strategy in this circumstance intensifies the double marginalization effect, prompting the retailer not to opt for the hybrid selling strategy as a means to prevent supplier encroachment. Finally, the cross-selling effect, in which the customers buy some other products, strengthens the profit margin effect, and the results remain robust. Therefore, our study provides management insights that high-volume products may also be offered as online-exclusive, which challenges previous findings based on the long-tail phenomenon.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103853"},"PeriodicalIF":8.3,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637374","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}
Pub Date : 2024-11-12DOI: 10.1016/j.tre.2024.103846
Yilin Wang, Junlong Zhang
Truck platooning is a promising technology for reducing energy consumption, increasing vehicle safety, and improving traffic efficiency. In this paper, we examine the cost-effectiveness of truck platooning from the perspective of a freight company fulfilling full truckload pickup and delivery requests over a transportation network. During transportation, trucks can form platoons on the traversed road sections to reduce the travel costs of the following trucks. The problem is how the routing and scheduling of trucks should be determined to take full advantage of truck platooning and minimize the total transportation cost. We propose two model formulations over a time-expanded network for this problem: a direct delivery model and an indirect delivery model, where the indirect delivery model allows trucks to visit intermediate locations during deliveries to facilitate the formation of platoons. In both models, trucks are permitted to wait at any traversed node provided that time windows of requests are not violated. We develop an improved dynamic discretization discovery (DDD) algorithm to solve the two models exactly. Through extensive computational experiments, we find that (1) the improved DDD algorithm can increase solution accuracy with much less computational effort compared with the basic DDD algorithm; (2) the cost-saving effect of truck platooning is favorable; and (3) for freight companies operating on small transportation networks, using the direct delivery model may be more appropriate.
{"title":"The full truckload pickup and delivery problem with truck platooning","authors":"Yilin Wang, Junlong Zhang","doi":"10.1016/j.tre.2024.103846","DOIUrl":"10.1016/j.tre.2024.103846","url":null,"abstract":"<div><div>Truck platooning is a promising technology for reducing energy consumption, increasing vehicle safety, and improving traffic efficiency. In this paper, we examine the cost-effectiveness of truck platooning from the perspective of a freight company fulfilling full truckload pickup and delivery requests over a transportation network. During transportation, trucks can form platoons on the traversed road sections to reduce the travel costs of the following trucks. The problem is how the routing and scheduling of trucks should be determined to take full advantage of truck platooning and minimize the total transportation cost. We propose two model formulations over a time-expanded network for this problem: a direct delivery model and an indirect delivery model, where the indirect delivery model allows trucks to visit intermediate locations during deliveries to facilitate the formation of platoons. In both models, trucks are permitted to wait at any traversed node provided that time windows of requests are not violated. We develop an improved dynamic discretization discovery (DDD) algorithm to solve the two models exactly. Through extensive computational experiments, we find that (1) the improved DDD algorithm can increase solution accuracy with much less computational effort compared with the basic DDD algorithm; (2) the cost-saving effect of truck platooning is favorable; and (3) for freight companies operating on small transportation networks, using the direct delivery model may be more appropriate.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103846"},"PeriodicalIF":8.3,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637376","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}
Pub Date : 2024-11-11DOI: 10.1016/j.tre.2024.103847
Bo Sun , Shukai Chen , Qiang Meng
This study investigates an on-demand first-and-last-mile ridesharing service (FLRS) problem considering the time-dependent travel time for an operator who manage a heterogeneous vehicle fleet. The operator, aiming to minimize the total operational cost, needs to simultaneously serve both first-mile (FM) and last-mile (LM) trips around a public transportation hub, such as a metro station. To holistically address this problem, we formulate a time-discretized mixed integer linear programming (MILP) model by constructing a time-expanded network and then extend a route-based set partitioning model. To yield good-quality solutions in a short computational time, a rolling-horizon-based column generation (RHCG) method is developed to handle real-time requests. An exact branch-and-price (BP) algorithm and a customized adaptive large neighborhood search (ALNS) algorithm are utilized to assess the solution quality of the applied RHCG. We conduct extensive numerical experiments created from real-world instances in Singapore to demonstrate the effectiveness of the proposed research methodology. The results of large-scale cases indicate that the RHCG outperforms both the commercial solver and the BP, and significantly reduces computational time in comparison with the ALNS. The implemented FLRS solution can decrease system-wide costs by 21.38% and increase shared-ride efficiency by 1.47 times, compared with the FM and LM services that operate separately.
{"title":"Optimizing first-and-last-mile ridesharing services with a heterogeneous vehicle fleet and time-dependent travel times","authors":"Bo Sun , Shukai Chen , Qiang Meng","doi":"10.1016/j.tre.2024.103847","DOIUrl":"10.1016/j.tre.2024.103847","url":null,"abstract":"<div><div>This study investigates an on-demand first-and-last-mile ridesharing service (FLRS) problem considering the time-dependent travel time for an operator who manage a heterogeneous vehicle fleet. The operator, aiming to minimize the total operational cost, needs to simultaneously serve both first-mile (FM) and last-mile (LM) trips around a public transportation hub, such as a metro station. To holistically address this problem, we formulate a time-discretized mixed integer linear programming (MILP) model by constructing a time-expanded network and then extend a route-based set partitioning model. To yield good-quality solutions in a short computational time, a rolling-horizon-based column generation (RHCG) method is developed to handle real-time requests. An exact branch-and-price (BP) algorithm and a customized adaptive large neighborhood search (ALNS) algorithm are utilized to assess the solution quality of the applied RHCG. We conduct extensive numerical experiments created from real-world instances in Singapore to demonstrate the effectiveness of the proposed research methodology. The results of large-scale cases indicate that the RHCG outperforms both the commercial solver and the BP, and significantly reduces computational time in comparison with the ALNS. The implemented FLRS solution can decrease system-wide costs by 21.38% and increase shared-ride efficiency by 1.47 times, compared with the FM and LM services that operate separately.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103847"},"PeriodicalIF":8.3,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637382","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}
Pub Date : 2024-11-11DOI: 10.1016/j.tre.2024.103826
Lianhua Tang , Yantong Li , Shuai Zhang , Zheng Wang , Leandro C. Coelho
Massive COVID-19 vaccination can significantly reduce both mild and severe infection rates. Some governments have adopted mobile vaccination vehicles, offering a more convenient and flexible service compared to static walk-in sites. This paper addresses a new scheduling problem arising from the mobile COVID-19 vaccination planning practice. Given a set of communities, each with a specific number of residents to vaccinate, the objective is to assign mobile vaccination vehicles to communities and determine each vehicle’s service capacity and routes, attempting to minimize the total operational cost. To our knowledge, this is the first attempt to tackle the joint challenge of mass vaccination scheduling and routing. We formulate the problem as a mixed-integer nonlinear program model, which we linearize by treating each vehicle with multiple stations as separate units. Given that the problem is NP-hard, we then developed a tailored adaptive large neighborhood search (ALNS) approach that effectively solves practical-sized instances by utilizing the intrinsic structure of the problem. To illustrate the efficiency of the suggested model and solution methodologies, we conduct numerical experiments on instances of varying sizes. The results demonstrate the effectiveness of the developed ALNS algorithm in solving instances with realistic sizes, efficiently handling up to 100 communities and 14 vaccination vehicles. In addition, a case study shows that our method significantly reduces operational expenses compared to some experience-based greedy methods.
{"title":"Mobile COVID-19 vaccination scheduling with capacity selection","authors":"Lianhua Tang , Yantong Li , Shuai Zhang , Zheng Wang , Leandro C. Coelho","doi":"10.1016/j.tre.2024.103826","DOIUrl":"10.1016/j.tre.2024.103826","url":null,"abstract":"<div><div>Massive COVID-19 vaccination can significantly reduce both mild and severe infection rates. Some governments have adopted mobile vaccination vehicles, offering a more convenient and flexible service compared to static walk-in sites. This paper addresses a new scheduling problem arising from the mobile COVID-19 vaccination planning practice. Given a set of communities, each with a specific number of residents to vaccinate, the objective is to assign mobile vaccination vehicles to communities and determine each vehicle’s service capacity and routes, attempting to minimize the total operational cost. To our knowledge, this is the first attempt to tackle the joint challenge of mass vaccination scheduling and routing. We formulate the problem as a mixed-integer nonlinear program model, which we linearize by treating each vehicle with multiple stations as separate units. Given that the problem is NP-hard, we then developed a tailored adaptive large neighborhood search (ALNS) approach that effectively solves practical-sized instances by utilizing the intrinsic structure of the problem. To illustrate the efficiency of the suggested model and solution methodologies, we conduct numerical experiments on instances of varying sizes. The results demonstrate the effectiveness of the developed ALNS algorithm in solving instances with realistic sizes, efficiently handling up to 100 communities and 14 vaccination vehicles. In addition, a case study shows that our method significantly reduces operational expenses compared to some experience-based greedy methods.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103826"},"PeriodicalIF":8.3,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637385","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}
Pub Date : 2024-11-11DOI: 10.1016/j.tre.2024.103849
Gang Li , Zhijun Zheng , T.C.E. Cheng , Wei Wang , Feng Wu
Logistics service affects product sales and therefore plays a vital role in influencing the selling mode strategy. We investigate how two types of logistics service, namely third-party service and platform service, impact the selling mode choice between reselling and agency selling. We identify that the platform’s commission rate and product-service efficiency jointly shape the selling mode strategy. Surprisingly, in a market with third-party service, reselling mitigates double marginalization more than agency selling given high commission rates and product-service efficiency. As a result, the platform favors reselling in situations with relatively low or relatively high commission rates and product-service efficiency, and agency selling for other scenarios. However, in a market with platform service, the platform adopts agency selling (reselling) if product-service efficiency is low (high). Furthermore, we explore how the adoption of platform service changes the selling mode for the platform. Interestingly, we discover that, after the service changes from third-party service to platform service, the selling mode may change from reselling to agency selling (or from agency selling to reselling) in situations with both low commission rates and product-service efficiency (or with high commission rates and medium product-service efficiency). In addition, platform service can benefit both the platform and supplier.
{"title":"Agency selling or reselling: The impact of logistics service on selling mode choice","authors":"Gang Li , Zhijun Zheng , T.C.E. Cheng , Wei Wang , Feng Wu","doi":"10.1016/j.tre.2024.103849","DOIUrl":"10.1016/j.tre.2024.103849","url":null,"abstract":"<div><div>Logistics service affects product sales and therefore plays a vital role in influencing the selling mode strategy. We investigate how two types of logistics service, namely third-party service and platform service, impact the selling mode choice between reselling and agency selling. We identify that the platform’s commission rate and product-service efficiency jointly shape the selling mode strategy. Surprisingly, in a market with third-party service, reselling mitigates double marginalization more than agency selling given high commission rates and product-service efficiency. As a result, the platform favors reselling in situations with relatively low or relatively high commission rates and product-service efficiency, and agency selling for other scenarios. However, in a market with platform service, the platform adopts agency selling (reselling) if product-service efficiency is low (high). Furthermore, we explore how the adoption of platform service changes the selling mode for the platform. Interestingly, we discover that, after the service changes from third-party service to platform service, the selling mode may change from reselling to agency selling (or from agency selling to reselling) in situations with both low commission rates and product-service efficiency (or with high commission rates and medium product-service efficiency). In addition, platform service can benefit both the platform and supplier.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"193 ","pages":"Article 103849"},"PeriodicalIF":8.3,"publicationDate":"2024-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142637384","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号