论文信息 - An Effective Lagrangian Heuristic For The Generalized Assignment Problem

An Effective Lagrangian Heuristic For The Generalized Assignment Problem

Abstract We present an algorithm for generating and improving feasible assignments for the generalized assignment problem (GAP). This algorithm is applied at each iteration of a subgradient method for the weak Lagrangian relaxation of the GAP. Computational results are presented and compared with other heuristics.

H. Ouzia | S. Haddadi

[1] A. M. Geoffrion. Lagrangean Relaxation and Its Uses in Integer Programming , 1972 .

[2] M. Fisher,et al. A multiplier adjustment method for the generalized assignment problem , 1986 .

[3] J. Mazzola. Generalized Assignment with Nonlinear Capacity Interaction , 1989 .

[4] L. V. Wassenhove,et al. A survey of algorithms for the generalized assignment problem , 1992 .

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

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

[7] John E. Beasley,et al. A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[8] Salim Haddadi,et al. Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem , 1999 .