The pickup and delivery problem with transshipments: Critical review of two existing models and a new formulation

Lyu, Zefeng; Yu, Andrew Junfang

doi:10.1016/j.ejor.2022.05.053

Cited by 12 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Extensions to the original PDP provide further correlations, namely the consideration of goods transfer between vehicles, the PDP with transshipments (PDP-T), and the consideration of activity-specific timewindows, the PDP with time windows (PDPTW). Methods addressing the Pickup and Delivery Problem with Time-Windows and Transshipments (PDPTWT) have evolved over the years, from an iterative, 2-phase heuristic method that provides sub-optimal solutions [30], to mixed integer linear programming formulations that consider a broad set of system constraints and objectives [28,34,44]. The current state of the art, discussed in Lyu and Yu [28], demonstrates optimal solutions for scenarios featuring up to 25 requests and 2 transshipment stations.…”

Section: The Pickup and Delivery Problemmentioning

confidence: 99%

“…Methods addressing the Pickup and Delivery Problem with Time-Windows and Transshipments (PDPTWT) have evolved over the years, from an iterative, 2-phase heuristic method that provides sub-optimal solutions [30], to mixed integer linear programming formulations that consider a broad set of system constraints and objectives [28,34,44]. The current state of the art, discussed in Lyu and Yu [28], demonstrates optimal solutions for scenarios featuring up to 25 requests and 2 transshipment stations. The satellite constellation applications being addressed here, are orders of magnitude greater in terms of both transshipment opportunities and request count.…”

Section: The Pickup and Delivery Problemmentioning

confidence: 99%

See 1 more Smart Citation

A Delay-Tolerant Network Approach to Satellite Pickup and Delivery Scheduling

Lowe¹,

Clark²,

McGrath

et al. 2023

Preprint

View full text Add to dashboard Cite

Section: The Pickup and Delivery Problemmentioning

confidence: 99%

Section: The Pickup and Delivery Problemmentioning

confidence: 99%

A Delay-Tolerant Network Approach to Satellite Pickup and Delivery Scheduling

Lowe¹,

Clark²,

McGrath

et al. 2023

Preprint

View full text Add to dashboard Cite

“…With few exceptions, PDPT is mostly approached with heuristics dominated by meta-heuristic methods. Exact algorithms are proposed in (Cortés, Matamala, and Contardo 2010;Rais, Alvelos, and Carvalho 2014;Lyu and Yu 2022).…”

Section: Related Work and Motivationmentioning

confidence: 99%

Real-World Pickup and Delivery Problem with Transfers

Sobotka

Rudová

2023

SOCS

View full text Add to dashboard Cite

The pickup and delivery problem with transfers generalizes the classical pickup and delivery problem (PDP) by allowing the vehicles to exchange request loads at designated transfer points. Transfers often lead to substantial reductions in transportation costs, yet they come with a significant burden of additional computational complexity. Even meta-heuristic methods are thus limited to instances of at most lower hundreds of requests leaving the desirable benefits unreachable for larger instances. Our approach bypasses the complexities inherent to current methods by deciding about the transfers apriori and thus reducing the problem to a PDP instance. To make as informed decisions as possible, we analyze a broader set of characteristics that may be used to carry out the apriori decisions. We opt to derive and examine multiple such PDP instances to cover different transfer choices. Our analysis of the derived PDP instances then allows their efficient processing in parallel. The proposed framework addresses a large-scale freight transportation problem with real-world characteristics and transfers where typical instances count over 1,200 requests and 300 vehicles. We show the potential of the proposed framework on both real-world and synthetic instances with up to 1,500 requests. The experiments demonstrate that substantial savings may be achieved within favorable runtimes even for very large instances.

show abstract