- -

An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation

Mostrar el registro sencillo del ítem

Ficheros en el ítem

dc.contributor.author Albiach, José es_ES
dc.contributor.author Sanchís Llopis, José María es_ES
dc.contributor.author Soler Fernández, David es_ES
dc.date.accessioned 2020-04-06T08:56:17Z
dc.date.available 2020-04-06T08:56:17Z
dc.date.issued 2008 es_ES
dc.identifier.issn 0377-2217 es_ES
dc.identifier.uri http://hdl.handle.net/10251/140207
dc.description.abstract [EN] In this paper we deal with an extended version of the Asymmetric Traveling Salesman Problem with Time Windows (ATSPTW) that considers time-dependent travel times and costs, for a more accurate approximation of some routing problems inside large cities, in which the time or cost of traversing certain streets (e.g. main avenues) depends on the moment of the day (for example rush-hours). Unlike other existing papers about time-dependent routing problems, we focus on an exact method for solving this new problem. For this end we first transform the problem into an Asymmetric Generalized TSP and then into a Graphical Asymmetric TSP. In this way, we can apply a known exact algorithm for the Mixed General Routing Problem, which seems to run well with our resulting instances. Computational results are presented on a set of 270 adapted instances from benchmark ATSPTW instances. es_ES
dc.description.sponsorship This work has been partially supported by the Ministerio de Ciencia y Tecnología of Spain (project TIC2003-05982-C05-01) and the Generalitat Valenciana (Ref: GRUPOS03/189). Thanks are due to Michel Gendreau, Alain Hertz, Gilbert Laporte and Mihnea Stan for providing us the set of benchmark ATSPTW instances, and to Matteo Fischetti and Norbert Ascheuer for their suggestions and help about the computational experiments. Last we are also indebted to the three anonymous referees for their valuable comments. es_ES
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Traveling salesman problem es_ES
dc.subject Time window es_ES
dc.subject Time-dependence es_ES
dc.subject.classification MATEMATICA APLICADA es_ES
dc.title An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2006.09.099 es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICYT//TIC2003-05982-C05-01/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/GVA//GRUPOS03%2F189/ 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 Albiach, J.; Sanchís Llopis, JM.; Soler Fernández, D. (2008). An asymmetric TSP with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation. European Journal of Operational Research. 189(3):789-802. https://doi.org/10.1016/j.ejor.2006.09.099 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion https://doi.org/10.1016/j.ejor.2006.09.099 es_ES
dc.description.upvformatpinicio 789 es_ES
dc.description.upvformatpfin 802 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 189 es_ES
dc.description.issue 3 es_ES
dc.relation.pasarela S\33439 es_ES
dc.contributor.funder Generalitat Valenciana es_ES
dc.contributor.funder Ministerio de Ciencia y Tecnología es_ES


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

Mostrar el registro sencillo del ítem