A tabu search heuristic for the generalized assignment problem
From MaRDI portal
Publication:5938390
DOI10.1016/S0377-2217(00)00108-9zbMath0980.90045OpenAlexW1975167882MaRDI QIDQ5938390
Publication date: 12 March 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00108-9
Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (30)
A compact model and tight bounds for a combined location-routing problem ⋮ Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness ⋮ A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem ⋮ A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department ⋮ An efficient local search with noising strategy for Google machine reassignment problem ⋮ An LP-based heuristic procedure for the generalized assignment problem with special ordered sets ⋮ A simulated annealing approach to the traveling tournament problem ⋮ An investigation of nature inspired algorithms on a particular vehicle routing problem in the presence of shift assignment ⋮ Lagrangian relaxation guided problem space search heuristics for generalized assignment problems ⋮ A three-phase matheuristic algorithm for the multi-day task assignment problem ⋮ Two stage decision making approach for Sensor Mission Assignment Problem ⋮ A Survey of the Generalized Assignment Problem and Its Applications ⋮ A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system ⋮ Solving the wire-harness design problem at a European car manufacturer ⋮ The capacity and distance constrained plant location problem ⋮ Finding good nurse duty schedules: a case study ⋮ An exact method with variable fixing for solving the generalized assignment problem ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ The stochastic generalised assignment problem with Bernoulli demands ⋮ Bees algorithm for generalized assignment problem ⋮ Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints ⋮ A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem ⋮ An algorithm for the generalized quadratic assignment problem ⋮ Competence-based assignment of tasks to workers in factories with demand-driven manufacturing ⋮ Variable Neighborhood Search for Google Machine Reassignment problem ⋮ A path relinking approach with ejection chains for the generalized assignment problem ⋮ Hybrid scatter search and path relinking for the capacitated \(p\)-median problem ⋮ Combining an extended SMAA-2 method with integer linear programming for task assignment of multi-UCAV under multiple uncertainties ⋮ An ejection chain approach for the generalized assignment problem ⋮ Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- 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
- Tabu search for the multilevel generalized assignment problem
- A property of assignment type mixed integer linear programming problems
- Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
- An Ejection Chain Approach for the Generalized Assignment Problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- A branch and bound algorithm for the generalized assignment problem
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized 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 Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
This page was built for publication: A tabu search heuristic for the generalized assignment problem
