Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/139313
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem |
Author: | Bossek, J. Neumann, A. Neumann, F. |
Citation: | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '23), 2023 / Paquete, L. (ed./s), vol.abs/2305.18955, pp.248-256 |
Publisher: | Association for Computing Machinery |
Publisher Place: | New York, NY |
Issue Date: | 2023 |
ISBN: | 9798400701191 |
Conference Name: | Genetic and Evolutionary Computation Conference (GECCO) (15 Jul 2023 - 15 Jul 2023 : Lisbon, Portugal) |
Editor: | Paquete, L. |
Statement of Responsibility: | Jakob Bossek, Aneta Neumann, Frank Neumann |
Abstract: | Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour of evolutionary algorithms for complex optimization problems that also involve dynamic and/or stochastic components in a systematic way in order to further increase their applicability to real-world problems. We investigate the node weighted traveling salesperson problem (W-TSP), which provides an abstraction of a wide range of weighted TSP problems, in dynamic settings. In the dynamic setting of the problem, items that have to be collected as part of a TSP tour change over time. We first present a dynamic setup for the dynamic W-TSP parameterized by different types of changes that are applied to the set of items to be collected when traversing the tour. Our first experimental investigations study the impact of such changes on resulting optimized tours in order to provide structural insights of optimization solutions. Afterwards, we investigate simple mutation-based evolutionary algorithms and study the impact of the mutation operators and the use of populations with dealing with the dynamic changes to the node weights of the problem. |
Keywords: | Evolutionary algorithms; re-optimization; dynamic optimization; weighted traveling salesperson problem |
Rights: | © 2023 by the Association for Computing Machinery, Inc. (ACM). |
DOI: | 10.1145/3583131.3590384 |
Grant ID: | http://purl.org/au-research/grants/arc/FT200100536 |
Published version: | https://dl.acm.org/doi/proceedings/10.1145/3583131 |
Appears in Collections: | Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.