دورية أكاديمية
A General Statistical Physics Framework for Assignment Problems
| العنوان: | A General Statistical Physics Framework for Assignment Problems |
|---|---|
| المؤلفون: | Patrice Koehl, Henri Orland |
| المصدر: | Algorithms, Vol 17, Iss 5, p 212 (2024) |
| بيانات النشر: | MDPI AG, 2024. |
| سنة النشر: | 2024 |
| المجموعة: | LCC:Industrial engineering. Management engineering LCC:Electronic computers. Computer science |
| مصطلحات موضوعية: | assignment problems, statistical physics, discrete optimization, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95 |
| الوصف: | Linear assignment problems hold a pivotal role in combinatorial optimization, offering a broad spectrum of applications within the field of data sciences. They consist of assigning “agents” to “tasks” in a way that leads to a minimum total cost associated with the assignment. The assignment is balanced when the number of agents equals the number of tasks, with a one-to-one correspondence between agents and tasks, and it is and unbalanced otherwise. Additional options and constraints may be imposed, such as allowing agents to perform multiple tasks or allowing tasks to be performed by multiple agents. In this paper, we propose a novel framework that can solve all these assignment problems employing methodologies derived from the field of statistical physics. We describe this formalism in detail and validate all its assertions. A major part of this framework is the definition of a concave effective free energy function that encapsulates the constraints of the assignment problem within a finite temperature context. We demonstrate that this free energy monotonically decreases as a function of a parameter β representing the inverse of temperature. As β increases, the free energy converges to the optimal assignment cost. Furthermore, we demonstrate that when β values are sufficiently large, the exact solution to the assignment problem can be derived by rounding off the elements of the computed assignment matrix to the nearest integer. We describe a computer implementation of our framework and illustrate its application to multi-task assignment problems for which the Hungarian algorithm is not applicable. |
| نوع الوثيقة: | article |
| وصف الملف: | electronic resource |
| اللغة: | English |
| تدمد: | 1999-4893 |
| Relation: | https://www.mdpi.com/1999-4893/17/5/212; https://doaj.org/toc/1999-4893 |
| DOI: | 10.3390/a17050212 |
| URL الوصول: | https://doaj.org/article/e0d3a37902224b718a95772651cfd296 |
| رقم الأكسشن: | edsdoj.0d3a37902224b718a95772651cfd296 |
| قاعدة البيانات: | Directory of Open Access Journals |
Full Text Finder | تدمد: | 19994893 |
|---|---|
| DOI: | 10.3390/a17050212 |