Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.20844 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908469543567360 |
|---|---|
| author | Ahmed, Mohammed Faisal Van Hentenryck, Pascal Nashar, Ahmed El |
| author_facet | Ahmed, Mohammed Faisal Van Hentenryck, Pascal Nashar, Ahmed El |
| contents | This paper introduces the Trailer Path Optimization with Schedule Services Problem (TPOSSP) and proposes a column-generation heuristic (CG-heuristic) to find high-quality solutions to large-scale instances. The TPOSSP aims at determining trailer routes over a time-dependent network using existing scheduled services, while considering tractor capacity constraints and time windows for trailer pickups and deliveries. The objective is to minimize both the number of schedules used and the total miles traveled. To address the large scale of industrial instances, the paper proposes a network reduction technique that identifies the set of feasible schedule-legs for each requests. Moreover, to address the resulting MIP models, that still contains hundred of millions variables, the paper proposes a stabilized column-generation, whose pricing problem is a time-dependent shortest path. The approach is evaluated on industrial instances both for tactical planning where requests for the entire network are re-optimized and for real-time operations where new requests are inserted. In the tactical planning setting, the column-generation heuristic returns solutions with a 3.7%-5.7% optimality gap (based on a MIP relaxation) in under 1.7-10.3 hours, and improves the current practice by 2.3-3.2%, with translates into savings of tens of millions of dollars a year. In the real-time setting, the column-generation heuristic returns solution within 3% of optimality in under 1 minute, which makes it adequate for real-time deployment. The results also show that the network reduction decreases run times by 85% for the column-generation heuristic. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_20844 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Route Optimization Over Scheduled Services For Large-Scale Package Delivery Networks Ahmed, Mohammed Faisal Van Hentenryck, Pascal Nashar, Ahmed El Optimization and Control This paper introduces the Trailer Path Optimization with Schedule Services Problem (TPOSSP) and proposes a column-generation heuristic (CG-heuristic) to find high-quality solutions to large-scale instances. The TPOSSP aims at determining trailer routes over a time-dependent network using existing scheduled services, while considering tractor capacity constraints and time windows for trailer pickups and deliveries. The objective is to minimize both the number of schedules used and the total miles traveled. To address the large scale of industrial instances, the paper proposes a network reduction technique that identifies the set of feasible schedule-legs for each requests. Moreover, to address the resulting MIP models, that still contains hundred of millions variables, the paper proposes a stabilized column-generation, whose pricing problem is a time-dependent shortest path. The approach is evaluated on industrial instances both for tactical planning where requests for the entire network are re-optimized and for real-time operations where new requests are inserted. In the tactical planning setting, the column-generation heuristic returns solutions with a 3.7%-5.7% optimality gap (based on a MIP relaxation) in under 1.7-10.3 hours, and improves the current practice by 2.3-3.2%, with translates into savings of tens of millions of dollars a year. In the real-time setting, the column-generation heuristic returns solution within 3% of optimality in under 1 minute, which makes it adequate for real-time deployment. The results also show that the network reduction decreases run times by 85% for the column-generation heuristic. |
| title | Route Optimization Over Scheduled Services For Large-Scale Package Delivery Networks |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2507.20844 |