Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem |
| |
Authors: | Sne ana Mitrovi -Mini ,Abraham P. Punnen |
| |
Affiliation: | aDepartment of Mathematics, Simon Fraser University, BC, Canada |
| |
Abstract: | We introduce a heuristic for the Multi-Resource Generalized Assignment Problem (MRGAP) based on the concepts of Very Large-Scale Neighborhood Search and Variable Neighborhood Search. The heuristic is a simplified version of the Very Large-Scale Variable Neighborhood Search for the Generalized Assignment Problem. Our algorithm can be viewed as a k-exchange heuristic; but unlike traditional k-exchange algorithms, we choose larger values of k resulting in neighborhoods of very large size with high probability. Searching this large neighborhood (approximately) amounts to solving a sequence of smaller MRGAPs either by exact algorithms or by heuristics. Computational results on benchmark test problems are presented. We obtained improved solutions for many instances compared to some of the best known heuristics for the MRGAP within reasonable running time. The central idea of our heuristic can be used to develop efficient heuristics for other hard combinatorial optimization problems as well. |
| |
Keywords: | Generalized assignment 0– 1 integer programs Heuristics Local search VLSN Search Variable neighbourhood search Resource allocation |
本文献已被 ScienceDirect 等数据库收录! |