Authors:
Nobuo Inui
;
Yuji Shinano
;
Yuusuke Kounoike
and
Yoshiyuki Kotani
Affiliation:
Tokyo University of Agriculture and Technology, Japan
Keyword(s):
The Longest Distance Problem, Word–Chain Game, Integer Programming, Heuristic Search, Linear
Programming, Branch-and-Bound Method, Optimal Solution, Local-Maximum Solution.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence and Decision Support Systems
;
Enterprise Information Systems
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Knowledge-Based Systems Applications
;
Optimization Algorithms
Abstract:
The SHIRITORI game is a traditional Japanese word-chain game. This paper describes the definition of the longest SHIRITORI problem (a kind of the longest distance problem) as a problem of graph and the solution based on the integer problem (IP). This formulation requires the exponential order variables from the problem size. Against this issue, we propose a solution based on the LP-based branch-and-bound method, which solves the relaxation problems repeatedly. This method is able to calculate the longest SHIRITORI sequences for 130 thousand words dictionary within a second. In this paper, we compare the performances for the heuristic-local search and investigate the results for several conditions to explore the longest SHIRITORI problem.