TY - GEN A1 - Becker, Ilja A1 - Löffler, Sven A1 - Hofstedt, Petra ED - Machado, Jose Manuel F. ED - Chamoso, Pablo ED - Hernandez, Guillermo ED - Bocewicz, Grzegorz ED - Loukanova, Roussanka ED - Jove, Esteban ED - del Rey, Angel Martin ED - Ricca, Michela T1 - ML-based Automation of Constraint Satisfaction Model Transformation and Solver Configuration T2 - Distributed Computing and Artificial Intelligence, Special Sessions - DCAI 2022, 19th International Conference KW - Constraint Programming KW - Machine Learning Y1 - 2022 SN - 978-3-031-23209-1 SN - 978-3-031-23210-7 SP - 177 EP - 183 PB - Springer CY - Cham ER - TY - GEN A1 - Löffler, Sven A1 - Becker, Ilja A1 - Hofstedt, Petra ED - Strauss, Christine ED - Amagasa, Toshiyuki ED - Kotsis, Gabriele ED - Tjoa, A Min ED - Khalil, Ismail T1 - A Finite-Domain Constraint-Based Approach on the Stockyard Planning Problem T2 - Database and Expert Systems Applications : 34th International Conference, DEXA 2023, Penang, Malaysia, August 28–30, 2023, Proceedings, Part II Y1 - 2023 SN - 978-3-031-39820-9 SN - 978-3-031-39821-6 SP - 126 EP - 133 PB - Springer CY - Cham ER - TY - GEN A1 - Bels, Maximilian A1 - Löffler, Sven A1 - Becker, Ilja A1 - Hofstedt, Petra ED - Rocha, Ana Paula ED - Steels, Luc ED - van den Herik, H. Jaap T1 - Constraint-Based Filtering and Evaluation of CSP Search Trees T2 - Proceedings of the 15th International Conference on Agents and Artificial Intelligence - ICAART 2023, Volume 3 KW - Constraint Programming KW - Artificial Intelligence Y1 - 2023 SN - 978-989-758-623-1 U6 - https://doi.org/10.5220/0011641100003393 SP - 220 EP - 227 PB - Scitepress ER - TY - GEN A1 - Löffler, Sven A1 - Becker, Ilja A1 - Bückert, Carlo A1 - Hofstedt, Petra ED - Gini, Giuseppina ED - Nijmeijer, Henk ED - Filev, Dimitar T1 - Enhanced Optimal Beacon Placement for Indoor Positioning: A Set Variable Based Constraint Programming Approach T2 - Proceedings of the 20th International Conference on Informatics in Control, Automation and Robotics : November 13-15, 2023, in Rome, Italy, volume 1 KW - Beacon Placement KW - Constraint Programming KW - Decision Support Systems KW - Artificial Intelligence Y1 - 2023 SN - 978-989-758-670-5 U6 - https://doi.org/10.5220/0012203400003543 SP - 70 EP - 79 PB - Scitepress ER - TY - GEN A1 - Löffler, Sven A1 - Becker, Ilja A1 - Hofstedt, Petra A1 - Nitze, Andre A1 - Hennig, Silvia A1 - Klinge, Alexander ED - Klein, Maike ED - Krupka, Daniel ED - Winter, Cornelia ED - Wohlgemuth, Volker T1 - Planung des Ländlichen On-Demand-Verkehr - Probleme, Analyse und Algorithmen T2 - Informatik 2023 : Designing Futures - Zukünfte gestalten : 26.-29. September 2023, Berlin Y1 - 2023 SN - 978-3-88579-731-9 U6 - https://doi.org/10.18420/inf2023_177 SP - 1739 EP - 1750 PB - Gesellschaft für Informatik e.V. CY - Berlin ER - TY - GEN A1 - Pißarek, Adele A1 - Hofstedt, Petra A1 - Löffler, Sven ED - Dassisti, Michele ED - Madani, Kurosh ED - Panetto, Herve T1 - Stockyard Planning and Optimization Using Intelligent Search T2 - Innovative Intelligent Industrial Production and Logistics Y1 - 2025 SN - 978-3-031-80775-6 U6 - https://doi.org/10.1007/978-3-031-80775-6_7 SN - 1865-0937 VL - 2 SP - 94 EP - 110 PB - Springer Nature Switzerland CY - Cham ER - TY - CHAP A1 - Löffler, Sven A1 - Hofstedt, Petra ED - Nicosia, Guiseppe ED - Ojha, Varun ED - Giesselbach, Sven ED - Pardalos, M. Panos ED - Umeton, Renato T1 - A constraint-based savings algorithm for the Traveling Salesman Problem T2 - Machine Learning, Optimization and Data Science : 10th International Conference, LOD 2024, Castiglione Della Pescaia, Italy, September 22-25, 2024, Revised Selected Papers N2 - There exists a plethora of NP-hard problems for which obtaining an exact solution is computationally intensive while an approximate solution can be rapidly computed. The Traveling Salesman Problem (TSP) stands out as a prominent example within this problem class, being equally significant in both research and industry sectors. Exact methods for solving the TSP are typically infeasible within acceptable timeframes beyond a certain instance size. Due to the NP-hardness of the problem, computational time requirements would quickly escalate to weeks, months, years, or even millennia. In contrast, heuristic approaches often yield sufficiently good solutions rapidly, typically within seconds or minutes. However, the drawback lies in their tendency to produce only locally optimal solutions, which may deviate significantly from a global optimum. Nevertheless, heuristic methods remain preferred in industry due to their ability to find satisfactory solutions within reasonable timeframes. It is worth noting that even marginal improvements in solutions can translate into significant cost savings in practice. Hence, there is a demand for methods capable of swiftly providing high-quality solutions while also continuously searching for further, better solutions over time. This work aims to combine two approaches: heuristic search (utilizing two simple greedy algorithms and the savings algorithm developed by Clarke and Wright) and exact search (constraint programming), to solve TSPs. Using various TSP instances, we demonstrate that our approach yields a better solution than purely local methods in at least 80% of the cases. Furthermore, within the given time limit of 5 min, the new approach identifies a solution that is more than twice as good compared to traditional COP methods. KW - Constraints KW - Optimization KW - Traveling Salesman Problem Y1 - 2025 SN - 9783031824838 U6 - https://doi.org/10.1007/978-3-031-82484-5_15 SN - 0302-9743 VL - 2 SP - 203 EP - 217 PB - Springer Nature Switzerland CY - Cham ER - TY - CHAP A1 - Löffler, Sven A1 - Hofstedt, Petra ED - Rocha, Ana Paula ED - Steels, Luc ED - van den Herik, H. Jaap T1 - Greedy and local search-based constraint optimization of the travelling salesman problem T2 - Agents and Artificial Intelligence : 16th International Conference, ICAART 2024 Rome, Italy, February 24–26, 2024 : revised selected papers, Part II N2 - Constraint optimization problems offer a way to obtain a global solution for a given problem. However, the promise of finding a global solution often comes at the cost of significant time and computational resources. Greedy search, local search, and cluster identification methods represent alternative approaches, which can quickly lead to local optima. In our previous work presented at the 16th International Conference on Agents and Artificial Intelligence (ICAART) 2024 [19], we introduced new methods to combine constraint programming with greedy search and clustering methods in the context of the traveling salesman problem. In this paper, we explore the advantages of incorporating greedy search and local search, which can be seen as a clustering technique in this case, into constraint optimization methods without forsaking the pursuit of a global solution. The global search process is initially designed to behave similarly to a greedy search or local search. Compared to [19], we now considered more diverse greedy and iterated local search techniques as a new clustering method. Our approach aims to achieve two key objectives: first, to accelerate the process of finding of an initial solution, and second, to ensure that this solution possesses a high level of optimality. Our approach is an enhancement of the general branch-and-bound method in constraint programming. Finally, we validate our results using the traveling salesman problem as a case study. KW - Constraint Optimization KW - Informed and local search KW - Travelling Salesman Problem KW - TSP Y1 - 2025 SN - 9783031873294 U6 - https://doi.org/10.1007/978-3-031-87330-0_11 SN - 0302-9743 SP - 212 EP - 233 PB - Springer Nature Switzerland CY - Cham ER - TY - CHAP A1 - Assaf, George A1 - Löffler, Sven A1 - Hofstedt, Petra ED - Tack, Guido T1 - Optimized scheduling of medical appointment sequences using constraint programming T2 - Integration of constraint programming, artificial intelligence, and operations research : 22nd International Conference, CPAIOR 2025 Melbourne, VIC, Australia, November 10–13, 2025 : proceedings, Part I N2 - We propose a novel constraint-based model to efficiently tackle the medical appointment sequence scheduling problem (MASSP), inspired by a real-world problem at Charité – Universitätsmedizin Berlin. In many practical medical scenarios, scheduling a sequence of appointments, rather than a single appointment, has become increasingly essential for patients undergoing multi-stage treatments. The goal of the MASSP is to identify a set of medical resources with sufficient, consecutive, and available time slots in their calendars to create a sequence of appointments for effectively managing a treatment plan. The problem comprises various constraints, including the availability of both the intended patient and required medical resources, as well as the time and resource dependencies among the individual appointments that constitute the sequence. To address this, we formulate the problem as a constraint optimization problem () that not only captures the basic constraints of the MASSP but also optimizes resource assignment to ensure a fair workload distribution within the medical facility. The results of our experiments demonstrate that the model performs effectively under diverse conditions, which confirms the utility and robustness of the proposed model in optimizing resource allocation and ensuring equitable workload distribution. KW - Constraint Programming KW - Optimization KW - Medical Appointment Scheduling Y1 - 2025 SN - 978-3-031-95973-8 U6 - https://doi.org/10.1007/978-3-031-95973-8_1 SN - 0302-9743 SP - 1 EP - 16 PB - Springer Nature Switzerland CY - Cham ER - TY - GEN A1 - Löffler, Sven A1 - Abbenhaus, Viktoria A1 - Assaf, George A1 - Hofstedt, Petra ED - Gini, Giuseppina ED - Precup, Radu-Emil ED - Filev, Dimitar P. T1 - Solving the three-dimensional beacon placement problem using constraint-based methods, large neighborhood search, and evolutionary algorithms T2 - Proceedings of the 22nd International Conference on Informatics in Control, Automation and Robotics : Volume 1 : ICINCO N2 - With the increasing prevalence of large building complexes, indoor localization is becoming an area of growing significance. In critical situations, such as emergencies in factories or care facilities, the ability to locate a person quickly can be a matter of life and death. One possibility for localization are Bluetooth beacons, which are either attached to the person or in rooms. We pursue the latter approach, whereby the beacon signals are used to determine the position of a receiving device, e.g. a mobile phone. At this, the use of a sufficient number of beacons in the building must be ensured in order to guarantee adequate coverage. However, to minimize costs, it is equally important to avoid placing unnecessary beacons. This creates a challenging optimization problem that this paper addresses through three distinct approaches: constraint programming, large neighborhood search, and evolutionary algorithms. Using simulated three-dimensional buildings, we test and evaluate these m ethods, ultimately providing a practical and efficient approach applicable to real-world building environments. KW - Constraint Programming KW - AI Algorithms KW - Beacon Placement Y1 - 2025 SN - 978-989-758-770-2 U6 - https://doi.org/10.5220/0013724500003982 SP - 105 EP - 116 PB - SciTePress - Science and Technology Publications CY - Setúbal, Portugal ER -