| Title |
Global optimization algorithm for the multi-Weber problem with polyhedral barriers |
| Authors |
Kepalas, Mindaugas ; Žilinskas, Julius |
| DOI |
10.15388/25-INFOR610 |
| Full Text |
|
| Is Part of |
Informatica.. Vilnius : Vilniaus universiteto leidykla. 2025, vol. 36, no. 4, p. 875-902.. ISSN 0868-4952. eISSN 1822-8844 |
| Keywords [eng] |
multi-Weber problem with barriers ; clustering problems with centre location constraints ; global optimization |
| Abstract [eng] |
In this paper, we consider the multi-Weber problem with polyhedral barriers. For this problem, a set of obstacles are introduced where travelling or placement is prohibited, which makes the distance metric non-convex and requires constructing a special graph for calculating the distances between pairs of points. For obtaining the global solution of the problem, we build a branch and bound algorithm with pruning criteria based on dividing clients into groups and analysing them separately. We have managed to obtain global solutions to several multi-Weber with polyhedral barriers problem size instances which to our knowledge have not been reported before. |
| Published |
Vilnius : Vilniaus universiteto leidykla |
| Type |
Journal article |
| Language |
English |
| Publication date |
2025 |
| CC license |
|
