Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/43618
DC FieldValueLanguage
dc.contributor.authorMiguel, Fabioen_US
dc.contributor.authorFrutos, Marianoen_US
dc.contributor.authorTohmé, Fernandoen_US
dc.contributor.authorMéndez, Máximoen_US
dc.date.accessioned2018-11-21T16:34:48Z-
dc.date.available2018-11-21T16:34:48Z-
dc.date.issued2016en_US
dc.identifier.issn1929-5804en_US
dc.identifier.urihttp://hdl.handle.net/10553/43618-
dc.description.abstractThis paper analyzes the integration of two combinatorial problems that frequently arise in production and distribution systems. One is the Bin Packing Problem (BPP) problem, which involves finding an ordering of some objects of different volumes to be packed into the minimal number of containers of the same or different size. An optimal solution to this NP-Hard problem can be approximated by means of meta-heuristic methods. On the other hand, we consider the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW), which is a variant of the Travelling Salesman Problem (again a NP-Hard problem) with extra constraints. Here we model those two problems in a single framework and use an evolutionary meta-heuristics to solve them jointly. Furthermore, we use data from a real world company as a test-bed for the method introduced here.en_US
dc.languageengen_US
dc.relation.ispartofDecision Science Lettersen_US
dc.sourceDecision Science Letters [ISSN 1929-5804], v. 5, p. 317-326en_US
dc.subject120304 Inteligencia artificialen_US
dc.subject1207 Investigación operativaen_US
dc.subject120704 Distribución y transporteen_US
dc.subject1299 otras especialidades matemáticas (especificar)en_US
dc.subject.otherBin packing problemen_US
dc.subject.otherCapacitated vehicle routingen_US
dc.subject.otherLogisticsen_US
dc.subject.otherOptimizationen_US
dc.subject.otherProblem with time windowsen_US
dc.subject.otherOptimizaciónen_US
dc.titleIntegrating packing and distribution problems and optimization through mathematical programmingen_US
dc.typeinfo:eu-repo/semantics/Articlees
dc.typeArticlees
dc.identifier.doi10.5267/j.dsl.2015.10.002
dc.identifier.scopus84951947825-
dc.contributor.authorscopusid57023610800-
dc.contributor.authorscopusid24482935700-
dc.contributor.authorscopusid57203535337-
dc.contributor.authorscopusid23474473600-
dc.identifier.eissn1929-5812-
dc.description.lastpage326-
dc.description.firstpage317-
dc.relation.volume5-
dc.investigacionIngeniería y Arquitecturaen_US
dc.type2Artículoen_US
dc.utils.revisionen_US
dc.date.coverdateEnero 2016
dc.identifier.ulpgces
dc.description.sjr0,31
dc.description.sjrqQ3
item.fulltextCon texto completo-
item.grantfulltextopen-
crisitem.author.deptGIR SIANI: Computación Evolutiva y Aplicaciones-
crisitem.author.deptIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.deptDepartamento de Informática y Sistemas-
crisitem.author.orcid0000-0002-7133-7108-
crisitem.author.parentorgIU Sistemas Inteligentes y Aplicaciones Numéricas-
crisitem.author.fullNameMéndez Babey, Máximo-
Appears in Collections:Artículos
Thumbnail
PDF
Adobe PDF (1,04 MB)
Show simple item record

Google ScholarTM

Check

Altmetric


Share



Export metadata



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