The Dial-a-Ride Problem with Limited Pickups per Trip

 0 Người đánh giá. Xếp hạng trung bình 0

Tác giả: Roel Leus, Kai Wang, Wenchao Wei, Boshuai Zhao

Ngôn ngữ: eng

Ký hiệu phân loại: 388.41322 *Local transportation

Thông tin xuất bản: 2024

Mô tả vật lý:

Bộ sưu tập: Metadata

ID: 203737

Comment: Presented at 38th Annual Conference of the Belgian Operational Research Society, Date: 2024/02/08 - 2024/02/09, Location: AntwerpThe Dial-a-Ride Problem (DARP) is an optimization problem that involves determining optimal routes and schedules for several vehicles to pick up and deliver items at minimum cost. Motivated by real-world carpooling and crowdshipping scenarios, we introduce an additional constraint imposing a maximum number on the number of pickups per trip. This results in the Dial-a-Ride Problem with Limited Pickups per Trip (DARP-LPT). We apply a fragment-based method for DARP-LPT, where a fragment is a partial path. Specifically, we extend two formulations from Rist & Forbes (2021): the Fragment Flow Formulation (FFF) and the Fragment Assignment Formulation (FAF). We establish FFF's superiority over FAF, both from a theoretical as well as from a computational perspective. Furthermore, our results show that FFF and FAF significantly outperform traditional arc-based formulations in terms of solution quality and time. Additionally, compared to the two existing fragment sets, one with longer partial paths and another with shorter ones, our newly generated fragment sets perform better in terms of solution quality and time when fed into FFF.
Tạo bộ sưu tập với mã QR

THƯ VIỆN - TRƯỜNG ĐẠI HỌC CÔNG NGHỆ TP.HCM

ĐT: (028) 36225755 | Email: tt.thuvien@hutech.edu.vn

Copyright @2024 THƯ VIỆN HUTECH