具有灵活服务启动时间和时间窗口的多拖车拖运集装箱拖运问题

IF 7.2 2区管理学 Q1 MANAGEMENT

Omega-international Journal of Management Science Pub Date : 2025-09-04 DOI:10.1016/j.omega.2025.103422

Decheng Wang , Zhihui Fan , Yarong Liu , Ilkyeong Moon

{"title":"具有灵活服务启动时间和时间窗口的多拖车拖运集装箱拖运问题","authors":"Decheng Wang , Zhihui Fan , Yarong Liu , Ilkyeong Moon","doi":"10.1016/j.omega.2025.103422","DOIUrl":null,"url":null,"abstract":"<div><div>Trailer detention at delivery locations, frequently caused by the time-consuming (un)packing process, presents a significant challenge in container drayage. Despite extensive research on container drayage, the specific issues stemming from trailer detention remain relatively underexplored. This study addresses a trailer-detention-constrained multi-trailer drop-and-pull container drayage problem, incorporating flexible service starting times and time windows. The detained trailers differ from standard trailers as they require only a single pickup operation within the planning horizon, rather than the typical two-step delivery and subsequent pickup. These pickup operations must be completed within specified time windows due to their potential to disrupt logistics efficiency and often require time-sensitive handling. Furthermore, time windows are imposed on normal trailer deliveries, as these operations initiate the (un)packing process, which can impact the operational efficiency of customer activities. The problem involves tractors capable of towing multiple trailers, utilizing the drop-and-pull method for detachment and reattachment. Tractors possess the flexibility to select their service starting times. To address the inherent complexity of this problem, a mixed-integer programming model is developed alongside a tailored heuristic algorithm. The algorithm leverages a modified Clarke-and-Wright algorithm to generate both rapid and high-quality initial solutions. It strategically integrates the mathematical model, ensuring solution quality is maintained without compromising computational efficiency. To further enhance solution efficiency, a route-based release-fix-optimize method is implemented. Extensive computational experiments validate the efficacy of the proposed methods and examine the impact of time windows and detained inbound and outbound requests on transportation plans, offering valuable insights for effectively managing logistics systems.</div></div>","PeriodicalId":19529,"journal":{"name":"Omega-international Journal of Management Science","volume":"138 ","pages":"Article 103422"},"PeriodicalIF":7.2000,"publicationDate":"2025-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A trailer-detention-constrained multi-trailer drop-and-pull container drayage problem with flexible service starting time and time windows\",\"authors\":\"Decheng Wang , Zhihui Fan , Yarong Liu , Ilkyeong Moon\",\"doi\":\"10.1016/j.omega.2025.103422\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Trailer detention at delivery locations, frequently caused by the time-consuming (un)packing process, presents a significant challenge in container drayage. Despite extensive research on container drayage, the specific issues stemming from trailer detention remain relatively underexplored. This study addresses a trailer-detention-constrained multi-trailer drop-and-pull container drayage problem, incorporating flexible service starting times and time windows. The detained trailers differ from standard trailers as they require only a single pickup operation within the planning horizon, rather than the typical two-step delivery and subsequent pickup. These pickup operations must be completed within specified time windows due to their potential to disrupt logistics efficiency and often require time-sensitive handling. Furthermore, time windows are imposed on normal trailer deliveries, as these operations initiate the (un)packing process, which can impact the operational efficiency of customer activities. The problem involves tractors capable of towing multiple trailers, utilizing the drop-and-pull method for detachment and reattachment. Tractors possess the flexibility to select their service starting times. To address the inherent complexity of this problem, a mixed-integer programming model is developed alongside a tailored heuristic algorithm. The algorithm leverages a modified Clarke-and-Wright algorithm to generate both rapid and high-quality initial solutions. It strategically integrates the mathematical model, ensuring solution quality is maintained without compromising computational efficiency. To further enhance solution efficiency, a route-based release-fix-optimize method is implemented. Extensive computational experiments validate the efficacy of the proposed methods and examine the impact of time windows and detained inbound and outbound requests on transportation plans, offering valuable insights for effectively managing logistics systems.</div></div>\",\"PeriodicalId\":19529,\"journal\":{\"name\":\"Omega-international Journal of Management Science\",\"volume\":\"138 \",\"pages\":\"Article 103422\"},\"PeriodicalIF\":7.2000,\"publicationDate\":\"2025-09-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Omega-international Journal of Management Science\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0305048325001483\",\"RegionNum\":2,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Omega-international Journal of Management Science","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0305048325001483","RegionNum":2,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MANAGEMENT","Score":null,"Total":0}

引用次数: 0

摘要

拖车滞留在交货地点，往往是由耗时（非）包装过程造成的，这对集装箱运输提出了重大挑战。尽管对集装箱拖曳进行了广泛的研究，但拖车滞留的具体问题仍未得到充分探讨。本研究解决了拖车滞留受限的多拖车装卸集装箱拖运问题，结合了灵活的服务启动时间和时间窗口。被扣留的拖车与标准拖车不同，因为它们只需要在计划范围内进行一次取货操作，而不是典型的两步交付和随后的取货。这些取货操作必须在规定的时间内完成，因为它们可能会破坏物流效率，并且通常需要对时间敏感的处理。此外，正常的拖车运输需要时间窗口，因为这些操作会启动（非）包装过程，这会影响客户活动的运营效率。该问题涉及能够牵引多个拖车的拖拉机，利用拉放方法分离和重新附着。拖拉机具有灵活选择其服务启动时间的能力。为了解决这个问题固有的复杂性，我们开发了一个混合整数规划模型和一个定制的启发式算法。该算法利用改进的clark - wright算法生成快速且高质量的初始解。它战略性地集成了数学模型，确保在不影响计算效率的情况下保持解决方案的质量。为了进一步提高求解效率，实现了基于路径的释放-修复-优化方法。大量的计算实验验证了所提出方法的有效性，并检查了时间窗口和滞留的入境和出境请求对运输计划的影响，为有效管理物流系统提供了有价值的见解。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A trailer-detention-constrained multi-trailer drop-and-pull container drayage problem with flexible service starting time and time windows

Trailer detention at delivery locations, frequently caused by the time-consuming (un)packing process, presents a significant challenge in container drayage. Despite extensive research on container drayage, the specific issues stemming from trailer detention remain relatively underexplored. This study addresses a trailer-detention-constrained multi-trailer drop-and-pull container drayage problem, incorporating flexible service starting times and time windows. The detained trailers differ from standard trailers as they require only a single pickup operation within the planning horizon, rather than the typical two-step delivery and subsequent pickup. These pickup operations must be completed within specified time windows due to their potential to disrupt logistics efficiency and often require time-sensitive handling. Furthermore, time windows are imposed on normal trailer deliveries, as these operations initiate the (un)packing process, which can impact the operational efficiency of customer activities. The problem involves tractors capable of towing multiple trailers, utilizing the drop-and-pull method for detachment and reattachment. Tractors possess the flexibility to select their service starting times. To address the inherent complexity of this problem, a mixed-integer programming model is developed alongside a tailored heuristic algorithm. The algorithm leverages a modified Clarke-and-Wright algorithm to generate both rapid and high-quality initial solutions. It strategically integrates the mathematical model, ensuring solution quality is maintained without compromising computational efficiency. To further enhance solution efficiency, a route-based release-fix-optimize method is implemented. Extensive computational experiments validate the efficacy of the proposed methods and examine the impact of time windows and detained inbound and outbound requests on transportation plans, offering valuable insights for effectively managing logistics systems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Omega-international Journal of Management Science 管理科学-运筹学与管理科学

CiteScore

13.80

自引率

11.60%

发文量

130

审稿时长

56 days

期刊介绍： Omega reports on developments in management, including the latest research results and applications. Original contributions and review articles describe the state of the art in specific fields or functions of management, while there are shorter critical assessments of particular management techniques. Other features of the journal are the "Memoranda" section for short communications and "Feedback", a correspondence column. Omega is both stimulating reading and an important source for practising managers, specialists in management services, operational research workers and management scientists, management consultants, academics, students and research personnel throughout the world. The material published is of high quality and relevance, written in a manner which makes it accessible to all of this wide-ranging readership. Preference will be given to papers with implications to the practice of management. Submissions of purely theoretical papers are discouraged. The review of material for publication in the journal reflects this aim.