Please use this identifier to cite or link to this item:
http://acervodigital.unesp.br/handle/11449/74919
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Toledo, Claudio Fabiano Motta | - |
dc.contributor.author | De Oliveira, Renato Resende Ribeiro | - |
dc.contributor.author | Morelato França, Paulo | - |
dc.date.accessioned | 2014-05-27T11:28:45Z | - |
dc.date.accessioned | 2016-10-25T18:46:00Z | - |
dc.date.available | 2014-05-27T11:28:45Z | - |
dc.date.available | 2016-10-25T18:46:00Z | - |
dc.date.issued | 2013-04-01 | - |
dc.identifier | http://dx.doi.org/10.1016/j.cor.2012.11.002 | - |
dc.identifier.citation | Computers and Operations Research, v. 40, n. 4, p. 910-919, 2013. | - |
dc.identifier.issn | 0305-0548 | - |
dc.identifier.uri | http://hdl.handle.net/11449/74919 | - |
dc.identifier.uri | http://acervodigital.unesp.br/handle/11449/74919 | - |
dc.description.abstract | The present paper proposes a new hybrid multi-population genetic algorithm (HMPGA) as an approach to solve the multi-level capacitated lot sizing problem with backlogging. This method combines a multi-population based metaheuristic using fix-and-optimize heuristic and mathematical programming techniques. A total of four test sets from the MULTILSB (Multi-Item Lot-Sizing with Backlogging) library are solved and the results are compared with those reached by two other methods recently published. The results have shown that HMPGA had a better performance for most of the test sets solved, specially when longer computing time is given. © 2012 Elsevier Ltd. | en |
dc.format.extent | 910-919 | - |
dc.language.iso | eng | - |
dc.source | Scopus | - |
dc.subject | Backlogging | - |
dc.subject | Fix and optimize | - |
dc.subject | Genetic algorithms | - |
dc.subject | Hybridization | - |
dc.subject | Lot sizing | - |
dc.subject | Multi-level | - |
dc.subject | Heuristic methods | - |
dc.subject | Mathematical programming | - |
dc.title | A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging | en |
dc.type | outro | - |
dc.contributor.institution | Universidade de São Paulo (USP) | - |
dc.contributor.institution | Federal University of Lavras | - |
dc.contributor.institution | Universidade Estadual Paulista (UNESP) | - |
dc.description.affiliation | University of São Paulo Institute of Mathematics and Computer Science | - |
dc.description.affiliation | Federal University of Lavras Department of Computer Science | - |
dc.description.affiliation | UNESP Department of Mathematics and Computing | - |
dc.description.affiliationUnesp | UNESP Department of Mathematics and Computing | - |
dc.identifier.doi | 10.1016/j.cor.2012.11.002 | - |
dc.identifier.wos | WOS:000314483400002 | - |
dc.rights.accessRights | Acesso restrito | - |
dc.relation.ispartof | Computers and Operations Research | - |
dc.identifier.scopus | 2-s2.0-84870952214 | - |
Appears in Collections: | Artigos, TCCs, Teses e Dissertações da Unesp |
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.