Imperialist competitive algorithm for the flowshop problem
This article presents a new optimization techniques based on Imperialistic Competitive Algorithm to solve the flowshop scheduling problems, which objective is to minimize the makespan. Furthermore, this approach is enhanced by a local search procedure in order to improve the best solutions. To show...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2015
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/50064 |
| Aporte de: |
| id |
I19-R120-10915-50064 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas Optimization flowshop |
| spellingShingle |
Ciencias Informáticas Optimization flowshop Minetti, Gabriela F. Salto, Carolina Imperialist competitive algorithm for the flowshop problem |
| topic_facet |
Ciencias Informáticas Optimization flowshop |
| description |
This article presents a new optimization techniques based on Imperialistic Competitive Algorithm to solve the flowshop scheduling problems, which objective is to minimize the makespan. Furthermore, this approach is enhanced by a local search procedure in order to improve the best solutions. To show the efficiency of the proposed methods, we consider many instances of increasing complexity for the flowshop problem.
Computational tests are presented and comparisons between the two approaches are made. The analysis of the results suggests that the enhanced approach is capable to find the best solutions of the problem at hand. |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Minetti, Gabriela F. Salto, Carolina |
| author_facet |
Minetti, Gabriela F. Salto, Carolina |
| author_sort |
Minetti, Gabriela F. |
| title |
Imperialist competitive algorithm for the flowshop problem |
| title_short |
Imperialist competitive algorithm for the flowshop problem |
| title_full |
Imperialist competitive algorithm for the flowshop problem |
| title_fullStr |
Imperialist competitive algorithm for the flowshop problem |
| title_full_unstemmed |
Imperialist competitive algorithm for the flowshop problem |
| title_sort |
imperialist competitive algorithm for the flowshop problem |
| publishDate |
2015 |
| url |
http://sedici.unlp.edu.ar/handle/10915/50064 |
| work_keys_str_mv |
AT minettigabrielaf imperialistcompetitivealgorithmfortheflowshopproblem AT saltocarolina imperialistcompetitivealgorithmfortheflowshopproblem |
| bdutipo_str |
Repositorios |
| _version_ |
1764820475446296577 |