- -

A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows

Show simple item record

Files in this item

Thumbnail
Name: aceptado.pdf
Size: 284.5Kb
Format: PDF
Description: Versión del Autor.
Open
[Cerrado]
Name: ORL2009.pdf
Size: 1.846Mb
Format: PDF
Description: Versión editorial
Request a copy of the document
dc.contributor.author Soler Fernández, David es_ES
dc.contributor.author Albiach Vicent, José es_ES
dc.contributor.author Martínez Molada, Eulalia es_ES
dc.date.accessioned 2016-07-07T07:18:03Z
dc.date.available 2016-07-07T07:18:03Z
dc.date.issued 2009-01
dc.identifier.issn 0167-6377
dc.identifier.uri http://hdl.handle.net/10251/67274
dc.description.abstract In this paper we deal with a generalization of the Vehicle Routing Problem with Time Windows that considers time-dependent travel times and costs. Through several steps we transform this extension into an Asymmetric Capacitated Vehicle Routing Problem, so it can be solved both optimally and heuristically with known codes. es_ES
dc.description.sponsorship This work has been supported by the Ministerio de Educacion y Ciencia, D. G. Investigacion of Spain (project TIN2005-07705-C02-01). en_EN
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof Operations Research Letters es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Vehicle Routing es_ES
dc.subject Time window es_ES
dc.subject Time-dependent costs es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.orl.2008.07.007
dc.relation.projectID info:eu-repo/grantAgreement/MEC//TIN2005-07705-C02-01/ES/TÉCNICAS DE ENCAMINAMIENTO BASADAS EN MÚLTIPLES RUTAS PARA REDES INALÁMBRICAS AD HOC PARA EL SOPORTE DE APLICACIONES DE COMPUTACIÓN UBICUA/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Matemática Aplicada - Departament de Matemàtica Aplicada es_ES
dc.description.bibliographicCitation Soler Fernández, D.; Albiach Vicent, J.; Martínez Molada, E. (2009). A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows. Operations Research Letters. 37(1):37-42. https://doi.org/10.1016/j.orl.2008.07.007 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.orl.2008.07.007 es_ES
dc.description.upvformatpinicio 37 es_ES
dc.description.upvformatpfin 42 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 37 es_ES
dc.description.issue 1 es_ES
dc.relation.senia 36694 es_ES
dc.contributor.funder Ministerio de Educación y Ciencia es_ES


This item appears in the following Collection(s)

Show simple item record