Show simple item record

dc.contributor.authorBelloni, Alexandre
dc.contributor.authorFreund, Robert M.
dc.contributor.authorSelove, Matthew
dc.contributor.authorSimester, Duncan
dc.date.accessioned2005-03-04T19:48:07Z
dc.date.available2005-03-04T19:48:07Z
dc.date.issued2005-03-04T19:48:07Z
dc.identifier.urihttp://hdl.handle.net/1721.1/7930
dc.description.abstractWe compare a broad range of optimal product line design methods. The comparisons take advantage of recent advances that make it possible to identify the optimal solution to problems that are too large for complete enumeration. Several of the methods perform surprisingly well, including Simulated Annealing, Product-Swapping and Genetic Algorithms. The Product-Swapping heuristic is remarkable for its simplicity. The performance of this heuristic suggests that the optimal product line design problem may be far easier to solve in practice than indicated by complexity theory.en
dc.format.extent412019 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesOperations Research Center Working Paper Series;OR 373-05
dc.subjectsimulated annealingen
dc.subjectproduct-swappingen
dc.subjectgenetic algorithmsen
dc.subjectproduct lineen
dc.titleOptimizing Product Line Designs: Efficient Methods and Comparisonsen
dc.typeWorking Paperen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record