The choice of algorithms for solving a multi-agent routing problem based on solving related problems (Q6646145)
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: The choice of algorithms for solving a multi-agent routing problem based on solving related problems |
scientific article; zbMATH DE number 7951798
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The choice of algorithms for solving a multi-agent routing problem based on solving related problems |
scientific article; zbMATH DE number 7951798 |
Statements
The choice of algorithms for solving a multi-agent routing problem based on solving related problems (English)
0 references
29 November 2024
0 references
multi-agent traveling salesman problem
0 references
time windows
0 references
metaheuristics
0 references
applied routing problem
0 references