Navegar

Colección

Datos Estadísticas

Artículo

El editor solo permite decargar el artículo en su versión post-print desde el repositorio. Por favor, si usted posee dicha versión, enviela a
Consulte el artículo en la página del editor
Consulte la política de Acceso Abierto del editor

Abstract:

The impact of congestion in transportation has become one of the main concerns regarding urban planing in large cities. Time-Dependent Vehicle Routing Problems (TDVRPs) is the name given to a broad family of VRPs that explicitly incorporate the congestion by considering variable travel times. In this paper we study the Time-Dependent Elementary Shortest Path Problem with Resource Constraints (TDESPPRC), that appears as the pricing sub-problem in column generation-based approaches for TDVRPs. We consider two integer programming formulations which exploit the characteristics of the time-dependent travel time function and are evaluated on benchmark instances. On preliminary computational experiments, the approach is able to effectively solve instances with up to 25 vertices in reasonable times, showing its potential to be used within a Branch and Price algorithm. © 2018 Elsevier B.V.

Registro:

Documento: Artículo
Título:Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
Autor:Lera-Romero, G.; Miranda-Bront, J.J.
Filiación:Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, CABA, Argentina
Universidad Torcuato Di Tella, Consejo Nacional de Investigaciones Científicas y Técnicas, CABA, Argentina
Palabras clave:Elementary Shortest Path; Integer Programming; Time-Dependent Travel Times
Año:2018
Volumen:69
Página de inicio:53
Página de fin:60
DOI: http://dx.doi.org/10.1016/j.endm.2018.07.008
Título revista:Electronic Notes in Discrete Mathematics
Título revista abreviado:Electron. Notes Discrete Math.
ISSN:15710653
Registro:https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v69_n_p53_LeraRomero

Referencias:

  • Dabia, S., Ropke, S., van Woensel, T., Kok, T.D., Branch and price for the time-dependent vehicle routing problem with time windows (2013) Transportation Science, 47, pp. 380-396
  • Gendreau, M., Ghiani, G., Guerriero, E., Time-dependent routing problems: A review (2015) Computers & Operations Research, 64, pp. 189-197
  • Ichoua, S., Gendreau, M., Potvin, J.-Y., Vehicle dispatching with time-dependent travel times (2003) European journal of operational research, 144, pp. 379-396
  • Jepsen, M.K., Petersen, B., Spoorendonk, S., Pisinger, D., A branch-and-cut algorithm for the capacitated profitable tour problem (2014) Discrete Optimization, 14, pp. 78-96
  • Montero, A., Méndez-Díaz, I., Miranda-Bront, J.J., An integer programming approach for the time-dependent traveling salesman problem with time windows (2017) Computers & Operations Research, 88, pp. 280-289
  • Sun, P., Veelenturf, L.P., Dabia, S., Woensel, T.V., The time-dependent capacitated profitable tour problem with time windows and precedence constraints (2018) European Journal of Operational Research, 264, pp. 1058-1073
  • Taccari, L., Integer programming formulations for the elementary shortest path problem (2016) European Journal of Operational Research, 252, pp. 122-130

Citas:

---------- APA ----------
Lera-Romero, G. & Miranda-Bront, J.J. (2018) . Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. Electronic Notes in Discrete Mathematics, 69, 53-60.
http://dx.doi.org/10.1016/j.endm.2018.07.008
---------- CHICAGO ----------
Lera-Romero, G., Miranda-Bront, J.J. "Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints" . Electronic Notes in Discrete Mathematics 69 (2018) : 53-60.
http://dx.doi.org/10.1016/j.endm.2018.07.008
---------- MLA ----------
Lera-Romero, G., Miranda-Bront, J.J. "Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints" . Electronic Notes in Discrete Mathematics, vol. 69, 2018, pp. 53-60.
http://dx.doi.org/10.1016/j.endm.2018.07.008
---------- VANCOUVER ----------
Lera-Romero, G., Miranda-Bront, J.J. Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. Electron. Notes Discrete Math. 2018;69:53-60.
http://dx.doi.org/10.1016/j.endm.2018.07.008