D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(03)00014-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2029970827 / rank | |||
Normal rank | |||
Latest revision as of 10:39, 30 July 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
0 references
0 references
