Lagrangian heuristic for a class of the generalized assignment problems

被引：10

作者：

Litvinchev, Igor ^{[1
]}

Mata, Miguel ^{[2
]}

Rangel, Socorro ^{[3
]}

Saucedo, Jania ^{[2
]}

机构：

[1] Russian Acad Sci, Dorodnicyn Comp Ctr, Moscow, Russia

[2] UANL Nuevo Leon State Univ, Fac Mech & Elect Engn, Nuevo Leon, Mexico

[3] UNESP Sao Paulo State Univ, Dept Comp Sci & Stat, Sao Paulo, Brazil

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 2010年 / 60卷 / 04期

关键词：

Lagrangian heuristic; Integer programming; Many-to-many assignment problem; RELAXATION;

D O I：

10.1016/j.camwa.2010.03.070

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

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.

引用

页码：1115 / 1123

页数：9

共 50 条

[1] Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
Litvinchev, I. S.
Rangel, S.
[J]. COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2008, 48 (05) : 739 - 746
[2] Comparison of Lagrangian bounds for one class of generalized assignment problems
I. S. Litvinchev
S. Rangel
[J]. Computational Mathematics and Mathematical Physics, 2008, 48
[3] An effective Lagrangian heuristic for the generalized assignment problem
Haddadi, S
Ouzia, H
[J]. INFOR, 2001, 39 (04) : 351 - 356
[4] Lagrangian decomposition based heuristic for the generalized assignment problem
Haddadi, S
[J]. INFOR, 1999, 37 (04) : 392 - 402
[5] A Lagrangian based heuristic for a new class of assignment problem
Luo, Jia-xiang
Zhang, Mei
[J]. 2009 IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT COMPUTING AND INTELLIGENT SYSTEMS, PROCEEDINGS, VOL 2, 2009, : 803 - 807
[6] A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs
Tauer, Gregory
Nagi, Rakesh
[J]. PARALLEL COMPUTING, 2013, 39 (11) : 653 - 668
[7] GPU-accelerated Lagrangian heuristic for multidimensional assignment problems with decomposable costs
Natu, Shardul
Date, Ketan
Nagi, Rakesh
[J]. PARALLEL COMPUTING, 2020, 97
[8] Greedy approaches for a class of nonlinear Generalized Assignment Problems
Sharkey, Thomas C.
Romeijn, H. Edwin
[J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (05) : 559 - 572
[9] Exact solutions to a class of stochastic generalized assignment problems
Albareda-Sambola, Maria
van der Vlerk, Maarten H.
Fernandez, Elena
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 465 - 487
[10] A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
Poore, AB
Robertson, AJ
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 8 (02) : 129 - 150

← 1 2 3 4 5 →