An Heuristic Method for Solving Time-Sensitive Routeing Problems (Q3315236)
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 3845307
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Heuristic Method for Solving Time-Sensitive Routeing Problems |
scientific article; zbMATH DE number 3845307 |
Statements
An Heuristic Method for Solving Time-Sensitive Routeing Problems (English)
0 references
1984
0 references
time-sensitive routeing problems
0 references
logistics
0 references
vehicle routeing heuristic
0 references
clustering
0 references
insertion penalties
0 references
vehicle scheduling
0 references
time density function
0 references
0.9401976
0 references
0.9293639
0 references
0.9248255
0 references
0.9102773
0 references
0.90435815
0 references
0.9035704
0 references
