Please use this identifier to cite or link to this item: http://ri.uaemex.mx/handle20.500.11799/79800
DC FieldValueLanguage
dc.creatorJOSE ANTONIO MARMOLEJO SAUCEDO-
dc.creatorRené Funes Rodríguez-
dc.creatorOLIVERIO CRUZ MEJIA-
dc.creatorJANIA ASTRID SAUCEDO MARTINEZ-
dc.date2016-01-10-
dc.date.accessioned2022-04-21T05:17:53Z-
dc.date.available2022-04-21T05:17:53Z-
dc.identifierhttp://hdl.handle.net/20.500.11799/79800-
dc.identifier.urihttp://ri.uaemex.mx/handle20.500.11799/79800-
dc.descriptionAmethodtosolvethedesignofadistributionnetworkforbottleddrinkscompanyisintroduced.Thedistributionnetworkproposed includes three stages: manufacturing centers, consolidation centers using cross-docking, and distribution centers. The problem is formulated using a mixed-integer programming model in the deterministic and single period contexts. Because the problem considersseveralelementsineachstage,adirectsolutionisverycomplicated.Formedium-to-largeinstancestheproblemfallsinto large scale. Based on that, a primal-dual decomposition known as cross decomposition is proposed in this paper. This approach allows exploring simultaneously the primal and dual subproblems of the original problem. A comparison of the direct solution withamixed-integerlinealprogrammingsolverversusthecrossdecompositionisshownforseveralrandomlygeneratedinstances. Resultsshowthegoodperformanceofthemethodproposed.-
dc.languageeng-
dc.publisherHINDAWI PUBLISHING CORPORATION-
dc.relationArticle ID 7851625;http://dx.doi.org/10.1155/2016/7851625-
dc.rightsinfo:eu-repo/semantics/openAccess-
dc.rightshttp://creativecommons.org/licenses/by-nc-nd/4.0-
dc.source1563-5147-
dc.subjectOPTIMIZATION-
dc.subjectSUPPLY CHAIN MANAGEMENT-
dc.subjectLOGISTICS-
dc.subjectinfo:eu-repo/classification/cti/2-
dc.titleDesign of a Distribution Network Using Primal-Dual Decomposition-
dc.typearticle-
dc.audiencestudents-
dc.audienceresearchers-
item.fulltextNo Fulltext-
item.grantfulltextnone-
Appears in Collections:Producción
Show simple item record

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.