论文标题
家庭保健问题的偏见随机遗传算法
A biased random-key genetic algorithm for the home health care problem
论文作者
论文摘要
家庭医疗保健问题包括卫生专业人员对家庭患者的安排访问，同时遵循一系列要求。本文研究了家庭医疗保健路由和调度问题，该问题包括带有软窗口的多属性车辆路由问题。其他途径相互依存的约束适用于要求多次访问的患者，无论是同时访问还是优先访问。我们应用数学编程求解器来获得问题的下限。我们还提出了一种有偏见的随机遗传算法，并研究了该遗传算法最近在文献中提出的其他最先进的成分的影响。我们使用公开可用的基准数据集执行计算实验。关于以前的基于本地搜索的方法，我们发现结果比文献的结果高26.1％。与类似的遗传算法的先前结果相比，我们发现从0.4％到6.36％的改善。
Home health care problems consist of scheduling visits to home patients by health professionals while following a series of requirements. This paper studies the Home Health Care Routing and Scheduling Problem, which comprises a multi-attribute vehicle routing problem with soft time windows. Additional route inter-dependency constraints apply for patients requesting multiple visits, either by simultaneous visits or visits with precedence. We apply a mathematical programming solver to obtain lower bounds for the problem. We also propose a biased random-key genetic algorithm, and we study the effects of additional state-of-art components recently proposed in the literature for this genetic algorithm. We perform computational experiment using a publicly available benchmark dataset. Regarding the previous local search-based methods, we find results up to 26.1% better than those of the literature. We find improvements from around 0.4% to 6.36% compared to previous results from a similar genetic algorithm.
