Mostrar el registro sencillo del ítem

Artículo

dc.creatorGrosso-de la Vega, Rafaeles
dc.creatorMuñuzuri, Jesúses
dc.creatorEscudero Santana, Alejandroes
dc.creatorBarbadilla Martín, Elenaes
dc.date.accessioned2018-02-14T17:30:21Z
dc.date.available2018-02-14T17:30:21Z
dc.date.issued2018
dc.identifier.citationGrosso-de la Vega, R., Muñuzuri Sanz, J., Escudero Santana, A. y Barbadilla Martín, E. (2018). Mathematical formulation and comparison of solution approaches for the vehicle routing problem with access time windows. Complexity, 2018
dc.identifier.issn1076-2787es
dc.identifier.urihttps://hdl.handle.net/11441/70298
dc.description.abstractThe application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access TimeWindows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction.We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.es
dc.description.sponsorshipMinisterio de Economía y Competitividad EC2013-47286-C3-3-Res
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherWiley Hindawi Partnershipes
dc.relation.ispartofComplexity, 2018
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectVehicle Routing Problemes
dc.subjectAccess Time Windowses
dc.subjectMathematical Formulationes
dc.titleMathematical formulation and comparison of solution approaches for the vehicle routing problem with access time windowses
dc.typeinfo:eu-repo/semantics/articlees
dcterms.identifierhttps://ror.org/03yxnpp24
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessRightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas IIes
dc.relation.projectIDEC2013-47286-C3-3-Res
dc.relation.publisherversionhttps://www.hindawi.com/journals/complexity/2018/4621694/es
dc.identifier.doi10.1155/2018/4621694es
idus.format.extent10 p.es
dc.journaltitleComplexityes
dc.publication.volumen2018es
dc.contributor.funderMinisterio de Economía y Competitividad (MINECO). España

FicherosTamañoFormatoVerDescripción
4621694.pdf561.2KbIcon   [PDF] Ver/Abrir  

Este registro aparece en las siguientes colecciones

Mostrar el registro sencillo del ítem

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional