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

DOI10.1016/j.disopt.2009.04.004zbMath1175.90259OpenAlexW2088165054MaRDI QIDQ1040083

Snežana Mitrović-Minić, Abraham P. Punnen

Publication date: 23 November 2009

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2009.04.004

zbMATH Keywords

heuristicslocal searchresource allocationvariable neighbourhood searchgeneralized assignment0-1 integer programsVLSN search

Mathematics Subject Classification ID

Related Items (12)

An efficient local search with noising strategy for Google machine reassignment problem ⋮ Clustered maximum weight clique problem: algorithms and empirical analysis ⋮ Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs ⋮ The quadratic minimum spanning tree problem and its variations ⋮ The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ Matheuristics: survey and synthesis ⋮ Fleet management: a vehicle and driver assignment model ⋮ The equilibrium generalized assignment problem and genetic algorithm ⋮ Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis ⋮ Variable neighbourhood search: methods and applications ⋮ Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations

Uses Software

• CPLEX
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of very large-scale neighborhood search techniques
• A general heuristic for vehicle routing problems
• An integer programming model for the allocation of databases in a distributed computer system
• A survey of algorithms for the generalized assignment problem
• Relaxation heuristics for a generalized assignment problem
• A set partitioning heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• Variable neighborhood search
• Tabu search for the multilevel generalized assignment problem
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• A path relinking approach with ejection chains for the generalized assignment problem
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• VLSN search algorithms for partitioning problems using matching neighbourhoods
• Very large-scale variable neighborhood search for the generalized assignment problem
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem

This page was built for publication: Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem