A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM

被引：12

作者：

Guerriero, Francesca ^{[1
]}

Bruni, Maria Elena ^{[1
]}

Greco, Francesca ^{[1
]}

机构：

[1] Univ Calabria, Dipartimento Ingn Meccan Energet & Gestionale, I-87030 Cosenza, Italy

来源：

ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH | 2013年 / 30卷 / 01期

关键词：

Dial-a-ride; metaheuristics; tabu search; greedy randomized adaptive search; TRANSPORTATION; ALGORITHMS; MODELS; GRASP; PICKUP;

D O I：

10.1142/S0217595912500467

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a hybrid metaheuristic for solving the static dial-a-ride problem with heterogeneous vehicles and fixed costs. The hybridization combines a reactive greedy randomized adaptive search, used as outer scheme, with a tabu search heuristic in the local search phase. The algorithm is evaluated on well-known instances taken from the literature and on a set of randomly generated test problems, varying in the number of customers. Extensive computational results show the effectiveness of the hybrid approach in terms of trade-off between solution quality and computational time.

引用

页数：17

共 26 条

[1] Hybrid scheduling methods for paratransit operations [J].