Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search (Q4836838)
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 766527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search |
scientific article; zbMATH DE number 766527 |
Statements
Solving a General Routing and Scheduling Problem by Chain Decomposition and Tabu Search (English)
0 references
23 November 1995
0 references
classical chain decomposition model
0 references
vehicle routing
0 references
time windows
0 references
0.8180471658706665
0 references
0.8068320751190186
0 references
0.8040993213653564
0 references
0.7993789911270142
0 references
