We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
有约束竞争选址问题的降阶回溯算法.
- Authors
傅汤毅; 宁爱兵; 孙智勇; 林道晗; 张惠珍
- Abstract
The constrained competitive location problem is a classic NP-hard problem in combinatorial optimization. When the existing algorithms study this problem, the optimal solution cannot be obtained or the solution speed is slow. Aiming at the shortcomings of the existing algorithms, this paper modified this classic problem and constructed a new mathematical model. Then it studied the mathematical properties of the model, and proposed upper and lower bound algorithms and lower bound algorithms on the basis of mathematical properties. The order sub-algorithm reduced the order of the problem and achieved the purpose of reducing the search solution space of the problem. There were both single order reduction and batch reduction in the order reduction process. Then it designed a backtracking sub-algorithm on the basis of the previous one to solve the optimal solution of the problem. Finally, the principle of the algorithm was explained more clearly through the analysis of two examples, and the result proves that the algorithm can find the optimal solution faster.
- Subjects
ALGORITHMS; NP-hard problems; COMBINATORIAL optimization; MATHEMATICAL models; ORDER picking systems
- Publication
Application Research of Computers / Jisuanji Yingyong Yanjiu, 2021, Vol 38, Issue 12, p3678
- ISSN
1001-3695
- Publication type
Article
- DOI
10.19734/j.issn.1001-3695.2021.04.0140