Retour aux résultats
Chapitres (2004), Metaheuristics Computer Decision-making, Kluwer Academic Publishers, pp. 1-17

A Path Relinking Algorithm for the Generalized Assignment Problem


The Generalized Assignment Problem (GAP) consists in finding a maximum-profit assignment of tasks to agents with capacity constraints. In this paper, a path relinking heuristic is proposed for the GAP. The main feature of our path relinking is that both feasible and infeasible solutions are inserted in the reference set of elite solutions, trade-off between feasibility and infeasibility being ruled through a penalty coefficient for infeasibility. Since exploration of the solution space is very sensitive to this penalty coefficient, the coefficient is dynamically updated at each round of combinations so that a balance is kept between feasible and infeasible solutions in the reference set. Numerical experiments reported on classical testbed instances of the OR-library show that the algorithm compares favorably to several other methods in the literature. In particular, more than 95% of the instances in the test-file were solved to optimality with short computation time.

ALFANDARI, L., PLATEAU, A. and TOLLA, P. (2004). A Path Relinking Algorithm for the Generalized Assignment Problem. In: Metaheuristics Computer Decision-making. 1st ed. Kluwer Academic Publishers, pp. 1-17.