Email this article Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Authors: Litvinchev I.1,2,3, Mata M.1,2,3, Saucedo J.1,2,3, Rangel S.1,2,3
-
Affiliations:
- Computing Center Russian Academy of Sciences
- Faculty of Mechanical and Electrical Engineering(UANL)
- Department of Applied Mathematics (UNESP)
- Issue: Vol 56, No 5 (2017)
- Pages: 803-809
- Section: Systems Analysis and Operations Research
- URL: https://journal-vniispk.ru/1064-2307/article/view/219974
- DOI: https://doi.org/10.1134/S1064230717050070
- ID: 219974
Cite item
Open Access
Access granted
Subscription Access
Abstract
Modified Lagrangian bounds are proposed for the generalized assignment problem. The approach is based on a double decomposable structure of the formulation. A family of greedy heuristics is considered to get Lagrangian based feasible solutions. Numerical results for problem instances with number of agents close to number of tasks are provided.
About the authors
I. Litvinchev
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Author for correspondence.
Email: igorlitvinchev@gmail.com
Russian Federation, Moscow; New Leon; Saint Paulo
M. Mata
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Russian Federation, Moscow; New Leon; Saint Paulo
J. Saucedo
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Russian Federation, Moscow; New Leon; Saint Paulo
S. Rangel
Computing Center Russian Academy of Sciences; Faculty of Mechanical and Electrical Engineering(UANL); Department of Applied Mathematics (UNESP)
Email: igorlitvinchev@gmail.com
Russian Federation, Moscow; New Leon; Saint Paulo
Supplementary files
