An integer programming approach for the time-dependent TSP | ||
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas | |
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación | |
| dc.conicet.organizacion | Consejo Nacional de Investigaciones Científicas y Técnicas | |
| dc.contributor.author | Miranda Bront, Juan Jose | |
| dc.contributor.author | Méndez Díaz, Isabel | |
| dc.contributor.author | Zabala, Paula Lorena | |
| dc.date.issued | 2010-08 | |
| dc.description.abstract | The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the distance between them, but also on the position of the arc in the tour. We consider the formulations proposed in Picard and Queryanne [8] and Vander Wiel and Sahinidis [10], analyze the relationship between them and derive some valid inequalities and facets. Computational results are also presented for a Branch and Cut algorithm (B&C)that uses these inequalities, which showed to be very effective. | es |
| dc.description.fil | Fil: Miranda Bront, Juan Jose. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | |
| dc.description.fil | Fil: Méndez Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina | |
| dc.description.fil | Fil: Zabala, Paula Lorena. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina | |
| dc.format | application/pdf | es |
| dc.identifier.citation | Miranda Bront, Juan Jose; Méndez Díaz, Isabel; Zabala, Paula Lorena; An integer programming approach for the time-dependent TSP; Elsevier; Electronic Notes In Discrete Mathematics; 36; 8-2010; 351-358 | es |
| dc.identifier.issn | 1571-0653 | |
| dc.identifier.uri | http://hdl.handle.net/11336/16566 | |
| dc.journal.ciudad | Amsterdam | es |
| dc.journal.pagination | 351-358 | es |
| dc.journal.pais | Países Bajos | es |
| dc.journal.title | Electronic Notes In Discrete Mathematics | es |
| dc.journal.volume | 36 | es |
| dc.language.iso | eng | es |
| dc.publisher | Elsevier | es |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/doi/http://dx.doi.org/10.1016/j.endm.2010.05.045 | |
| dc.relation.alternativeid | info:eu-repo/semantics/altIdentifier/url/http://www.sciencedirect.com/science/article/pii/S1571065310000466?via%3Dihub | |
| dc.rights | info:eu-repo/semantics/openAccess | * |
| dc.rights.uri | https://creativecommons.org/licenses/by-nc-nd/2.5/ar/ | es |
| dc.subject | Tdtsp | es |
| dc.subject | Combinatorial Optimization | es |
| dc.subject | Branch And Cut | es |
| dc.subject.classification | Ciencias de la Computación | es |
| dc.subject.classification | Ciencias de la Computación e Información | es |
| dc.subject.classification | CIENCIAS NATURALES Y EXACTAS | es |
| dc.title | An integer programming approach for the time-dependent TSP | es |
| dc.type | info:eu-repo/semantics/article | |
| dc.type | info:ar-repo/semantics/artículo | |
| dc.type | info:eu-repo/semantics/publishedVersion | |
Archivos
Bloque original
Cargando...
- Nombre:
- CONICET_Digital_Nro.20315.pdf
- Tamaño:
- 197.03 KB
- Formato:
- Adobe Portable Document Format