Parallel ACO algorithms for 2D Strip Packing
- Autores
- Salto, Carolina; Leguizamón, Mario Guillermo; Alba, Enrique
- Año de publicación
- 2010
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In this paper we present a study of a parallel Ant Colony System (ACS) for the two-dimensional strip packing problem. In our computational study, we emphasize the in uence of the incorporation of the received information in the target subcolony. Colonies send their best solutions instead of sending information from the matrix of pheromones, as happens in traditional parallel ACS. The solution arriving to a colony can provide further exploitation around promising solutions as this arrived solution can be used in both, the local update of the pheromone trail and the construction solution process of an ant. The aim of the paper is to report experimental results on the behavior of different types of parallel ACS algorithms, regarding solution qualities and parallel performance.
Presentado en XI Workshop Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Parallel algorithms - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/18807
Ver los metadatos del registro completo
id |
SEDICI_f5dde2b38eaff7832f6d5ee7f2c9eb9c |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/18807 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
Parallel ACO algorithms for 2D Strip PackingSalto, CarolinaLeguizamón, Mario GuillermoAlba, EnriqueCiencias InformáticasParallel algorithmsIn this paper we present a study of a parallel Ant Colony System (ACS) for the two-dimensional strip packing problem. In our computational study, we emphasize the in uence of the incorporation of the received information in the target subcolony. Colonies send their best solutions instead of sending information from the matrix of pheromones, as happens in traditional parallel ACS. The solution arriving to a colony can provide further exploitation around promising solutions as this arrived solution can be used in both, the local update of the pheromone trail and the construction solution process of an ant. The aim of the paper is to report experimental results on the behavior of different types of parallel ACS algorithms, regarding solution qualities and parallel performance.Presentado en XI Workshop Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2010-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf31-40http://sedici.unlp.edu.ar/handle/10915/18807enginfo:eu-repo/semantics/altIdentifier/isbn/978-950-9474-49-9info: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-03T10:26:30Zoai:sedici.unlp.edu.ar:10915/18807Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:26:30.392SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
Parallel ACO algorithms for 2D Strip Packing |
title |
Parallel ACO algorithms for 2D Strip Packing |
spellingShingle |
Parallel ACO algorithms for 2D Strip Packing Salto, Carolina Ciencias Informáticas Parallel algorithms |
title_short |
Parallel ACO algorithms for 2D Strip Packing |
title_full |
Parallel ACO algorithms for 2D Strip Packing |
title_fullStr |
Parallel ACO algorithms for 2D Strip Packing |
title_full_unstemmed |
Parallel ACO algorithms for 2D Strip Packing |
title_sort |
Parallel ACO algorithms for 2D Strip Packing |
dc.creator.none.fl_str_mv |
Salto, Carolina Leguizamón, Mario Guillermo Alba, Enrique |
author |
Salto, Carolina |
author_facet |
Salto, Carolina Leguizamón, Mario Guillermo Alba, Enrique |
author_role |
author |
author2 |
Leguizamón, Mario Guillermo Alba, Enrique |
author2_role |
author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas Parallel algorithms |
topic |
Ciencias Informáticas Parallel algorithms |
dc.description.none.fl_txt_mv |
In this paper we present a study of a parallel Ant Colony System (ACS) for the two-dimensional strip packing problem. In our computational study, we emphasize the in uence of the incorporation of the received information in the target subcolony. Colonies send their best solutions instead of sending information from the matrix of pheromones, as happens in traditional parallel ACS. The solution arriving to a colony can provide further exploitation around promising solutions as this arrived solution can be used in both, the local update of the pheromone trail and the construction solution process of an ant. The aim of the paper is to report experimental results on the behavior of different types of parallel ACS algorithms, regarding solution qualities and parallel performance. Presentado en XI Workshop Agentes y Sistemas Inteligentes (WASI) Red de Universidades con Carreras en Informática (RedUNCI) |
description |
In this paper we present a study of a parallel Ant Colony System (ACS) for the two-dimensional strip packing problem. In our computational study, we emphasize the in uence of the incorporation of the received information in the target subcolony. Colonies send their best solutions instead of sending information from the matrix of pheromones, as happens in traditional parallel ACS. The solution arriving to a colony can provide further exploitation around promising solutions as this arrived solution can be used in both, the local update of the pheromone trail and the construction solution process of an ant. The aim of the paper is to report experimental results on the behavior of different types of parallel ACS algorithms, regarding solution qualities and parallel performance. |
publishDate |
2010 |
dc.date.none.fl_str_mv |
2010-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/18807 |
url |
http://sedici.unlp.edu.ar/handle/10915/18807 |
dc.language.none.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
info:eu-repo/semantics/altIdentifier/isbn/978-950-9474-49-9 |
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 31-40 |
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_ |
1842260098213216256 |
score |
13.13397 |