Open AccessDevelopment of a Branch and Bound Algorithm for One Competitive Facility Location Problem with Elastic Demand
Author(s) -
Tatyana Levanova,
Alexander Gnusarev
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1791/1/012077
Subject(s) - mathematical optimization , branch and bound , facility location problem , computer science , integer programming , development (topology) , heuristic , greedy algorithm , order (exchange) , scheme (mathematics) , function (biology) , algorithm , nonlinear system , mathematics , mathematical analysis , finance , evolutionary biology , economics , biology , physics , quantum mechanics
We consider a variant of the Competitive Location Problem, in which it is necessary to choose not only location, but also the design of facilities in order to maximize the share of customer demand served. It is described as an integer programming model with a nonlinear objective function. Commercial software is not suitable for finding the optimal solution to this problem in a reasonable time. Previously, Aboolian R. et al. proposed an adapted weighted greedy heuristic for this problem. In our earlier study, we developed several variants of local search algorithm. This article is devoted to development of the branch-and-bound algorithm. The scheme of branching is described, the results of a computational experiment are presented, future development possibility is discussed.