| 约束满足与邻域搜索结合的混合算法及应用 |
| |
| 引用本文： | 李俊芳. 约束满足与邻域搜索结合的混合算法及应用[J]. 中国会计电算化, 2009, 0(21): 56-58 |
| |
| 作者姓名： | 李俊芳 |
| |
| 作者单位： | 北京科技大学经济管理学院,中国北京100083 |
| |
| 摘 要： | 总结约束满足求解技术和邻域搜索算法，分析约束满足与邻域搜索单一算法的优劣，以及两者结合的优势，提出约束满足与邻域搜索相结合的混合算法的一般框架，并以Job Shop调度优化问题为例对该算法框架进行实例说明。
|
| 关 键 词： | 约束满足 邻域搜索 混合算法 |
Hybrid Constraint Satisfaction and Neighborhood Search Algorithm and its Application |
| |
| LI Jun-fang. Hybrid Constraint Satisfaction and Neighborhood Search Algorithm and its Application[J]. , 2009, 0(21): 56-58 |
| |
| Authors: | LI Jun-fang |
| |
| Affiliation: | LI Jun-fang (School of Economics and Management, University of Science and Technology Beijing. Beijing 100083,China) |
| |
| Abstract: | Constraint satisfaction solving techniques and neighborhood search algorithm are generalized. Advantages and disadvantages of the constraint satisfaction and neighborhood search and the benefits of the combination of them each other are analyzed. A general framework of the hybrid algorithm which combines constraint satisfaction and neighborhood search is proposed. Furthermore, provides the solving process of the hybrid algorithm combining constraint satisfaction and neighborhood search for lob shop scheduling optimal problems. |
| |
| Keywords: | Constraint Satisfaction Neighborhood Search Hybrid Algorithm |
| 本文献已被 维普 等数据库收录！ |
