Article ID: | iaor20051936 |
Country: | South Korea |
Volume: | 29 |
Issue: | 4 |
Start Page Number: | 117 |
End Page Number: | 134 |
Publication Date: | Dec 2004 |
Journal: | Journal of the Korean ORMS Society |
Authors: | Kim Jin-Hwa |
Keywords: | learning, combinatorial analysis, programming: travelling salesman |
This study suggests a data driven optimization approach, which simulates the models of human learning processes from cognitive sciences. It shows how the human learning processes can be simulated and applied to solving combinatorial optimization problems. The main advantage of using this method is in applying it into problems, which are very difficult to simulate. “Undecidable” problems are considered as best possible application areas for this suggested approach. The concept of an “undecidable” problem is redefined. The learning models in human learning and decision-making related to combinatorial optimization in cognitive and neural sciences are designed, simulated, and implemented to solve an optimization problem. We call this approach “SLO: simulated learning for optimization.” Two different versions of SLO have been designed: SLO with position and link matrix, and SLO with decomposition algorithm. The methods are tested for traveling salespersons problems to show how these approaches derive new solution empirically. The tests show that simulated learning for optimization produces new solutions with better performance empirically. It performance, compared to other hill-climbing type methods, is relatively good.