A path relinking approach with ejection chains for the generalized assignment problem

DOI10.1016/j.ejor.2004.08.015zbMath1079.90119MaRDI QIDQ2570155

Fred Glover, Toshihide Ibaraki, Mutsunori Yagiura

Publication date: 26 October 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2004.08.015

zbMATH Keywords

Metaheuristics; Path relinking; Scatter search; Generalized assignment problem; Ejection chains

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

60C05: Combinatorial probability

90B80: Discrete location and assignment

Related Items

On solving the Lagrangian dual of integer programs via an incremental approach, A hybrid meta-heuristic for the batching problem in just-in-time flow shops, An LP-based heuristic procedure for the generalized assignment problem with special ordered sets, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, An effective VNS for the capacitated \(p\)-median problem, Repulsive assignment problem, A computational study of exact knapsack separation for the generalized assignment problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem, Bees algorithm for generalized assignment problem, A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem, Scatter search --- wellsprings and challenges, A path relinking approach with ejection chains for the generalized assignment problem, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, An ejection chain approach for the generalized assignment problem, Very large-scale variable neighborhood search for the generalized assignment problem

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
• A robust heuristic for the generalized assignment problem
• A genetic algorithm for the generalised assignment problem
• Tabu search for the multilevel generalized assignment problem
• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• 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
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• P-Complete Approximation Problems
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Lagrangian Heuristic For The Generalized Assignment Problem
• A tabu search heuristic for the generalized assignment problem