This paper presents a heuristic algorithm to solve the time tabling problem, which is a parallel and no-go-back method and uses a improved Tabu eearch to get daily feasible timetable.
本文给出了一种解“时间表问题”的启发式算法，从整个时间表的生成过程来说，它是一种并行和无回溯的方法；
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
This algorithm employs probes to search feasible paths in parallel, and USES heuristic functions to randomly select a suitable next node.
算法采用探测包并行地搜索可行路径，并使用启发式函数随机选择下一跳节点。
应用推荐