id: 00849226
dt: j
an: 00849226
au: Osman, Ibrahim H.
ti: Heuristics for the generalised assignment problem: Simulated annealing and
    tabu search approaches.
so: OR Spektrum 17, No.4, 211-225 (1995).
py: 1995
pu: Springer-Verlag, Berlin
la: EN
cc: 
ut: generalized assignment problem; minimum cost assignment; review of exact
    and heuristic methods; $λ$-generation mechanism; simulated annealing;
    tabu search; branch-and-bound tree search; set partitioning
ci: 
li: doi:10.1007/BF01720977
ab: Summary: The generalized assignment problem (GAP) is the problem of finding
    a minimum cost assignment of a set of jobs to a set of agents. Each job
    is assigned to exactly one agent. The total demands of all jobs
    assigned to any agent can not exceed the total resources available to
    that agent. A review of exact and heuristic methods is presented. A
    $λ$-generation mechanism is introduced. Different search strategies
    and parameter settings are investigated for the $λ$-generation
    descent, hybrid simulated annealing/tabu search and tabu search
    heuristic methods. The developed methods incorporate a number of
    features that have proven useful for obtaining optimal and near optimal
    solutions. The effectiveness of our approaches is established by
    comparing their performance in terms of solution quality and
    computational requirements to other specialized branch-and-bound tree
    search, simulated annealing and set partitioning heuristics on a set of
    standard problems from the literature.
rv: