Differential Evolution Algorithms for the Generalized Assignment problem

In this paper, differential evolution (DE) algorithms are presented to solve the generalized assignment problem (GAP), which is basically concerned with finding the minimum cost assignment of jobs to agents such that each job is assigned to exactly one agent, subject to capacity constraint of agents...

Full description

Saved in:
Bibliographic Details
Published in:2009 IEEE Congress on Evolutionary Computation pp. 2606 - 2613
Main Authors: Tasgetiren, M.F., Suganthan, P.N., Tay Jin Chua, Al-Hajri, A.
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2009
Subjects:
Availability
Benchmark testing
Biological cells
Costs
Hybrid power systems
Libraries
Manufacturing
Mathematical model
Optimization methods
Stochastic processes
ISBN:1424429587, 9781424429585
ISSN:1089-778X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, differential evolution (DE) algorithms are presented to solve the generalized assignment problem (GAP), which is basically concerned with finding the minimum cost assignment of jobs to agents such that each job is assigned to exactly one agent, subject to capacity constraint of agents. The first algorithm is unique in terms of solving a discrete optimization problem on a continuous domain. The second one is a discrete/combinatorial variant of the traditional differential evolution algorithm working on a discrete domain. The objective is to present a continuous optimization algorithm dealing with discrete spaces hence to solve a discrete optimization problem. Both algorithms are hybridized with a ldquoblindrdquo variable neighborhood search (VNS) algorithm to further enhance the solution quality, especially to end up with feasible solutions. They are tested on a benchmark suite from OR Library. Computational results are promising for a continuous algorithm such that without employing any problem-specific heuristics and speed-up methods, the DE variant hybridized with a ldquoblindrdquo VNS local search was able to generate competitive results to its discrete counterpart.
ISBN:1424429587
9781424429585
ISSN:1089-778X
DOI:10.1109/CEC.2009.4983269