A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
From MaRDI portal
Publication:4921475
DOI10.1142/S0217595912500467zbMath1262.90064OpenAlexW1976368027WikidataQ58921102 ScholiaQ58921102MaRDI QIDQ4921475
Maria Elena Bruni, Francesca Greco, Francesca Guerriero
Publication date: 10 May 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595912500467
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (3)
Event-based MILP models for ridepooling applications ⋮ Typology and literature review for dial-a-ride problems ⋮ A hybrid reactive GRASP heuristic for the risk-averse \(k\)-traveling repairman problem with profits
Cites Work
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Greedy randomized adaptive search procedures
- Dynamic transportation of patients in hospitals
- A dial-a-ride problem for client transportation in a health-care organization
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- A GRASP for the Vehicle Routing Problem with Time Windows
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
This page was built for publication: A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
