GA based optimization of heuristic search

GA based optimization of heuristic search

0.00 Avg rating0 Votes
Article ID: iaor19971469
Country: Japan
Volume: 37
Issue: 10
Start Page Number: 1811
End Page Number: 1820
Publication Date: Oct 1996
Journal: Transactions of the Information Processing Society of Japan
Authors: ,
Keywords: combinatorial analysis, heuristics, optimization, scheduling, vehicle routing & scheduling
Abstract:

The authors present a generic method adding GA (Genetic Algorithm) to a given heuristic search algorithm. In the method, GA is used to optimize the priority of branches in the search tree. Heuristic search algorithms are easy to develop and have been widely used to solve actual problems, which have been conventionally solved manually, but for practical applications, they have to add more detailed knowledge. The proposed method does not require so much knowledge due to using GA. The authors apply the method to bus driver scheduling systems, which can generate enough practical schedules. The systems are sold to bus corporations, and now working. [In Japanese.]

Reviews

Required fields are marked *. Your email address will not be published.