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 条

[21] A memetic heuristic for the generalized quadratic assignment problem
Cordeau, Jean-Francois
Gaudioso, Manlio
Laporte, Gilbert
Moccia, Luigi
[J]. INFORMS JOURNAL ON COMPUTING, 2006, 18 (04) : 433 - 443
[22] A LAGRANGIAN HEURISTIC FOR SET-COVERING PROBLEMS
BEASLEY, JE
[J]. NAVAL RESEARCH LOGISTICS, 1990, 37 (01) : 151 - 164
[23] A GENERALIZED ASSIGNMENT HEURISTIC FOR VEHICLE-ROUTING
FISHER, ML
JAIKUMAR, R
[J]. NETWORKS, 1981, 11 (02) : 109 - 124
[24] A LINEAR RELAXATION HEURISTIC FOR THE GENERALIZED ASSIGNMENT PROBLEM
TRICK, MA
[J]. NAVAL RESEARCH LOGISTICS, 1992, 39 (02) : 137 - 151
[25] A Tabu search heuristic for the generalized assignment problem
Díaz, JA
Fernández, E
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 132 (01) : 22 - 38
[26] BOTTLENECK GENERALIZED ASSIGNMENT PROBLEMS
MAZZOLA, JB
NEEBE, AW
[J]. ENGINEERING COSTS AND PRODUCTION ECONOMICS, 1988, 14 (01): : 61 - 65
[27] HEURISTIC APPROACH TO NONSTANDARD FORM ASSIGNMENT PROBLEMS
JOSEPH, JA
[J]. OPERATIONS RESEARCH, 1967, 15 (04) : 680 - &
[28] Improved Lagrangian bounds and heuristics for the generalized assignment problem
Litvinchev, I.
Mata, M.
Saucedo, J.
Rangel, S.
[J]. JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL, 2017, 56 (05) : 803 - 809
[29] Improved Lagrangian bounds and heuristics for the generalized assignment problem
I. Litvinchev
M. Mata
J. Saucedo
S. Rangel
[J]. Journal of Computer and Systems Sciences International, 2017, 56 : 803 - 809
[30] A Lagrangian Relaxation based Heuristic Approach for Steel Grade Assignment Problem
Zheng, Yongyue
Tang, Lixin
[J]. IEEE/SOLI'2008: PROCEEDINGS OF 2008 IEEE INTERNATIONAL CONFERENCE ON SERVICE OPERATIONS AND LOGISTICS, AND INFORMATICS, VOLS 1 AND 2, 2008, : 2645 - 2650

← 1 2 3 4 5 →