کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6892968 699348 2014 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The Dial-A-Ride Problem with Transfers
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
The Dial-A-Ride Problem with Transfers
چکیده انگلیسی
The Dial-A-Ride Problem with Transfers (DARPT) consists in defining a set of routes that satisfy transportation requests of users between a set of pickup points and a set of delivery points, in the presence of ride time constraints. Users may change vehicles during their trip. This change of vehicle, called a transfer, is made at specific locations called transfer points. Solving the DARPT involves modeling and algorithmic difficulties. In this paper we provide a solution method based on an Adaptive Large Neighborhood Search (ALNS) metaheuristic and explain how to check the feasibility of a request insertion. The method is evaluated on real-life and generated instances. Experiments show that savings due to transfers can be up to 8% on real-life instances.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 41, January 2014, Pages 12-23
نویسندگان
, , ,