A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem

Asia-Pacific Journal of Operational Research

Volumn 30, Issue 1, 2013, Pages

  Guerriero, Francesca ^a   Bruni, Maria Elena ^a   Greco, Francesca ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Dial a ride; greedy randomized adaptive search; metaheuristics; tabu search

Indexed keywords

ADAPTIVE SEARCH; COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; DIAL-A-RIDE; DIAL-A-RIDE PROBLEM; FIXED COST; HETEROGENEOUS VEHICLES; HYBRID APPROACH; HYBRID META-HEURISTIC; LOCAL SEARCH; META HEURISTICS; SOLUTION QUALITY; TABU SEARCH HEURISTIC; TEST PROBLEM;

COST ACCOUNTING; TABU SEARCH;

HEURISTIC ALGORITHMS;

EID: 84874147067     PISSN: 02175959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0217595912500467     Document Type: Article

References (26)

1. Aldaihania, M and M Dessouky (2003). Hybrid scheduling methods for paratransit operations. Computers and Industrial Engineering, 45, 75-96.
2. Beaudry, A, G Laporte, T Melo and S Nickel (2009). Dynamic transportation of patients to hospitals. OR Spectrum, 32, 77-107.
3. Berbeglia, G, JF Cordeau, I Gribkovskaia and G Laporte (2007). Static pickup and delivery problems: A classification scheme and survey. Top, 15, 1-31.
4. Bornd?orfer, R, M Gr?otschel, F Klostermeier and C K?uttner (1997). Telebus Berlin: Vehicle scheduling in a dial-a-ride system. Computer-Aided Transit Scheduling. In Lecture Notes in Economics and Mathematical Systems, Vol. 471, pp. 391-422. Berlin: Springer-Verlag.
5. Br?aysy, O and M Gendreau (2005). Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, 39(1), 119-139. (Pubitemid 40453880)
6. Cordeau, JF and G Laporte (2003a). A Tabu search heuristic for the static multi-vehicle dial-a-ride problem. Transportation Research Part B, 37, 579-594. (Pubitemid 36586371)
7. Cordeau, JF and G Laporte (2003b). The Dial-a-Ride Problem (DARP): Variants, modeling issues and algorithms, 4OR, 1, 89-101.
8. Cordeau, JF and G Laporte (2007). The dial-a-ride problem: Models and algorithms. Annals of Operations Research, 153, 29-46.
9. Feo, TA and J Bard (1989). Flight scheduling and maintenance base planning. Management Science, 35(12), 1415-1432.
10. Feo, A and MGC Resende (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109-133.
11. Festa, P and MGC Resende (2009a). An annotated bibliography of GRASP-Part I: Algorithms. International Transactions in Operational Research, 16(1), 1-24.
12. Festa, P and MGC Resende (2009b). An annotated bibliography of GRASP-Part II: Applications. International Transactions in Operational Research, 16(2), 131-172.
13. Festa, P and MGC Resende (2009c). Hybrid GRASP heuristics. Foundations of Computational Intelligence Volume 3-Studies in Computational Intelligence, 203, 75-100.
14. Glover, F and M Laguna (1997). Tabu Search. Norwell, MA: Kluwer.
15. Hanne T, T Melo and S Nickel (2009). Bringing robustness to patient flow management through optimized patient transports in hospitals. Interfaces, 39(3), 241-255.
16. Kontoravdis, GA and JF Bard (1995). A GRASP for the vehicle routing problem with time windows. INFORMS Journal on Computing, 7, 10-23.
17. Melachrinoudis, E, AB Ilhan and H Min (2007). A dial-a-ride problem for client transportation in a healthcare organization. Computers and Operations Research, 34, 742-759. (Pubitemid 44404098)
18. Nanry, WP and JW Barnes (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research B, 34, 107-121. (Pubitemid 30135209)
19. Parragh, SN (2011). Introducing heterogeneous users and vehicles into models and algorithms for the dial-a-ride problem. Transportation Research Part C, 19(5), 912-930.
20. Parragh, SN, JF Cordeau, KF Doerner and RF Hartl (2012). Models and algorithms for the heterogeneous dial-a-ride problem with driver related constraints. OR Spectrum, 34(3), 593-633.
21. Prais, M and C Ribeiro (2000). Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12(3), 164-176.
22. Rekiek, B, A Delchambre and HA Salehb (2006). Handicapped person transportation: An application of the grouping genetic algorithm. Engineering Applications of Artificial Intelligence 19(5), 511-520. (Pubitemid 43795040)
23. Resende, MGC and CC Ribeiro (2003). Greedy randomized adaptive search procedures. In Handbook of Metaheuristics, F Glover and G Kochenberger (eds.), pp. 219-249.
24. Toth, P and D Vigo (1997). Heuristic algorithms for the handicapped persons transportation problem. Transportation Science, 31, 60-71. (Pubitemid 127623157)
25. Wong, KI and MGH Bell (2006). Solution of the dial-a-ride problem with multi-dimensional capacity constraints. International Transactions in Operational Research, 13, 195-208.
26. Xiang, Z, C Chu and H Chen (2006). A fast heuristic for solving a large-scale static dial-aride problem under complex constraints. European Journal of Operational Research, 174, 1117-1139. (Pubitemid 44093902)