Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
From MaRDI portal
Publication:1908034
DOI10.1007/BF01720977zbMath0841.90098OpenAlexW2058233069MaRDI QIDQ1908034
Publication date: 28 February 1996
Published in: OR Spektrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01720977
generalized assignment problemsimulated annealingtabu searchset partitioningbranch-and-bound tree search\(\lambda\)-generation mechanismminimum cost assignmentreview of exact and heuristic methods
Related Items
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 genetic algorithm for the generalised assignment problem, Multi-neighborhood local search optimization for machine reassignment problem, A simple dual algorithm for the generalised assignment problem, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Dynamic tabu search strategies for the traveling purchaser problem, A tabu search algorithm for frequency assignment, Metaheuristics: A bibliography, Lagrangian relaxation guided problem space search heuristics for generalized assignment problems, Analysis of a local search heuristic for the generalized assignment problem with resource-independent task profits and identical resource capacity, 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, The equilibrium generalized assignment problem and genetic algorithm, Two heuristic solution concepts for the vehicle selection problem in line haul transports, Improved tabu search heuristics for the dynamic space allocation problem, A computational study of exact knapsack separation for the generalized assignment problem, A tabu search heuristic for the generalized assignment problem, A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem, Bees algorithm for generalized assignment problem, A dynamic tabu search for large-scale generalized assignment problems, Very large-scale variable neighborhood search for the generalized assignment problem, A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem, Competence-based assignment of tasks to workers in factories with demand-driven manufacturing, Optimizing cane supply decisions within a sugar mill region, 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, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, An ejection chain approach for the generalized assignment problem, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, A tabu search approach to the constraint satisfaction problem as a general problem solver
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- The generalized assignment problem: Valid inequalities and facets
- (1,k)-configuration facets for the generalized assignment problem
- Improved Lagrangean decomposition: An application to the generalized assignment problem
- A new Lagrangian relaxation approach to the generalized assignment problem
- A revised bound improvement sequence algorithm
- R \& D planning and the generalized assignment problem
- Tabu search techniques. A tutorial and an application to neural networks
- Probabilistic analysis of the generalised assignment problem
- A survey of algorithms for the generalized assignment problem
- An algorithm for the bottleneck generalized assignment problem
- A set partitioning heuristic for the generalized assignment problem
- A robust heuristic for the generalized assignment problem
- Tabu search for the multilevel generalized assignment problem
- Future paths for integer programming and links to artificial intelligence
- A property of assignment type mixed integer linear programming problems
- Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
- A user's guide to tabu search
- Dynamic tabu list management using the reverse elimination method
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- A hybrid algorithm for the generalized assignment problem
- Simulated Annealing – An Annotated Bibliography
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Generalized Assignment with Nonlinear Capacity Interaction
- Pivot and Complement–A Heuristic for 0-1 Programming
- Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
- Algorithms for the Multi-Resource Generalized Assignment Problem
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- A branch and bound algorithm for the generalized assignment problem
- Modeling Facility Location Problems as Generalized Assignment Problems
- Algorithms for the Vehicle Routing Problems with Time Deadlines
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
