Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem

Authors:
Sneana Mitrović-Minić;Abraham P. Punnen
Affiliations:
Department of Mathematics, Simon Fraser University, BC, Canada;Department of Mathematics, Simon Fraser University, BC, Canada
Venue:
Discrete Optimization
Year:
2009

Citing 13
Cited 2

Computer and Database Location in Distributed Computer Systems

IEEE Transactions on Computers
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Algorithms for the multi-resource generalized assignment problem

Management Science
A genetic algorithm for the generalised assignment problem

Computers and Operations Research
Variable neighborhood search

Computers and Operations Research
A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem

Management Science
A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics
Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach

INFORMS Journal on Computing
An Ejection Chain Approach for the Generalized Assignment Problem

INFORMS Journal on Computing
Exploring relaxation induced neighborhoods to improve MIP solutions

Mathematical Programming: Series A and B
A general heuristic for vehicle routing problems

Computers and Operations Research
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem

Discrete Optimization

Variable neighbourhood decomposition search for 0-1 mixed integer programs

Computers and Operations Research
A greedy variable neighborhood search heuristic for the maximal covering location problem with fuzzy coverage radii

Knowledge-Based Systems

Quantified Score

Hi-index	0.00

Visualization

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.