CAJ | 학술논문

设施选址问题在生活、物流、军事中有着非常广泛的应用。主要考虑设施有约束限制以及设施间存在相互运输的情形，提出一个约束多设施选址模型。目标是在平面上的约束区域内选择多个设施，使得这些设施到各个需求点以及各个设施间的距离和最小。提出了基于变分不等式方法的交替选址分配启发式算法解决此模型：在分配步，采用最近中心再分配算法将顾客分配给设施；在选址步，先将子问题转化为等价的变分不等式问题，再用投影收缩方法求解相应的变分不等式问题。分析了问题及算法的一些性质，并给出了数值试验，证明了算法的有效性。
설시선지문제재생활、물류、군사중유착비상엄범적응용。주요고필설시유약속한제이급설시간존재상호운수적정형，제출일개약속다설시선지모형。목표시재평면상적약속구역내선택다개설시，사득저사설시도각개수구점이급각개설시간적거리화최소。제출료기우변분불등식방법적교체선지분배계발식산법해결차모형：재분배보，채용최근중심재분배산법장고객분배급설시；재선지보，선장자문제전화위등개적변분불등식문제，재용투영수축방법구해상응적변분불등식문제。분석료문제급산법적일사성질，병급출료수치시험，증명료산법적유효성。
Facility location problems have practical applications in various fields such as life,supply chain manage-ment,and military.In this paper,a constrained multi-source model is built,considering the locational constraints on facilities and the transportation costs between facilities.The objective is to locate new facilities in some constrain-ed areas such that the sum of the distances between facilities and customers and the distance between these facilities is minimized.Based on variational inequality,an alternative location-allocation heuristic algorithm is proposed to solve this constrained location model.In the allocation phase,all customers are allocated to facilities by the nearest center reclassification algorithm,and in the location phase,the subproblem is transformed into an equivalent linear variational inequality(LVI)problem.Then a projection-contraction method is adopted to solve this LVI problem. Several properties about the proposed model and algorithm are analyzed,and some preliminary numerical results are reported which verifies the effectiveness of this algorithm.