A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (Q4921475)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM |
scientific article; zbMATH DE number 6162070
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM |
scientific article; zbMATH DE number 6162070 |
Statements
A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM (English)
0 references
10 May 2013
0 references
dial-a-ride
0 references
metaheuristics
0 references
tabu search
0 references
greedy randomized adaptive search
0 references
0 references
0 references
0 references
