Enhancing Constraint Optimization Problems with Greedy Search and Clustering: A Focus on the Traveling Salesman Problem

Sven Löffler, Ilja Becker, Petra Hofstedt

2024

Abstract

Constraint optimization problems offer a means to obtain at a global solution for a given problem. At the same time the promise of finding a global solution, often this comes at the cost of significant time and computational resources. Greedy search and cluster identification methods represent two alternative approaches, which can lead fast to local optima. In this paper, we explore the advantages of incorporating greedy search and clustering techniques into constraint optimization methods without forsaking the pursuit of a global solution. The global search process is designed to consider clusters and initially behave akin to a greedy search. This dual strategy aims to achieve two key objectives: firstly, it accelerates the attainment of an initial solution, and secondly, it ensures that this solution possesses a high level of optimality. This guarantee is generally elusive for constraint optimization problems, where solvers may struggle to find a solution, or find one of adequate quality in acaptable time. Our approach is an improvement of the general Bunch-and-Bound approach in constraint programming. Finally, we validate our findings using the Traveling Salesman Problem as a case study.

Paper Citation

in Harvard Style

Löffler S., Becker I. and Hofstedt P. (2024). Enhancing Constraint Optimization Problems with Greedy Search and Clustering: A Focus on the Traveling Salesman Problem. In Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART; ISBN 978-989-758-680-4, SciTePress, pages 1170-1178. DOI: 10.5220/0012453000003636

in Bibtex Style

@conference{icaart24,
author={Sven Löffler and Ilja Becker and Petra Hofstedt},
title={Enhancing Constraint Optimization Problems with Greedy Search and Clustering: A Focus on the Traveling Salesman Problem},
booktitle={Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART},
year={2024},
pages={1170-1178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0012453000003636},
isbn={978-989-758-680-4},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Conference on Agents and Artificial Intelligence - Volume 3: ICAART
TI - Enhancing Constraint Optimization Problems with Greedy Search and Clustering: A Focus on the Traveling Salesman Problem
SN - 978-989-758-680-4
AU - Löffler S.
AU - Becker I.
AU - Hofstedt P.
PY - 2024
SP - 1170
EP - 1178
DO - 10.5220/0012453000003636
PB - SciTePress