1998 Fiscal Year Final Research Report Summary
Studies on combinatorial algorithms as problem solving engine
| Project/Area Number |
08405030
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (A)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
System engineering
|
|---|
| Research Institution | KYOTO UNIVERSITY |
|---|
Principal Investigator |
IBARAKI Toshihide Kyoto Univ.Graduate School of Informatics, Professor, 情報学研究科, 教授 (50026192)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MAKINO Kazuhisa Osaka Univ.Grad.School of Engineering Science, Assis.Prof., 基礎工学研究科, 助手 (60294162)
YAGIURA Mutsunori Kyoto Univ.Graduate School of Informatics, Assis.Prof., 情報学研究科, 助手 (10263120)
NAGAMOCHI Hiroshi Kyoto Univ.Graduate School of Informatics, Assoc.Prof., 情報学研究科, 助教授 (70202231)
FUKUSHIMA Masao Kyoto Univ.Graduate School of Informatics, Professor, 情報学研究科, 教授 (30089114)
|
|---|
| Project Period (FY) |
1996 – 1998
|
| Keywords | problem solving engine / metaheuristics / CSP (constraint satisfaction problem) / combinatorial optimization |
|---|
| Research Abstract |
The main purpose of this research is to develop general purpose problem solvers for various combinatorial optimization problems. Such solvers may be made possible by resorting to metaheuristic algorithms, which are recently receiving intensive attention. Based on the theoretical and experimental studies on the basic properties of metaheuristic approaches, we implemented several algorithms and conducted extensive numerical experiments on various benchmark problems as well as some problems arising from practical applications.
As platforms for the general purpose problem solvers, we employed CSP (constraint satisfaction problem), GAP (generalized assignment problem), MAX-SAT (maximum satisfiability problem) and RCPSP (resource constrained project scheduling problem). These problems are quite general and can formulate many important problems which we frequently encounter in practice. Judging from our computational experiments, the metaheuristic codes we developed appear to be very useful in a wide variety of applications.
Also included in this research are studies of structured problems, such as graph and network structures, scheduling problems, and nonlinear optimization structures.
|
