A variable neighborhood search algorithm for the optimization of a dial-a-ride problem in a large city

作者：

Highlights：

• 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.

摘要

•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.

论文关键词：Metaheuristic,Variable neighborhood search,Transportation,Dial-a-ride problem,Demand-responsive transport

论文评审过程：Available online 19 April 2013.

论文官网地址：https://doi.org/10.1016/j.eswa.2013.04.015