Improvements for mlrose applied to the Traveling Salesperson Problem
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2021
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909169983946752 |
|---|---|
| author | Wintersteller, Stefan Uray, Martin Lehenauer, Michael Huber, Stefan |
| author_facet | Wintersteller, Stefan Uray, Martin Lehenauer, Michael Huber, Stefan |
| contents | In this paper we discuss the application of Artificial Intelligence (AI) to the exemplary industrial use case of the two-dimensional commissioning problem in a high-bay storage, which essentially can be phrased as an instance of Traveling Salesperson Problem (TSP). We investigate the mlrose library that provides an TSP optimizer based on various heuristic optimization techniques. Our focus is on two methods, namely Genetic Algorithm (GA) and Hill Climbing (HC), which are provided by mlrose. We present improvements for both methods that yield shorter tour lengths, by moderately exploiting the problem structure of TSP. That is, the proposed improvements have a generic character and are not limited to TSP only. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2109_14392 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Improvements for mlrose applied to the Traveling Salesperson Problem Wintersteller, Stefan Uray, Martin Lehenauer, Michael Huber, Stefan Neural and Evolutionary Computing In this paper we discuss the application of Artificial Intelligence (AI) to the exemplary industrial use case of the two-dimensional commissioning problem in a high-bay storage, which essentially can be phrased as an instance of Traveling Salesperson Problem (TSP). We investigate the mlrose library that provides an TSP optimizer based on various heuristic optimization techniques. Our focus is on two methods, namely Genetic Algorithm (GA) and Hill Climbing (HC), which are provided by mlrose. We present improvements for both methods that yield shorter tour lengths, by moderately exploiting the problem structure of TSP. That is, the proposed improvements have a generic character and are not limited to TSP only. |
| title | Improvements for mlrose applied to the Traveling Salesperson Problem |
| topic | Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2109.14392 |