A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (Q1908288)
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 847651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives |
scientific article; zbMATH DE number 847651 |
Statements
A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives (English)
0 references
26 February 1996
0 references
dynamic routing
0 references
static dial-a-ride routing
0 references
scheduling
0 references
time windows
0 references
0 references
0 references
0 references
0.8486972451210022
0 references
0.8348021507263184
0 references
0.8219367265701294
0 references
0.8210487365722656
0 references
0.8174409866333008
0 references
