A comparison of different recombination operators for the 2-dimensional strip packing problem
- Autores
- Salto, Carolina
- Año de publicación
- 2006
- Idioma
- inglés
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- In this paper, the three-stage two-dimensional rectangular strip packing problem is tackled using genetic algorithms. A new problem dependent recombination operator, called best inherited levels recombination (BIL), is introduced. A comparison of its performance is carried out with respect to four classical recombination operators. A complete study of the influence of the recombination operators on the genetic search, including the trade-off between exploration and exploitation in the search process, is presented. The results show that the use of our specialized BIL recombination outperforms the others more generic on all problem instances for all the metrics tested
VII Workshop de Agentes y Sistemas Inteligentes (WASI)
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
Algorithms
strip packing
recombination
genetic algorithms - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
.jpg)
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/22622
Ver los metadatos del registro completo
| id |
SEDICI_34a04a9c7537397a945b2302d0c46b71 |
|---|---|
| oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/22622 |
| network_acronym_str |
SEDICI |
| repository_id_str |
1329 |
| network_name_str |
SEDICI (UNLP) |
| spelling |
A comparison of different recombination operators for the 2-dimensional strip packing problemSalto, CarolinaCiencias InformáticasAlgorithmsstrip packingrecombinationgenetic algorithmsIn this paper, the three-stage two-dimensional rectangular strip packing problem is tackled using genetic algorithms. A new problem dependent recombination operator, called best inherited levels recombination (BIL), is introduced. A comparison of its performance is carried out with respect to four classical recombination operators. A complete study of the influence of the recombination operators on the genetic search, including the trade-off between exploration and exploitation in the search process, is presented. The results show that the use of our specialized BIL recombination outperforms the others more generic on all problem instances for all the metrics testedVII Workshop de Agentes y Sistemas Inteligentes (WASI)Red de Universidades con Carreras en Informática (RedUNCI)2006-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1126-1138http://sedici.unlp.edu.ar/handle/10915/22622enginfo: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-10T11:58:33Zoai:sedici.unlp.edu.ar:10915/22622Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-10 11:58:33.447SEDICI (UNLP) - Universidad Nacional de La Platafalse |
| dc.title.none.fl_str_mv |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| title |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| spellingShingle |
A comparison of different recombination operators for the 2-dimensional strip packing problem Salto, Carolina Ciencias Informáticas Algorithms strip packing recombination genetic algorithms |
| title_short |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| title_full |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| title_fullStr |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| title_full_unstemmed |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| title_sort |
A comparison of different recombination operators for the 2-dimensional strip packing problem |
| dc.creator.none.fl_str_mv |
Salto, Carolina |
| author |
Salto, Carolina |
| author_facet |
Salto, Carolina |
| author_role |
author |
| dc.subject.none.fl_str_mv |
Ciencias Informáticas Algorithms strip packing recombination genetic algorithms |
| topic |
Ciencias Informáticas Algorithms strip packing recombination genetic algorithms |
| dc.description.none.fl_txt_mv |
In this paper, the three-stage two-dimensional rectangular strip packing problem is tackled using genetic algorithms. A new problem dependent recombination operator, called best inherited levels recombination (BIL), is introduced. A comparison of its performance is carried out with respect to four classical recombination operators. A complete study of the influence of the recombination operators on the genetic search, including the trade-off between exploration and exploitation in the search process, is presented. The results show that the use of our specialized BIL recombination outperforms the others more generic on all problem instances for all the metrics tested VII Workshop de Agentes y Sistemas Inteligentes (WASI) Red de Universidades con Carreras en Informática (RedUNCI) |
| description |
In this paper, the three-stage two-dimensional rectangular strip packing problem is tackled using genetic algorithms. A new problem dependent recombination operator, called best inherited levels recombination (BIL), is introduced. A comparison of its performance is carried out with respect to four classical recombination operators. A complete study of the influence of the recombination operators on the genetic search, including the trade-off between exploration and exploitation in the search process, is presented. The results show that the use of our specialized BIL recombination outperforms the others more generic on all problem instances for all the metrics tested |
| publishDate |
2006 |
| dc.date.none.fl_str_mv |
2006-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/22622 |
| url |
http://sedici.unlp.edu.ar/handle/10915/22622 |
| dc.language.none.fl_str_mv |
eng |
| language |
eng |
| 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 1126-1138 |
| 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_ |
1842903776139149312 |
| score |
12.993085 |