A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
From MaRDI portal
Publication:2386217
DOI10.1016/j.disopt.2004.03.005zbMath1087.90043OpenAlexW2057198049MaRDI QIDQ2386217
Fred Glover, Shinji Iwasaki, Toshihide Ibaraki, Mutsunori Yagiura
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2004.03.005
Strategic oscillationEjection chainAdaptive parameter adjustmentMulti-resource generalized assignment problemVery large-scale neighborhood search
Related Items
Fast machine reassignment, Split-merge: using exponential neighborhood search for scheduling a batching machine, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, A Survey of the Generalized Assignment Problem and Its Applications, Fleet management: a vehicle and driver assignment model, Cyclic transfers in school timetabling, The equilibrium generalized assignment problem and genetic algorithm, Strategic oscillation for the quadratic multiple knapsack problem, Tabu search tutorial. A graph drawing application, Solving the wire-harness design problem at a European car manufacturer, A personal perspective on problem solving by general purpose solvers, Tabu-enhanced iterated greedy algorithm: a case study in the quadratic multiple knapsack problem, A new extended formulation of the generalized assignment problem and some associated valid inequalities, Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of very large-scale neighborhood search techniques
- An integer programming model for the allocation of databases in a distributed computer system
- Relaxation heuristics for a generalized assignment problem
- Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP)
- A set partitioning heuristic for the generalized assignment problem
- A robust heuristic for the generalized assignment problem
- A genetic algorithm for the generalised assignment problem
- TSP ejection chains
- Tabu search for the multilevel generalized assignment problem
- A hybrid heuristic for the generalized assignment problem
- Relaxed tours and path ejections for the traveling salesman problem
- A decomposability index in logical analysis of data
- Data structures and ejection chains for solving large-scale traveling salesman problems
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Solving a real world assignment problem with a metaheuristic
- A path relinking approach with ejection chains for the generalized assignment problem
- A Subpath Ejection Method for the Vehicle Routing Problem
- A Lagrangian Dual-Based Branch-and-Bound Algorithm for the Generalized Multi-Assignment Problem
- Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
- An Ejection Chain Approach for the Generalized Assignment Problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- P-Complete Approximation Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Maximum matching and a polyhedron with 0,1-vertices
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
- A tabu search heuristic for the generalized assignment problem
- Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms
