Lagrangian heuristic for a class of the generalized assignment problems
Loading...
External sources
External sources
Date
Advisor
Coadvisor
Graduate program
Undergraduate course
Journal Title
Journal ISSN
Volume Title
Publisher
Pergamon-Elsevier B.V. Ltd
Elsevier
Elsevier
Type
Article
Access right
Acesso restrito
External sources
External sources
Abstract
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy heuristic is then applied to get a feasible Lagrangian-based solution. The latter is also used to speed up the subgradient scheme to solve the modified Lagrangian dual problem. A numerical study is presented to demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.
Description
Language
English
Citation
Computers & Mathematics With Applications. Oxford: Pergamon-Elsevier B.V. Ltd, v. 60, n. 4, p. 1115-1123, 2010.
