Show simple item record

A genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costs

dc.contributor.authorJonard, Nicolas
dc.contributor.authorDellaert, Nico
dc.contributor.authorJeunet, Jully
dc.date.accessioned2009-12-11T09:09:21Z
dc.date.available2009-12-11T09:09:21Z
dc.date.issued2000
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/2667
dc.language.isoenen
dc.subjectgenetic algorithmen
dc.subject.ddc006.3en
dc.titleA genetic algorithm to solve the general multi-level lot-sizing problem with time-varying costsen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenWe develop a genetic algorithm (GA) to solve the uncapacitated multilevel lotsizing problem in material requirements planning (MRP) systems. The major drawback of existing approaches is undoubtedly their inability to provide costefficient solutions in a reasonable computation time for realistic size problems involving general product structures. By contrast, the proposed GA can easily handle large product structures (more than 500 items) with numerous common parts, a problem type for which standard optimization software memory becomes rapidly insufficient. Based upon several hybrid operators and an original way to build up the initial population, the resultant GA provides in a moderate execution time high cost-effectiveness solutions compared with other techniques, in the extensive tests we performed.en
dc.relation.isversionofjnlnameInternational Journal of Production Research
dc.relation.isversionofjnlvol38en
dc.relation.isversionofjnlissue5en
dc.relation.isversionofjnldate2000
dc.relation.isversionofjnlpages241-257en
dc.description.sponsorshipprivateouien
dc.relation.isversionofjnlpublisherTaylor & Francisen
dc.subject.ddclabelIntelligence artificielleen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record