A genetic algorithm for the generalised assignment problem

P.C. Chu

doi:10.1016/S0305-0548(96)00032-9

Return

A genetic algorithm for the generalised assignment problem

1997-01-01

418

PRE

P.C. Chu

J. E. Beasley

DOI：10.1016/S0305-0548(96)00032-9

Original

Original request for help

Save

Abstract

En 中文

In this paper we present a genetic algorithm (GA)-based heuristic for solving the generalised assignment problem. The generalised assignment problem is the problem of finding the minimum cost assignment of n jobs to m agents such that each job is assigned to exactly one agent, subject to an agent's capacity. In addition to the standard GA procedures, our GA heuristic incorporates a problem-specific coding of a solution structure, a fitness-unfitness pair evaluation function and a local improvement procedure. The performance of our algorithm is evaluated on 84 standard test problems of various sizes ranging from 75 to 4000 decision variables. Computational results show that the genetic algorithm heuristic is able to find optimal and near optimal solutions that are on average less than 0.01% from optimality. The performance of our heuristic also compares favourably to all other existing heuristic algorithms in terms of solution quality. Copyright (C) 1996 Elsevier Science Ltd

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.