论文信息 - Different Local Search Algorithms in STAGE for Solving Bin Packing Problem

Different Local Search Algorithms in STAGE for Solving Bin Packing Problem

Previous researches have shown the success of using Reinforcement Learning in solving combinatorial optimization problems. The main idea of these methods is to learn (near) optimal evaluation functions to improve local searches and find (near) optimal solutions. STAGE algorithm, introduced by Boyan & Moore, is one of the most important algorithms in this area. In this paper, we focus on Bin-Packing problem, an important NP-Complete problem. We analyze cost surface structure of this problem and investigate "big valley" structure for the set of its local minima. The result gives reasons for STAGE's success in solving this problem. Then by comparing the results of experiments on Bin-Packing problem, we analyze the effectiveness of steepest-descent hill climbing, stochastic hill climbing and first-improvement hill climbing as the local search algorithms in STAGE.

Gholamreza Haffari | Saeed Bagheri Shouraki | Gholamreza Haffari | S. Shouraki

[1] Wei Zhang,et al. A Reinforcement Learning Approach to job-shop Scheduling , 1995, IJCAI.

[2] Andrew B. Kahng,et al. A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[3] John N. Tsitsiklis,et al. Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[4] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[5] Richard S. Sutton,et al. Learning Instance-Independent Value Functions to Enhance Local Search , 1998, NIPS.

[6] Andrew W. Moore,et al. Learning Evaluation Functions for Global Optimization and Boolean Satisfiability , 1998, AAAI/IAAI.

[7] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[8] Kenneth Dean Boese,et al. Models for iterative global optimization , 1996 .

[9] Wei Zhang,et al. Reinforcement learning for job shop scheduling , 1996 .

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11] Andrew W. Moore,et al. Learning evaluation functions for global optimization , 1998 .

[12] Edward G. Coffman,et al. Approximation algorithms for bin packing: a survey , 1996 .

[13] Olivier Hudry. Vijay V. Vazirani, "Approximation algorithms", Berlin-Heidelberg, Springer-Verlag, 2001 , 2003 .