Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134)
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: Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects |
scientific article; zbMATH DE number 7461754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects |
scientific article; zbMATH DE number 7461754 |
Statements
Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (English)
0 references
21 January 2022
0 references
dial-a-ride problem
0 references
vehicle routing
0 references
dynamic DARP
0 references
general variable neighborhood search
0 references
0 references
0 references
0 references
0.7886652946472168
0 references
0.7757520079612732
0 references
0.7714895009994507
0 references
0.7616007328033447
0 references
