کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
383447 660821 2013 16 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
پیش نمایش صفحه اول مقاله
A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city
چکیده انگلیسی


• A new VNS algorithm is proposed for solving a DARP.
• Several neighborhood classes and different schemes for combining them are proposed.
• The algorithm is tested on demanding scenarios in the city of San Francisco.
• The results have been compared against state of the art algorithms.
• According to statistical tests, the proposal has obtained the best results.

On-demand transportation is becoming a new necessary service for modern (public and private) mobility and logistics providers. Large cities are demanding more and more share transportation services with flexible routes, resulting from user dynamic demands. In this study a new algorithm is proposed for solving the problem of computing the best routes that a public transportation company could offer to satisfy a number of customer requests. In this problem, known in the literature as the dial-a-ride problem, a number of passengers has to be transported between pickup and delivery locations trying to minimize the routing costs while respecting a set of pre-specified constraints (maximum pickup time, maximum ride duration and maximum load per vehicle). For optimizing this problem, a new variable neighborhood search has been developed and tested on a set of 24 different scenarios of a large-scale dial-a-ride problem in the city of San Francisco. The results have been compared against two state-of-the-art algorithms of the literature and validated by means of statistical procedures proving that the new algorithm has obtained the best overall results.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 40, Issue 14, 15 October 2013, Pages 5516–5531
نویسندگان
, , ,