A variable depth search algorithm with branching search for the generalized assignment problem

In this paper, we propose a variable depth search (VDS) algorithm for the generalized assignment problem (GAP), which is one of the representative combinatorial optimization problems, and is known to be NP-hard. The VDS is a generalization of the local search. The main idea of VDS is to change the size of the neighborhood adaptively so that the algorithm can effectively traverse larger search space within reasonable computational time. In our previous paper (M. Yagiura, T. Yamaguchi and T. Ibaraki, “A variable depth search algorithm for the generalized assignment problem,” Proc. 2nd Metaheuristics International Conference (MIC97), 1997 129-130 (full version is to appear in the post-conference book)), we proposed a simple VDS algorithm for the GAP, and obtained good results. To further improve the performance of the VDS, we examine the effectiveness of incorporating branching search processes to construct the neighborhoods. Various types of branching rules are examined, and it is observed that appropriate ...

[1]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[2]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[3]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

[5]  Paolo Toth,et al.  Algorithms and computer implementations , 1990 .

[6]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[7]  Michael Racer,et al.  A robust heuristic for the Generalized Assignment Problem , 1994, Ann. Oper. Res..

[8]  Dirk Cattrysse,et al.  A set partitioning heuristic for the generalized assignment problem , 1994 .

[9]  J. P. Kelly,et al.  Tabu search for the multilevel generalized assignment problem , 1995 .

[10]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[11]  Michael Racer,et al.  A hybrid heuristic for the generalized assignment problem , 1995 .

[12]  Luiz Antonio Nogueira Lorena,et al.  Relaxation heuristics for a generalized assignment problem , 1996 .

[13]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.

[14]  H. R. Lourenço,et al.  Adaptive Approach Heuristics for The Generalized Assignment Problem , 1998 .

[15]  Toshihide Ibaraki,et al.  A tabu search approach to the constraint satisfaction problem as a general problem solver , 1998, Eur. J. Oper. Res..

[16]  T. Ibaraki,et al.  A Variable Depth Search Algorithm for the Generalized Assignment Problem , 1999 .