D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099)
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: D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. |
scientific article; zbMATH DE number 2055443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. |
scientific article; zbMATH DE number 2055443 |
Statements
D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (English)
0 references
14 March 2004
0 references
Meta-heuristics
0 references
Ant System
0 references
ACO
0 references
Decomposition
0 references
Vehicle Routing Problem
0 references
0 references
0 references
