Effective Algorithm and Heuristic for the Generalized Assignment Problem

Hacène Ouzia 1 Salim Haddadi
1 DECISION
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01170427
Contributor : Lip6 Publications <>
Submitted on : Wednesday, July 1, 2015 - 3:17:39 PM
Last modification on : Friday, May 24, 2019 - 5:26:20 PM

Identifiers

Citation

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

Share

Metrics

Record views

107