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 the normal view instead:
scientific article; zbMATH DE number 6162070
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8439412713050842
0 references
0.84355628490448
0 references
0.8362663984298706
0 references
0.8185126185417175
0 references
0.8181054592132568
0 references
