| 1. Identity statement | |
| Reference Type | Journal Article |
| Site | mtc-m16.sid.inpe.br |
| Holder Code | isadg {BR SPINPE} ibi 8JMKD3MGPCW/3DT298S |
| Identifier | 6qtX3pFwXQZ3r59YDa/H6nGs |
| Repository | sid.inpe.br/iris@1916/2005/08.08.13.37 (restricted access) |
| Last Update | 2005:08.08.03.00.00 (UTC) administrator |
| Metadata Repository | sid.inpe.br/iris@1916/2005/08.08.13.37.33 |
| Metadata Last Update | 2018:06.05.01.28.30 (UTC) administrator |
| Secondary Key | INPE-12934-PRE/8213 |
| ISSN | 0160-5682 |
| Citation Key | LorenaLope:1997:GeAlAp |
| Title | Genetic algorithms applied to computationally difficult set covering problems  |
| Year | 1997 |
| Month | Apr. |
| Access Date | 2024, Apr. 28 |
| Secondary Type | PRE PI |
| Number of Files | 1 |
| Size | 569 KiB |
| 2. Context | |
| Author | 1 Lorena, Luiz Aantonio Nogueira 2 Lopes, L. D. S. |
| Group | 1 LAC-INPE-MCT-BR |
| Affiliation | 1 Instituto Nacional de Pesquisas Espaciais, Laboratório Associado de Computação e Matemática Aplicada, (INPE, LAC) |
| Journal | Journal of the Operational Research Society |
| Volume | 48 |
| Number | 4 |
| Pages | 440-445 |
| History (UTC) | 2005-08-08 13:37:33 :: sergio -> administrator :: 2006-09-28 22:35:28 :: administrator -> sergio :: 2008-01-07 12:49:50 :: sergio -> administrator :: 2018-06-05 01:28:30 :: administrator -> marciana :: 1997 |
| 3. Content and structure | |
| Is the master or a copy? | is the master |
| Content Stage | completed |
| Transferable | 1 |
| Content Type | External Contribution |
| Keywords | genetic algorithms optimisation set covering problems / OPTIMIZATION |
| Abstract | The set covering problem is a known NP-hard combinatorial optimisation problem for covering the rows of a matrix by a subset of columns at minimum cost. Genetic algorithms (GA) are a class of iteration procedures that simulate the evolution process of a structured population. The objective of this work is to show that a somewhat classical GA implementation reaches high quality computational results for difficult set covering problems arising in computing the 1-width of incidence matrices of Steiner triple systems. In computational tests all optimal and best known solutions were found for incidence matrices A(9), A(15), A(27), A(45), A(81) and A(243) with reasonable times for a microcomputer implementation. Other tests with classical set covering problems confirm the good results for an additional class of instances. |
| Area | COMP |
| Arrangement | urlib.net > BDMCI > Fonds > Produção anterior à 2021 > LABAC > Genetic algorithms applied... |
| doc Directory Content | access |
| source Directory Content | there are no files |
| agreement Directory Content | there are no files |
| 4. Conditions of access and use | |
| Language | en |
| Target File | genetic algorithms.pdf |
| User Group | administrator sergio |
| Visibility | shown |
| Copy Holder | SID/SCD |
| Archiving Policy | denypublisher denyfinaldraft18 |
| Read Permission | deny from all and allow from 150.163 |
| 5. Allied materials | |
| Next Higher Units | 8JMKD3MGPCW/3ESGTTP |
| Dissemination | WEBSCI; PORTALCAPES. |
| Host Collection | sid.inpe.br/banon/2003/08.15.17.40 |
| 6. Notes | |
| Empty Fields | alternatejournal archivist callnumber copyright creatorhistory descriptionlevel documentstage doi e-mailaddress electronicmailaddress format isbn label lineage mark mirrorrepository nextedition notes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup resumeid rightsholder schedulinginformation secondarydate secondarymark session shorttitle sponsor subject tertiarymark tertiarytype typeofwork url versiontype |
| 7. Description control | |
| e-Mail (login) | marciana |
| update | |