Problem Solving by General Purpose Solvers
To solve problems abundant in real world applications, we have been proposing an approach of using general purpose solvers, since we cannot afford to develop special purpose algorithms for all individual problems. For this purpose, we have developed solvers for some standard problems such as CSP (constraint satisfaction problem), RCPSP (resource constrained project scheduling problem), GAP (generalized assignment problem) and VRP (vehicle routing problem),among others. These solvers have been successfully applied to many applications. In this talk, we report our recent experience of ITC2007 (International Timetabling Competition), in which we used our general purpose CSP solver to handle the presented benchmarks.
Combinatorial optimization constraint satisfaction local search metaheuristics timetabling ITC2007 competition
Toshihide Ibaraki
Department of Informatics Kwansei Gakuin University Sanda, Japan 669-1337
国际会议
The Seventh International Symposium(ISORA08)(第七届国际效力研究及其应用学术会议)
云南丽江
英文
10-17
2008-10-31（万方平台首次上网日期，不代表论文的发表时间）