A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
A Branch and Price Algorithm for the Drop-and-Pickup Container Drayage Problem with Empty Container Constraints
This paper addresses the drop-and-pickup container drayage problem with empty container constraints. In this problem, a truck is allowed to drop off the container at the customer and then leave. After the container has been packed/unpacked, the truck returns to pick it up. The problem is further complicated by the fact that empty containers at the depot are often limited in number. This container drayage problem is of great practical importance but seldom investigated. In this paper, we first formulate the problem as a directed graph and then mathematically model it as a mixed-integer linear program (MILP) with the objective of minimizing total travel costs. To solve the MILP effectively, we devise a branch and price algorithm that incorporates several performance enhancement strategies, including three versions of the bi-directional label setting algorithm, preprocessing of time windows and a heuristic for high-quality upper bounds. The experimental results indicate that (1) the proposed algorithm significantly outperforms CPLEX in terms of efficiency and effectiveness, (2) an average cost saving of 9.95∼12.25% can be achieved from the drop-and-pickup mode and (3) the benefit of drop-and-pickup mode increases when the customer density and the fixed cost increase.
A Branch and Price Algorithm for the Drop-and-Pickup Container Drayage Problem with Empty Container Constraints
This paper addresses the drop-and-pickup container drayage problem with empty container constraints. In this problem, a truck is allowed to drop off the container at the customer and then leave. After the container has been packed/unpacked, the truck returns to pick it up. The problem is further complicated by the fact that empty containers at the depot are often limited in number. This container drayage problem is of great practical importance but seldom investigated. In this paper, we first formulate the problem as a directed graph and then mathematically model it as a mixed-integer linear program (MILP) with the objective of minimizing total travel costs. To solve the MILP effectively, we devise a branch and price algorithm that incorporates several performance enhancement strategies, including three versions of the bi-directional label setting algorithm, preprocessing of time windows and a heuristic for high-quality upper bounds. The experimental results indicate that (1) the proposed algorithm significantly outperforms CPLEX in terms of efficiency and effectiveness, (2) an average cost saving of 9.95∼12.25% can be achieved from the drop-and-pickup mode and (3) the benefit of drop-and-pickup mode increases when the customer density and the fixed cost increase.
A Branch and Price Algorithm for the Drop-and-Pickup Container Drayage Problem with Empty Container Constraints
Yujian Song (author) / Yuting Zhang (author) / Wanli Wang (author) / Ming Xue (author)
2023
Article (Journal)
Electronic Resource
Unknown
Metadata by DOAJ is licensed under CC BY-SA 1.0
Intermodal Container Routing: Integrating Long-Haul Routing and Local Drayage Decisions
| DOAJ | 2019
Container-Filling Problem Under Capacity Constraints
| British Library Conference Proceedings | 1995
Optimization of Passenger-like Container Train Running Plan Considering Empty Container Dispatch
| DOAJ | 2022