D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Tabu search / rank | |||
Normal rank | |||
Revision as of 18:35, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. |
scientific article |
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
