Imperialist competitive algorithm for the flowshop problem

Autores
Minetti, Gabriela F.; Salto, Carolina
Año de publicación
2015
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
XVI Workshop Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
Materia
Ciencias Informáticas
Optimization
flowshop
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/50064

id SEDICI_dbba9ed265720a6a1fbe9cad68c28a43
oai_identifier_str oai:sedici.unlp.edu.ar:10915/50064
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Imperialist competitive algorithm for the flowshop problemMinetti, Gabriela F.Salto, CarolinaCiencias InformáticasOptimizationflowshopThis 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.XVI Workshop Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2015-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/50064enginfo:eu-repo/semantics/altIdentifier/isbn/978-987-3806-05-6info:eu-repo/semantics/reference/hdl/10915/50028info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:03:51Zoai:sedici.unlp.edu.ar:10915/50064Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:03:52.069SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Imperialist competitive algorithm for the flowshop problem
title Imperialist competitive algorithm for the flowshop problem
spellingShingle Imperialist competitive algorithm for the flowshop problem
Minetti, Gabriela F.
Ciencias Informáticas
Optimization
flowshop
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
dc.creator.none.fl_str_mv Minetti, Gabriela F.
Salto, Carolina
author Minetti, Gabriela F.
author_facet Minetti, Gabriela F.
Salto, Carolina
author_role author
author2 Salto, Carolina
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Optimization
flowshop
topic Ciencias Informáticas
Optimization
flowshop
dc.description.none.fl_txt_mv 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.
XVI Workshop Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI)
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.
publishDate 2015
dc.date.none.fl_str_mv 2015-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/50064
url http://sedici.unlp.edu.ar/handle/10915/50064
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/isbn/978-987-3806-05-6
info:eu-repo/semantics/reference/hdl/10915/50028
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844615906798338048
score 13.070432