Details
| Original language | English |
|---|---|
| Title of host publication | GECCO '23 Companion |
| Subtitle of host publication | Proceedings of the Companion Conference on Genetic and Evolutionary Computation |
| Pages | 243-246 |
| Number of pages | 4 |
| ISBN (electronic) | 9798400701207 |
| 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 |
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.
Keywords
- agent learning, competition, unknown logistics problems
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Computer Science(all)
- Computational Theory and Mathematics
- Computer Science(all)
- Computer Science Applications
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary Computation. 2023. p. 243-246.
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Training agents for unknown logistics problems
AU - Schmid, Elisa
AU - Becker, Matthias
PY - 2023/7/24
Y1 - 2023/7/24
N2 - 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.
AB - 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.
KW - agent learning
KW - competition
KW - unknown logistics problems
UR - http://www.scopus.com/inward/record.url?scp=85169034992&partnerID=8YFLogxK
U2 - 10.1145/3583133.3590724
DO - 10.1145/3583133.3590724
M3 - Conference contribution
AN - SCOPUS:85169034992
SP - 243
EP - 246
BT - GECCO '23 Companion
T2 - 2023 Genetic and Evolutionary Computation Conference Companion
Y2 - 15 July 2023 through 19 July 2023
ER -