A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem

DOI10.1016/j.ejor.2010.05.007zbMath1205.90177OpenAlexW2086163307MaRDI QIDQ992649

Andrew J. Woodcock, John M. Wilson

Publication date: 9 September 2010

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

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

zbMATH Keywords

integer programminggeneralized assignment problemtabu searchbranch and bound

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items

Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ Multi-neighborhood local search optimization for machine reassignment problem ⋮ A note of reduced dimension optimization algorithm of assignment problem ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic ⋮ Fleet management: a vehicle and driver assignment model ⋮ Two heuristic solution concepts for the vehicle selection problem in line haul transports ⋮ Optimal ABC inventory classification using interval programming ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid method based on linear programming and tabu search for routing of logging trucks
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• A genetic algorithm for the generalised assignment problem
• Tabu search for the multilevel generalized assignment problem
• A hybrid heuristic for the generalized assignment problem
• Effective algorithm and heuristic for the generalized assignment problem.
• Local branching
• Hybrid extreme point tabu search
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Future paths for integer programming and links to artificial intelligence
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A path relinking approach with ejection chains for the generalized assignment problem
• A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem
• Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach
• An Ejection Chain Approach for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Tabu Search—Part I
• Tabu Search—Part II
• P-Complete Approximation Problems
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A genetic algorithm for the generalised assignment problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• A generalized assignment problem with special ordered sets: a polyhedral approach.
• A tabu search heuristic for the generalized assignment problem