Abstract
A methodology on how to prepare agents to succeed on a priori unknown logistics problems is presented. The training of the agents is and can only be executed using a small number of test problems that are taken out of a broad class of generalized logistics problems. The developed agents are then evaluated on unknown instances of the problem class. This work has been developed in the context of last year’s AbstractSwarm Multi-Agent Logistics Competition. The most successful algorithms are presented, and additionally, all participating algorithms are discussed with respect to the features of the algorithms that contribute to their success. As a result, we conclude that such a broad variety of a priori unknown logistics problems can be solved efficiently if multiple different good working approaches are used, instead of trying to find one optimal algorithm. For the used test problems this method can undercut, trivial as well as non-trivial implementations, for example, algorithms based on machine learning.
| Original language | English |
|---|---|
| Title of host publication | GECCO '23 Companion |
| Subtitle of host publication | Proceedings of the Companion Conference on Genetic and Evolutionary Computation |
| Publisher | Association for Computing Machinery, Inc |
| Pages | 243-246 |
| Number of pages | 4 |
| ISBN (Electronic) | 9798400701207 |
| DOIs | |
| Publication status | Published - 24 Jul 2023 |
| Event | 2023 Genetic and Evolutionary Computation Conference Companion: GECCO 2023 - Lisbon, Portugal Duration: 15 Jul 2023 → 19 Jul 2023 |
Conference
| Conference | 2023 Genetic and Evolutionary Computation Conference Companion |
|---|---|
| Country/Territory | Portugal |
| City | Lisbon |
| Period | 15 Jul 2023 → 19 Jul 2023 |
Keywords
- agent learning
- competition
- unknown logistics problems
ASJC Scopus subject areas
- Software
- Computational Theory and Mathematics
- Computer Science Applications
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver