首页>
外国专利>
Method for Finding the Optimal Schedule and Route in Contrained Home Healthcare Visit Scheduling
Method for Finding the Optimal Schedule and Route in Contrained Home Healthcare Visit Scheduling
展开▼
机译:在受限家庭医疗保健访问计划中找到最佳计划和路线的方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
A method for finding the optimal schedule and route to visit all constrained and unconstrained nodes of a graph only once while respecting the associated time windows and system constraints. The constrained nodes are first grouped in clusters based on their time windows and system constraints. Then, unconstrained nodes are optimally assigned to the clusters by using a greedy heuristic. Subsequently, enumeration is used to solve the TDTSPTW by cluster. Once all clusters are solved, the paths are joined and a local search heuristic is used to improve the solution. The result of the method is an ordered set of nodes to be visited with their associated start times.
展开▼