Voltar
Artigo Acesso aberto Revisado por pares
BIBTEX RIS

An improved sine cosine algorithm for assignment problem

2021; IOP Publishing; Volume: 2031; Issue: 1 Linguagem: Inglês

10.1088/1742-6596/2031/1/012057

ISSN

1742-6596

Autores

Dan Ye, Yu Liu, Shan Zhang, Fei Yu, Hongyu Meng, Bo Li, Erzhen Shang,

Tópico(s)

Advanced Computational Techniques and Applications

Resumo

Abstract The assignment problem is a NP-hard combinatorial optimization problem, where assignees are being assigned to perform tasks. This paper presents an improved sine and cosine algorithm (ISCA) to solve this problem. Nonlinear decreasing inertia weight, chaotic map and greedy strategy are added to the original sine cosine algorithm (SCA) to enhance the ability of focusing on optimal and avoiding local optima. Simulation results show that the proposed algorithm can get more competitive solutions when compared with differential evolution (DE), particle swarm optimization (PSO) and original SCA.

Referência(s)