摘要
我国社会老龄化问题日益严重,家庭护理服务的出现有效缓解了社会与家庭的养老压力。为解决提供家庭护理服务护理中心选址问题,以路程成本和服务人员工资成本加权成本最小为目标,考虑底层的路径优化,设计了选址与路径优化的双层迭代算法。在上层选址决策阶段,采取了四种不同的启发式算法,辅以路径转移算法以及选址筛查策略以提高搜索效率;在底层路径优化阶段,基于禁忌搜索进行优化,允许违反工作时间约束以扩大搜索空间。最后进行了数值实验和敏感度分析,验证了算法的有效性。
With the accelerated aging pace of China,homecare services can relieve the pressure of provision for the aged for the society and families.To solve the location problem for homecare centers,this paper takes routing optimization into accounts and proposes a bi-level algorithm combining location and routing optimization.The objective is to minimize the weighted travel cost and staffs salary cost.In the upper level of location decision,four different heuristics are designed. The search efficiency is improved with the help of route transfer algorithm and location screening strategy.In the lower level of routing optimization,tabu search based meta-heuristics is proposed. Working time is allowed to be violated in order to expand the search space.Numerical experiments and sensitivity analysis are performed to evaluate the performance of the proposed algorithms.
出处
《工业工程与管理》
CSSCI
北大核心
2015年第6期130-136,共7页
Industrial Engineering and Management
基金
国家自然科学基金资助项目(61104173)
关键词
选址问题
禁忌搜索
路径优化
家庭护理
location problem
tabu search
routing optimization
homecare
