Mostrar el registro sencillo del ítem

dc.contributor.authorSicilia, Juan Antonio (1)
dc.contributor.authorOliveros, María-José
dc.contributor.authorLarrodé, Emilio
dc.contributor.authorRoyo, Beatriz
dc.date2015
dc.date.accessioned2018-01-31T16:27:42Z
dc.date.available2018-01-31T16:27:42Z
dc.identifier.issn2325-0399
dc.identifier.urihttps://reunir.unir.net/handle/123456789/6245
dc.description.abstractThis paper presents a mathematical model and an algorithm based on ant colony optimization to solve a long distance routing problems. The size of freight is relatively small, which uses Last In First Out “LIFO” policy and with several time constraints. The objective consists of reducing costs by optimizing the loading of goods in vehicles grouping orders and minimizing number of routes. The performance of the algorithm has been proved using experimental data based on historical data from a large Spanish transport company.es_ES
dc.language.isoenges_ES
dc.publisherApplied Mathematics and Information Scienceses_ES
dc.relation.ispartofseries;vol. 9, nº 2L
dc.relation.urihttp://www.naturalspublishing.com/files/published/61pt2x549c96js.pdfes_ES
dc.rightsopenAccesses_ES
dc.subjectlong haul transportationes_ES
dc.subjectless than truckloades_ES
dc.subjectvehicle routing problemes_ES
dc.subjectant colony optimizationes_ES
dc.subjectScopuses_ES
dc.titleSolving a long-distance routing problem using ant colony optimizationes_ES
dc.typeArticulo Revista Indexadaes_ES
reunir.tag~ARIes_ES
dc.identifier.doihttp://dx.doi.org/10.12785/amis/092L16


Ficheros en el ítem

FicherosTamañoFormatoVer

No hay ficheros asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem