{"title":"多重运输方式、全网时间相互依赖的双层集装箱运输","authors":"Decheng Wang , Xiaolan Xie , Ilkyeong Moon","doi":"10.1016/j.tre.2025.104436","DOIUrl":null,"url":null,"abstract":"<div><div>This study addresses a two-echelon container drayage problem incorporating multiple transportation modes, and attempts to explore its potential application advantages. The problem concentrates on truckload transportation, and represents a variation of the classical two-echelon capacity-constrained vehicle routing problem. In the first echelon, a fleet of tractors, often employing long combination vehicles, transports trailers between a central depot and multiple satellites. In the second echelon, a fleet of tractors, restricted to a single-trailer stay-with mode, due to transportation regulations, executes multi-trip trailer transportation between satellites and customers. The tractor can perform two operations of dropping-off and pulling-up trailers (i.e., simultaneous delivery and collection of containers are involved). These characteristics make the routes of the two echelons couple tightly, and result in intertwined time interdependence within the entire network. A mathematical formulation is developed to address this two-echelon scheduling with time interdependence. To enhance computational efficiency, two groups of valid inequalities are provided. A two-stage matheuristic algorithm integrating the proposed mathematical model and heuristic techniques is developed. A route-string scheduling framework combined with a fixing and releasing mechanism is introduced to mitigate the complexity associated with the time-interdependence nature of the network. This algorithm, possessing fewer parameters than comparable (meta-) heuristics, offers a practical implementation. The mathematical model, along with the valid inequalities and the performance of the matheuristic algorithm, are validated through computational experiments using established instances from prior studies. Furthermore, experiments are undertaken to investigate the effects of customer distribution patterns and maximum permissible trailers count on operational efficiency.</div></div>","PeriodicalId":49418,"journal":{"name":"Transportation Research Part E-Logistics and Transportation Review","volume":"204 ","pages":"Article 104436"},"PeriodicalIF":8.8000,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Two-echelon container drayage with multiple transportation modes and overall-network time interdependence\",\"authors\":\"Decheng Wang , Xiaolan Xie , Ilkyeong Moon\",\"doi\":\"10.1016/j.tre.2025.104436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This study addresses a two-echelon container drayage problem incorporating multiple transportation modes, and attempts to explore its potential application advantages. The problem concentrates on truckload transportation, and represents a variation of the classical two-echelon capacity-constrained vehicle routing problem. In the first echelon, a fleet of tractors, often employing long combination vehicles, transports trailers between a central depot and multiple satellites. In the second echelon, a fleet of tractors, restricted to a single-trailer stay-with mode, due to transportation regulations, executes multi-trip trailer transportation between satellites and customers. The tractor can perform two operations of dropping-off and pulling-up trailers (i.e., simultaneous delivery and collection of containers are involved). These characteristics make the routes of the two echelons couple tightly, and result in intertwined time interdependence within the entire network. A mathematical formulation is developed to address this two-echelon scheduling with time interdependence. To enhance computational efficiency, two groups of valid inequalities are provided. A two-stage matheuristic algorithm integrating the proposed mathematical model and heuristic techniques is developed. A route-string scheduling framework combined with a fixing and releasing mechanism is introduced to mitigate the complexity associated with the time-interdependence nature of the network. This algorithm, possessing fewer parameters than comparable (meta-) heuristics, offers a practical implementation. The mathematical model, along with the valid inequalities and the performance of the matheuristic algorithm, are validated through computational experiments using established instances from prior studies. Furthermore, experiments are undertaken to investigate the effects of customer distribution patterns and maximum permissible trailers count on operational efficiency.</div></div>\",\"PeriodicalId\":49418,\"journal\":{\"name\":\"Transportation Research Part E-Logistics and Transportation Review\",\"volume\":\"204 \",\"pages\":\"Article 104436\"},\"PeriodicalIF\":8.8000,\"publicationDate\":\"2025-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Research Part E-Logistics and Transportation Review\",\"FirstCategoryId\":\"5\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1366554525004776\",\"RegionNum\":1,\"RegionCategory\":\"工程技术\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Research Part E-Logistics and Transportation Review","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1366554525004776","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
Two-echelon container drayage with multiple transportation modes and overall-network time interdependence
This study addresses a two-echelon container drayage problem incorporating multiple transportation modes, and attempts to explore its potential application advantages. The problem concentrates on truckload transportation, and represents a variation of the classical two-echelon capacity-constrained vehicle routing problem. In the first echelon, a fleet of tractors, often employing long combination vehicles, transports trailers between a central depot and multiple satellites. In the second echelon, a fleet of tractors, restricted to a single-trailer stay-with mode, due to transportation regulations, executes multi-trip trailer transportation between satellites and customers. The tractor can perform two operations of dropping-off and pulling-up trailers (i.e., simultaneous delivery and collection of containers are involved). These characteristics make the routes of the two echelons couple tightly, and result in intertwined time interdependence within the entire network. A mathematical formulation is developed to address this two-echelon scheduling with time interdependence. To enhance computational efficiency, two groups of valid inequalities are provided. A two-stage matheuristic algorithm integrating the proposed mathematical model and heuristic techniques is developed. A route-string scheduling framework combined with a fixing and releasing mechanism is introduced to mitigate the complexity associated with the time-interdependence nature of the network. This algorithm, possessing fewer parameters than comparable (meta-) heuristics, offers a practical implementation. The mathematical model, along with the valid inequalities and the performance of the matheuristic algorithm, are validated through computational experiments using established instances from prior studies. Furthermore, experiments are undertaken to investigate the effects of customer distribution patterns and maximum permissible trailers count on operational efficiency.
期刊介绍:
Transportation Research Part E: Logistics and Transportation Review is a reputable journal that publishes high-quality articles covering a wide range of topics in the field of logistics and transportation research. The journal welcomes submissions on various subjects, including transport economics, transport infrastructure and investment appraisal, evaluation of public policies related to transportation, empirical and analytical studies of logistics management practices and performance, logistics and operations models, and logistics and supply chain management.
Part E aims to provide informative and well-researched articles that contribute to the understanding and advancement of the field. The content of the journal is complementary to other prestigious journals in transportation research, such as Transportation Research Part A: Policy and Practice, Part B: Methodological, Part C: Emerging Technologies, Part D: Transport and Environment, and Part F: Traffic Psychology and Behaviour. Together, these journals form a comprehensive and cohesive reference for current research in transportation science.