Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342)
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: Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem |
scientific article; zbMATH DE number 7593200
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem |
scientific article; zbMATH DE number 7593200 |
Statements
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (English)
0 references
27 September 2022
0 references
routing
0 references
time-dependent travel time
0 references
dial-a-ride problem
0 references
meta-heuristics
0 references
mixed integer programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.93681574
0 references
0.91180515
0 references
0.9028039
0 references
0.9010924
0 references
0.8880349
0 references
0.88737077
0 references
0 references
0.88200384
0 references
