Modified Differential Evolution for Task Assignment Problem

Author

Deng, Changshou ; Zhao, Bingyan ; Yang, Yanling ; Liu, Yan

Author_Institution

Sch. of Inf. Sci. & Technol., Jiujiang Univ., Jiujiang, China

fYear

2010

fDate

22-23 May 2010

Firstpage

1

Lastpage

4

Abstract

A modified Differential Evolution algorithm was proposed to solve the NP-complete Task Assignment problem. In the modified Differential Evolution algorithm, a new mapping operation was constructed to generate the permutation from the floating-point coded gene of each individual in the current population. This slightly modification made the extension of the continuous field of Differential Evolution to the discrete domain is possible. Two numerical experiments were conducted and the compared results with other heuristic algorithm show its superiority in solving the Task Assignment problem.

Keywords

combinatorial mathematics; evolutionary computation; NP-complete; combinatorial optimization; floating-point coded gene; heuristic algorithm; mapping operation; modified differential evolution algorithm; task assignment problem; Cities and towns; Costs; Heuristic algorithms; Information science; Mathematical model; Mathematics; Model driven engineering; Operations research; Production planning; Production systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-5872-1

Electronic_ISBN

978-1-4244-5874-5

Type

conf

DOI

10.1109/IWISA.2010.5473394

Filename

5473394