迭代深化分支定界
Iterative Deepening Branch and Bound
摘要：
在树搜索问题中，最佳优先搜索算法占用空间太大。为了消除这些算法的这些缺点，IDA* 被开发，这是空间和时间成本效率。但是，IDA* 可以为实际值问题提供最佳解决方案，如Flow Shop调度，旅行推销员和0/1背包，因为它们的实际值成本估计。在此基础上进一步改进，提出了满足要求的迭代深化分支定界搜索算法。我们已经尝试使用这种算法的流水车间调度问题，并发现它是相当有效的。
英文摘要：
In tree search problem the best-first search algorithm needs too much of space . To remove such drawbacks of these algorithms the IDA* was developed which is both space and time cost efficient. But again IDA* can give an optimal solution for real valued problems like Flow shop scheduling, Travelling Salesman and 0/1 Knapsack due to their real valued cost estimates. Thus further modifications are done on it and the Iterative Deepening Branch and Bound Search Algorithms is developed which meets the requirements. We have tried using this algorithm for the Flow Shop Scheduling Problem and have found that it is quite effective.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
