On constructing a family of student delivery routes in minimal time (Q893919)
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: On constructing a family of student delivery routes in minimal time |
scientific article; zbMATH DE number 6512839
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On constructing a family of student delivery routes in minimal time |
scientific article; zbMATH DE number 6512839 |
Statements
On constructing a family of student delivery routes in minimal time (English)
0 references
23 November 2015
0 references
school bus routing
0 references
linear partially integer model
0 references
exact algorithm
0 references
simple heuristic algorithm
0 references
0.811036229133606
0 references
0.8032494783401489
0 references
0.7900277972221375
0 references
0.788853645324707
0 references
