| 基于多邻域的并行混合局部搜索算法与时间表问题 |
| |
| 引用本文： | 颜鹤,郁松年.基于多邻域的并行混合局部搜索算法与时间表问题[J].上海大学学报(英文版),2004,8(3):301-308. |
| |
| 作者姓名： | 颜鹤 郁松年 |
| |
| 作者单位： | SchoolofComputerEngineeringandScience,ShanghaiUniversity,Shanghai200072,P.R.China |
| |
| 基金项目： | ProjectsupportedbytheScienceFoundationofShanghaiMunic ipalCommissionofScienceandTechnology (GrantNo .0 0JC14 0 5 2 )andtheScienceFoundationofShanghaiMunicipalCommissionofEducation |
| |
| 摘 要： | This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms.
|
| 关 键 词： | 多邻域并行算法 合成局部搜索算法 时间表 模拟退火算法 |
| 收稿时间： | 3 June 2003 |
A multiple-neighborhood-based parallel composite local search algorithm for timetable problem |
| |
| Yan?He,Yu?Song-nian?D..A multiple-neighborhood-based parallel composite local search algorithm for timetable problem[J].Journal of Shanghai University(English Edition),2004,8(3):301-308. |
| |
| Authors: | Yan He Yu Song-nian D |
| |
| Institution: | School of Computer Engineering and Science, Shanghai University, Shanghai 200072, P. R. China |
| |
| Abstract: | This paper presents a parallel composite local search algorithm based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm can also effectively solve those problems that can be solved by general local search algorithms. Experimental results show that the new algorithm can generate better solutions than general local search algorithms. |
| |
| Keywords: | multiple neighborhoods parallel composite local search algorithm timetable problem |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
