类调度算法，以显示与标准的最佳匹配？ [英] Class Scheduling algorithm to show best match with criteria?

问题描述

我期待建立一个系统，你可以输入你想利用在大学，然后选择preferences（清晨，白天，晚上，夜间/ M，T系列课程（3-7门课程）， W，TR，F）。

I am looking to create a system where you can input the courses (3-7 courses) that you want to take at a college and then select preferences (Morning, Day, Evening, Night / M, T, W, TR, F).

我需要一种方法，使得当程序查询数据库（MySQL的）它返回是根据这些参数所作的最好的可能的时间表。我写这封信是在PHP。

I need a way so that when the program queries the database (MySQL) it returns the best possible schedule that was made according to those parameters. I am writing it in php.

有没有人知道要做到这一点的最好方法是什么？或链接到一些示例code，我可以从理解？

Does any one know the best way to do this? Or a link to some sample code I could understand it from?

推荐答案

您可能会想尝试一些约束规划（CSP）库....在CSP你的状态的问题（通常是NP硬）和库解决它使用一些启发式（模拟退火，禁忌搜索）或一个详尽的DFS有一些技巧（弧相容，搜索空间剃毛）......这可以解决问题，全国人民代表大会与成千上万的变量...但它在某种程度上棘手的设置精参数黑箱系统...

You might want to try some constraint programming (CSP) library.... In CSP you state the problem (usually NP Hard) and the library solves it using some heuristics (simulated annealing, taboo search) or an exhaustive DFS with some tricks (arc consistency ,search space shaving)... It can solve NPC problems with thousands of variables...but its somehow tricky to set the "fine" parameters of the black-box system...

这篇关于类调度算法，以显示与标准的最佳匹配？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！