Transportation Research Part E-Logistics and Transportation Review最新文献_第9页

Improved ADMM-based approach for optimizing intercity express transportation networks: A novel dual decomposition strategy with partial retention of coupling constraints 基于 ADMM 的改进型城际快速交通网络优化方法：部分保留耦合约束的新型对偶分解策略

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-10 DOI: 10.1016/j.tre.2024.103756

{"title":"Improved ADMM-based approach for optimizing intercity express transportation networks: A novel dual decomposition strategy with partial retention of coupling constraints","authors":"","doi":"10.1016/j.tre.2024.103756","DOIUrl":"10.1016/j.tre.2024.103756","url":null,"abstract":"<div><p>The rapid expansion of express delivery volume necessitates the development of logistics centers and the optimization of parcel transportation routes between cities within an extensive express transportation network. This study addresses the intercity express transportation network optimization problem (IETNP), which integrates the hub location problem with the multi-commodity flow problem. An integer linear programming model is introduced to represent the IETNP. To leverage the decomposable structure of the IETNP model, an improved Alternating direction method of multipliers (ADMM)-based algorithm is developed for solving the IETNP. A novel dual decomposition strategy is proposed to mitigate the negative effects of numerous coupling constraints on achieving high-quality upper-bound solutions. This strategy, incorporating penalty-term-reduction and multiplier-replacement methods, diminishes the number of penalty terms and the search space, thus enhancing computational efficiency while maintaining solution quality. A Lagrangian relaxation (LR)-based algorithm is employed to generate lower-bound solutions that assess the quality of the upper-bound solutions. Auxiliary constraints are integrated into the dualized formulation to enhance these lower-bound solutions. The effectiveness and efficiency of the improved ADMM-based algorithm are validated using over 100 artificial instances with 10–500 nodes and a realistic instance involving 338 cities. Comparative analysis with an off-the-shelf solver and existing ADMM- and LR-based algorithms reveals that the improved ADMM-based algorithm reduced the upper-bound values by 11.44% on average and by up to 22.09%.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142164139","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}

引用次数: 0

Investigating the influence of herd effect on the logit stochastic user equilibrium problem 研究羊群效应对对数随机用户均衡问题的影响

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-09 DOI: 10.1016/j.tre.2024.103743

{"title":"Investigating the influence of herd effect on the logit stochastic user equilibrium problem","authors":"","doi":"10.1016/j.tre.2024.103743","DOIUrl":"10.1016/j.tre.2024.103743","url":null,"abstract":"<div><p>In traditional traffic equilibrium models, travelers typically rely on link flow information to estimate link/route costs. However, an often-overlooked aspect in prior research is that travelers can easily acquire information about the route choices of other travelers within the same OD pair. The presentation of route flow information, combined with the influence of travelers’ herd behavior, results in novel and intriguing conclusions distinct from conventional equilibrium models. Specifically, this study demonstrates that by considering the influence of the herd effect in route choice within the stochastic user equilibrium model, it is possible to address three critical problems that remain inadequately resolved in the literature: (1) The stability of stochastic user equilibrium (SUE) in the presence of route flow information. (2) The existence of meaningful link tolls capable of steering the SUE flow pattern toward system optimum (SO). (3) The design of a trial-and-error congestion pricing scheme with disequilibrium observed network flow patterns. To tackle these problems, we present a logit SUE flow evolution process with herd effect and propose a corresponding trial-and-error congestion pricing scheme. Rigorous proofs of related convergence theorems will be provided. The findings of this study support the assertion that “herd effect can offset travelers’ perception errors”, carrying significant policy implications for leveraging herd effect in the design of navigation software and congestion pricing strategies.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142164138","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}

引用次数: 0

The Share-a-Ride Problem with mixed ride-hailing and logistic vehicles 混合乘车和物流车辆的共享乘车问题

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-09 DOI: 10.1016/j.tre.2024.103758

{"title":"The Share-a-Ride Problem with mixed ride-hailing and logistic vehicles","authors":"","doi":"10.1016/j.tre.2024.103758","DOIUrl":"10.1016/j.tre.2024.103758","url":null,"abstract":"<div><p>An extension of the Share-a-Ride Problem is proposed, which explores the coordination of ride-hailing vehicles (RVs) and logistic vehicles (LVs) for integrated passenger and parcel service. The goal is to investigate the extent to which RVs can increase profits and logistic companies can reduce operational costs, via information sharing and vehicle coordination. A new optimization problem, termed the <u>S</u>hare-<u>a</u>-<u>R</u>ide <u>p</u>roblem with <u>r</u>ide-hailing and <u>l</u>ogistic vehicles (SARP-RL), simultaneously determines the LV fleet size and passenger/parcel request assignment, assuming that passenger requests can only be served by RVs while parcel requests can be served by both RVs and LVs. The goal is to maximize the total RV profits while minimizing logistic costs. An exact solution framework is proposed by (1) generating all trips for the entire set of passenger and parcel requests via an efficient enumeration method; and (2) finding Pareto-optimal solutions of the bi-objective problem via an <span><math><mi>ɛ</mi></math></span>-constraint method. A case study of the Manhattan network demonstrates the solution characteristics of SARP-RL. The results indicate that: (a) the SARP-RL can increase total RV profits by 11.93%–27.65% and reduce logistic costs by 47.63%–81.06%. (b) The novel enumeration method achieves computational savings by over 80% compared to Alonso-Mora et al. (2017) approach. (c) Key factors influencing the performance of SARP-RL include the RV fleet size, spatial distribution of parcel requests, passenger/parcel request ratio, unit price of transport service, vehicle capacity, and passenger service requirements, which are quantitatively analyzed to offer managerial insights for real-world implementation.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142157985","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}

引用次数: 0

Characteristics and bottlenecks of sea-rail combined transportation system between South Korea and China 韩国和中国之间海铁联运系统的特点和瓶颈

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-08 DOI: 10.1016/j.tre.2024.103744

{"title":"Characteristics and bottlenecks of sea-rail combined transportation system between South Korea and China","authors":"","doi":"10.1016/j.tre.2024.103744","DOIUrl":"10.1016/j.tre.2024.103744","url":null,"abstract":"<div><p>South Korea, an island-like nation divided by the demilitarized zone within the Korean Peninsula, facilitates cargo transportation for Central Asia through a sea-rail combined transportation system (SRTS) between Korea, China, and Russia. This system effectively utilizes the China Railway Express and the <em>trans</em>-Siberian railway. The objectives of this research are three-fold: first, to scrutinize the research of the SRTS by applying text mining technique to the collected papers between 2013–2023; second, to investigate the operational and managerial aspects of the system and the problems encountered in the system from its user’s perspective, i.e., major Korean logistics companies; and lastly, to propose policy recommendations and suggestions to aimed at promoting the SRTS. Extensive interviews and field trips were conducted with prominent logistics companies in Korea, CRE platforms, international inland (dry) ports, and cross-border regions in China to accomplish the objectives. Notably, these interviews and field trips took place before and after the COVID-19 pandemic, thereby examining the pandemic’s impact on the SRTS in both South Korea and China. The key findings of the interviews reveal significant issues such as infrastructure bottlenecks, policy and subsidy challenges, and the need for a unified information-sharing platform.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142157984","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}

引用次数: 0

A math-heuristic and exact algorithm for first-mile ridesharing problem with passenger service quality preferences 具有乘客服务质量偏好的第一英里共乘问题的数学启发式和精确算法

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-05 DOI: 10.1016/j.tre.2024.103749

{"title":"A math-heuristic and exact algorithm for first-mile ridesharing problem with passenger service quality preferences","authors":"","doi":"10.1016/j.tre.2024.103749","DOIUrl":"10.1016/j.tre.2024.103749","url":null,"abstract":"<div><p>With the growing demand for high-quality mobility services, transportation service providers need to offer transit services that not only fulfill passengers’ basic travel needs but also ensure an appealing quality of service. During rush hours, fleet sizes are often insufficient to cater to all passenger preferences on service quality, such as ride time and number of co-riders, leading to the sacrifice of service quality for some passengers. Motivated by these practices, we investigate a first-mile ridesharing problem incorporating passenger service quality preferences. This problem involves intricate decisions about the match between requests and vehicles, vehicle routing, and route schedules. To solve this problem, we first develop an arc-based mixed-integer linear programming (MILP) model for this problem. For obtaining near-optimal solutions within practical computation time requirements, we reformulate the MILP model as a trip-based set-partitioning model and propose a math-heuristic algorithm. This algorithm builds upon the column-generation algorithm and tailored bidirectional labeling algorithms with novel dominance rules. Additionally, we introduce a proposition to determine the best schedule for each ridesharing route. To obtain the optimal solution for large-scale instances, we introduce a branch-and-price exact algorithm. Computational experiments based on real-world road networks and randomly generated instances confirm the effectiveness and efficiency of the proposed approaches, demonstrating that the proposed matheuristic finds near-optimal solutions within 40 s for all instances. The results also show that the presented approach significantly improves the quality of first-mile services for prioritized riders, with the ratio of satisfied requests increasing by 23% even when the fleet is generally insufficient.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142157983","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}

引用次数: 0

Making better order fulfillment in multi-tote storage and retrieval autonomous mobile robot systems 在多箱存储和检索自主移动机器人系统中更好地执行订单

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-05 DOI: 10.1016/j.tre.2024.103752

{"title":"Making better order fulfillment in multi-tote storage and retrieval autonomous mobile robot systems","authors":"","doi":"10.1016/j.tre.2024.103752","DOIUrl":"10.1016/j.tre.2024.103752","url":null,"abstract":"<div><p>The multi-tote storage and retrieval (MTSR) autonomous mobile robot (AMR) systems are increasingly prominent in e-commerce and third-party logistics. These systems feature robots capable of handling multiple totes per tour. The operational decisions of order fulfillment in MTSR AMR systems include assigning and sequencing orders and totes at various workstations and scheduling robots. The intricate interplay among order, tote, and robot significantly heightens the order fulfillment challenge in MTSR AMR systems. This study proposes a mixed-integer programming model that simultaneously determines the assignment and sequence of orders and totes, and the scheduling of robots in MTSR AMR systems with multiple workstations. We develop an item characteristic-driven adaptive large neighborhood search algorithm tailored to efficiently resolve this multifaceted problem. The numerical experiments demonstrate the effectiveness of the proposed algorithm, which swiftly yields optimal or near-optimal solutions for small-scale instances. For large-scale instances, the algorithm achieves a 50.2% reduction in makespan compared to the scheduling methods currently used in an actual warehouse. Keeping the number of robots fixed and increasing the buffer positions of the robots can lead to a substantial makespan reduction, up to 55.4%. Intriguingly, we find that augmenting the number of workstations does not proportionally decrease the makespan once the capacity of put wall at each workstation surpasses five order boxes. Furthermore, the experiments reveal that the optimal number of orders per wave is around 100, and a wider warehouse layout can reduce the makespan by 26.3% compared to a narrow layout.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142157982","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}

引用次数: 0

Heterogeneous graph social pooling for interaction-aware vehicle trajectory prediction 用于交互感知车辆轨迹预测的异构图社会池

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-04 DOI: 10.1016/j.tre.2024.103748

引用次数: 0

An efficient parking-sharing program through owner cooperation with robust slot assignment and incentive revenue distribution 通过车主合作、稳健的车位分配和激励性收入分配，实现高效的停车位共享计划

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-04 DOI: 10.1016/j.tre.2024.103697

{"title":"An efficient parking-sharing program through owner cooperation with robust slot assignment and incentive revenue distribution","authors":"","doi":"10.1016/j.tre.2024.103697","DOIUrl":"10.1016/j.tre.2024.103697","url":null,"abstract":"<div><p>This article introduces an <em>intra-owner-cooperation</em> mechanism for parking-sharing programs, which assigns private parking slot owners to use other owners’ parking slots within a community and compensates them in the meanwhile. This mechanism extends the availability of some shared slots for external drivers. To ensure practicality, this study addresses two crucial issues: (i) robust assignment of parking slots to mitigate parking conflicts caused by user unpunctuality and (ii) revenue allocation encouraging owner participation through truthful report of inconvenience costs coefficient for using others’ slots. To address the first issue, we propose a distributionally robust approach that leverages a data-driven method to estimate potential conflicts in parking schedules. For the second issue, we introduce an equitable owner-Pareto-optimal core-selecting payment rule under a cooperative game setting, which prevents collusion among owners and encourages owners to truthfully report the inconvenience cost coefficients for satisfying compensation. An efficient algorithm with core constraint generation is further developed to calculate the payments within a reasonable computational time. Several practical extensions are also presented. Numerical experiments demonstrate that the proposed mechanism significantly outperforms the existing matching approach without owner cooperation in terms of parking slot utilization, fulfillment ratio of demand, and platform income. This paper demonstrates the performance of <em>intra-owner-cooperation</em> mechanism, which ultimately enhances the overall system welfare jointly enjoyed by slot owners, drivers, and the platform.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136869","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}

引用次数: 0

A choice-driven service network design and pricing including heterogeneous behaviors 包括异质行为在内的选择驱动型服务网络设计与定价

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-04 DOI: 10.1016/j.tre.2024.103740

{"title":"A choice-driven service network design and pricing including heterogeneous behaviors","authors":"","doi":"10.1016/j.tre.2024.103740","DOIUrl":"10.1016/j.tre.2024.103740","url":null,"abstract":"<div><p>The design and pricing of services are two of the most important decisions faced by any intermodal transport operator. The key success factor lies in the ability to meet the needs of the shippers. Therefore, making full use of the available information about the demand helps to come up with good design and pricing decisions. With this in mind, we propose a Choice-Driven approach, incorporating advanced choice models directly into a Service Network Design and Pricing problem. We evaluate this approach considering both deterministic and stochastic choice models. To reduce the computational time for the stochastic instances, we propose a predetermination heuristic. The proposed models are compared to a benchmark, where shippers are solely cost-minimizers. Results show that the operator’s profits can be significantly improved, even with deterministic models. The stochastic versions further increase the realized profits: in particular, considering shippers’ heterogeneity allows a better estimation of the demand.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1366554524003314/pdfft?md5=69e14a4461c170ba6411fe69cf12d32e&pid=1-s2.0-S1366554524003314-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136870","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Joint optimization of order picking and delivery in ergonomic picking systems with due dates for sustainability and resilience 在符合人体工程学原理的分拣系统中，联合优化订单分拣和交付，实现可持续性和复原力

IF 8.3 1区工程技术

Transportation Research Part E-Logistics and Transportation Review Pub Date : 2024-09-04 DOI: 10.1016/j.tre.2024.103727

{"title":"Joint optimization of order picking and delivery in ergonomic picking systems with due dates for sustainability and resilience","authors":"","doi":"10.1016/j.tre.2024.103727","DOIUrl":"10.1016/j.tre.2024.103727","url":null,"abstract":"<div><p>E-commerce platforms, driven by consumer demand for same-day or even half-day delivery, face challenges such as high order volumes with varying due dates, multiple picking stations, and multiple delivery regions. These challenges may lead to order tardiness and decreased efficiency and responsiveness of warehouse logistics. This study jointly optimizes order picking and delivery in ergonomic picking systems by addressing order assignment, sequencing, picking, and delivery operations while considering due dates and minimizing order tardiness and delivery costs. A mixed integer programming (MIP) model is formulated, and an improved knowledge-guided fruit fly optimization algorithm with the shortest waiting time rule (IKGFOA-SWT) as a heuristic solution procedure is developed to solve the problem. The IKGFOA-SWT comprises three modules including an order assignment and sequencing module using IKGFOA, an order picking module employing the SWT rule, and a batch delivery module balancing the delivery and tardiness costs. Computational experiments are conducted to validate the MIP model and evaluate the performance of IKGFOA-SWT. The benchmark experiment underscores the importance of integrating order picking and delivery operations within a unified scheduling framework rather than treating them as independent optimization tasks. The small-scale experiment verifies the effectiveness of IKGFOA-SWT in finding optimal solutions. The large-scale experiment demonstrates the superiority of IKGFOA-SWT in generating high-quality solutions. This study provides valuable managerial insights and practical tools for the optimization of warehouse logistics operations, and contributes to the new norms of supply chain sustainability and resilience.</p></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":null,"pages":null},"PeriodicalIF":8.3,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142136871","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}

引用次数: 0