Effective Algorithm and Heuristic for the Generalized Assignment Problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2004

Effective Algorithm and Heuristic for the Generalized Assignment Problem

Hacène Ouzia
  • Fonction : Auteur
  • PersonId : 967999
Salim Haddadi
  • Fonction : Auteur

Résumé

We present new Branch-and-Bound algorithm for the generalized assignment problem. A standard subgradient method (SM), used at each node of the decision tree to solve the Lagrangian dual, provides an upper bound. Our key contribution in this paper is a new heuristic, applied at each iteration of the SM, which tries to exploit the solution of the relaxed problem, by solving a smaller generalized assignment problem. The feasible solution found is then subjected to a solution improvement heuristic. We consider processing the root node as a Lagrangian heuristic. Computational comparisons are made with new existing methods.

Dates et versions

hal-01170427 , version 1 (01-07-2015)

Identifiants

Citer

Hacène Ouzia, Salim Haddadi. Effective Algorithm and Heuristic for the Generalized Assignment Problem. European Journal of Operational Research, 2004, 153 (1), pp.184-190. ⟨10.1016/S0377-2217(02)00710-5⟩. ⟨hal-01170427⟩
67 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More