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

DOI10.1016/J.EJOR.2010.05.007MaRDI QIDQ992649zbMATH OpenOpenAlexFDO

Authors 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 programmingbranch and boundtabu searchgeneralized assignment problem

Mathematics Subject Classification ID

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

Recommendations

• A tabu search heuristic for the generalized assignment problem
• A hybrid heuristic for the generalized assignment problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A hybrid algorithm for the generalized assignment problem
• Solving the generalized assignment problem: an optimizing and heuristic approach

Cites work

• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1488098 (Why is no real title available?)
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
• A generalized assignment problem with special ordered sets: a polyhedral approach.
• A genetic algorithm for the generalised assignment problem
• A genetic algorithm for the generalised assignment problem
• A hybrid heuristic for the generalized assignment problem
• A hybrid method based on linear programming and tabu search for routing of logging trucks
• A hybrid tabu search/branch-and-bound algorithm for the direct flight network design problem
• A path relinking approach with ejection chains for the generalized assignment problem
• A tabu search heuristic for the generalized assignment problem
• A variable depth search algorithm with branching search for the generalized assignment problem
• An ejection chain approach for the generalized assignment problem
• Analyses on the 2 and 3-flip neighborhoods for the MAX SAT
• Effective algorithm and heuristic for the generalized assignment problem.
• 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
• Hybrid extreme point tabu search
• Local branching
• P-Complete Approximation Problems
• Solving the generalized assignment problem: an optimizing and heuristic approach
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu search for the multilevel generalized assignment problem
• The generalized assignment problem

Cited in

(19)

• An ejection chain approach for the generalized assignment problem
• A note of reduced dimension optimization algorithm of assignment problem
• A hybrid algorithm for the generalized assignment problem
• Branch and bound crossed with GA to solve hybrid flowshops
• Fleet management: a vehicle and driver assignment model
• Two heuristic solution concepts for the vehicle selection problem in line haul transports
• A three-phase matheuristic algorithm for the multi-day task assignment problem
• An effective matheuristic for the capacitated total quantity discount problem
• Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
• Multi-neighborhood local search optimization for machine reassignment problem
• A tabu search heuristic for the generalized assignment problem
• scientific article; zbMATH DE number 5556493 (Why is no real title available?)
• A dynamic tabu search for large-scale generalized assignment problems
• Optimal ABC inventory classification using interval programming
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Tabu search for the multilevel generalized assignment problem
• Hybrid Ant Colony Optimization Algorithms—Behaviour Investigation Based on Intuitionistic Fuzzy Logic
• A hybrid heuristic for the generalized assignment problem
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992649)