Journal Article10.1016/j.tre.2023.103138
An exact algorithm for the multi-trip container drayage problem with truck platooning
Ji-Won You,Yuan Wang,Zhaojie Xue +2 more
13
TL;DR: In this article , a Branch and Price-and-Cut (BPC) algorithm was proposed to solve the multi-trip container drayage problem with truck platooning (MT-CDP-TP), where multiple-trip, platooning, and fuel cost reduction are simultaneously considered in a CDP.
read more
Abstract: Container Drayage Problem (CDP) refers to the optimization problem of routing and scheduling a set of container trucks around a container terminal. Conventionally, a driver is stuck to one container truck and allowed to perform multiple trips (multi-trip) to the terminal within their working time. The recent development of automation technologies enables semi-autonomous trucks to follow the leading human-driven truck as a platoon on the road; therefore, truck platooning can save human labor and reduce the fuel cost of following trucks through aerodynamic drag reduction. In this paper, we study a multi-trip container drayage problem with truck platooning (MT-CDP-TP), where multi-trip, truck platooning, and fuel cost reduction are simultaneously considered in a CDP. Despite the operational benefits brought by the MT-CDP-TP, the problem is challenging to solve due to its NP-hardness when formulated as a multi-trip pickup and delivery problem with load-dependent cost. We propose a Branch-and-Price-and-Cut (BPC) algorithm, with a route-based set partitioning model and tight linear relaxations, to yield the exact solutions. Valid inequalities are generated based on a graph structure, where each node represents a feasible route, and each arc stands for the conflict between two routes. Moreover, we design a tailored pulse propagation algorithm with novel pruning procedures based on the dual information from the master problem and valid inequalities to solve the pricing problem efficiently. Extensive numerical experiments are conducted for performance validation, and the computational results show that the proposed exact algorithm can solve instances with up to 100 task nodes (i.e., 50 customers) and facilitate reducing the labor cost and fuel consumption by a wide margin in container drayage operations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Local container drayage problem with improved truck platooning operations
Xiaoyuan Yan,Min Xu,Chi Xie +2 more
TL;DR: Wang et al. as mentioned in this paper examined the local container drayage problem under a novel improved platooning operation mode (IPOM), where the drivers are not necessarily attached to their respective leading trucks but can move by alternative transport modes to perform subsequent tasks.
17
Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers
Ruiyou Zhang,Bin Qiu,Wenpeng Chen +2 more
- 01 Nov 2023
TL;DR: This paper addresses a drop-and-pull container drayage problem with flexible work break assignment for vehicle drivers, formulating a mixed-integer programming model and proposing a backtracking adaptive threshold accepting algorithm with tabu search to efficiently handle scheduling, routing, and work break assignment.
3
Optimal autonomous truck platooning with detours, nonlinear costs, and a platoon size constraint
Qingwu Hu,Weihua Gu,Lingxiao Wu,Le Zhang +3 more
TL;DR: Optimal autonomous truck platooning with detours, nonlinear costs, and a platoon size constraint optimizes truck platoon formation, scheduling, and routing to minimize costs related to labor and fuel, considering detours, nonlinear fuel savings, and a platoon size constraint.
3
Sustainable truck platooning operations in maritime shipping: A data-driven approach
Zhaojing Yang,Min Xu,Simon Tian +2 more
2
The full truckload pickup and delivery problem with truck platooning
Yilin Wang,Junlong Zhang +1 more
1
References
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
3.7K
A new optimization algorithm for the vehicle routing problem with time windows
TL;DR: This paper presents a new optimization algorithm capable of optimally solving 100-customer problems of the vehicle routing problem with time windows VRPTW and indicates that this algorithm proved to be successful on a variety of practical sized benchmark VRPTw test problems.
1.2K
Solving airline crew scheduling problems by branch-and-cut
Karla Hoffman,Manfred Padberg +1 more
TL;DR: The branch-and-cut solver as discussed by the authors generates cutting planes based on the underlying structure of the polytope defined by the convex hull of the feasible integer points and incorporates these cuts into a tree-search algorithm that uses automatic reformulation procedures, heuristics and linear programming technology to assist in the solution.
599
On the optimal error regulation of a string of moving vehicles
William S. Levine,Michael Athans +1 more
TL;DR: The theory of optimal control is used to design an optimal linear feedback system which regulates the position and velocity of every vehicle in a densely packed string of high-speed moving vehicles.
509
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
TL;DR: A new route relaxation called ng-route is introduced, used by different dual ascent heuristics to find near-optimal dual solutions of the LP-relaxation of the SP model, and a column-and-cut generation algorithm strengthened by valid inequalities that uses a new strategy for solving the pricing problem.