Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
type: Item
instance of: scholarly article
title: Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
zbMATH Open document ID: 0841.90098
DOI: 10.1007/BF01720977
published in: OR Spektrum
publication date: 1996-02-28T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 849226
zbMATH Keywords: generalized assignment problem
zbMATH Keywords: minimum cost assignment
zbMATH Keywords: review of exact and heuristic methods
zbMATH Keywords: \(\lambda\)-generation mechanism
zbMATH Keywords: simulated annealing
zbMATH Keywords: tabu search
zbMATH Keywords: branch-and-bound tree search
zbMATH Keywords: set partitioning
author: Ibrahim. H Osman
describes a project that uses: OR-Library
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: A revised bound improvement sequence algorithm
cites work: Improved Lagrangean decomposition: An application to the generalized assignment problem
cites work: A property of assignment type mixed integer linear programming problems
cites work: A survey of algorithms for the generalized assignment problem
cites work: A set partitioning heuristic for the generalized assignment problem
cites work: Simulated Annealing – An Annotated Bibliography
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Tabu search techniques. A tutorial and an application to neural networks
cites work: Probabilistic analysis of the generalised assignment problem
cites work: A Multiplier Adjustment Method for the Generalized Assignment Problem
cites work: Algorithms for the Multi-Resource Generalized Assignment Problem
cites work: A comparison of techniques for solving the fleet size and mix vehicle routing problem
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: A user's guide to tabu search
cites work: (1,k)-configuration facets for the generalized assignment problem
cites work: The generalized assignment problem: Valid inequalities and facets
cites work: Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
cites work: Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
cites work: A new Lagrangian relaxation approach to the generalized assignment problem
cites work: Q3348707
cites work: A hybrid algorithm for the generalized assignment problem
cites work: Optimization by Simulated Annealing
cites work: Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
cites work: Tabu search for the multilevel generalized assignment problem
cites work: Q3929530
cites work: Q3993418
cites work: Generalized Assignment with Nonlinear Capacity Interaction
cites work: An algorithm for the bottleneck generalized assignment problem
cites work: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search
cites work: Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
cites work: A robust heuristic for the generalized assignment problem
cites work: Q4495496
cites work: A branch and bound algorithm for the generalized assignment problem
cites work: Modeling Facility Location Problems as Generalized Assignment Problems
cites work: Tabu Search Applied to the Quadratic Assignment Problem
cites work: Algorithms for the Vehicle Routing Problems with Time Deadlines
cites work: Q3993983
cites work: Q3785827
cites work: R \& D planning and the generalized assignment problem
full work available at URL: https://doi.org/10.1007/bf01720977
OpenAlex ID: W2058233069
Recommended article: A tabu search heuristic for the generalized assignment problem
Recommended article: Solving the generalized assignment problem: an optimizing and heuristic approach
Recommended article: A hybrid heuristic for the generalized assignment problem
Recommended article: Q4415704
Recommended article: Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem
Recommended article: Relaxation heuristics for a generalized assignment problem
Recommended article: A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
Recommended article: Heuristic and exact algorithms for the simultaneous assignment problem
Recommended article: Heuristics for the multi-resource generalized assignment problem
Recommended article: Q3642627