Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
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 thi...
Guardado en:
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Capítulo de libro |
| Lenguaje: | Inglés |
| Publicado: |
Elsevier B.V.
2018
|
| Acceso en línea: | Registro en Scopus DOI Handle Registro en la Biblioteca Digital |
| Aporte de: | Registro referencial: Solicitar el recurso aquí |
| LEADER | 04030caa a22004217a 4500 | ||
|---|---|---|---|
| 001 | PAPER-25119 | ||
| 003 | AR-BaUEN | ||
| 005 | 20230518205706.0 | ||
| 008 | 190410s2018 xx ||||fo|||| 00| 0 eng|d | ||
| 024 | 7 | |2 scopus |a 2-s2.0-85051075056 | |
| 040 | |a Scopus |b spa |c AR-BaUEN |d AR-BaUEN | ||
| 100 | 1 | |a Lera-Romero, G. | |
| 245 | 1 | 0 | |a Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints |
| 260 | |b Elsevier B.V. |c 2018 | ||
| 506 | |2 openaire |e Política editorial | ||
| 504 | |a 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 | ||
| 504 | |a Gendreau, M., Ghiani, G., Guerriero, E., Time-dependent routing problems: A review (2015) Computers & Operations Research, 64, pp. 189-197 | ||
| 504 | |a Ichoua, S., Gendreau, M., Potvin, J.-Y., Vehicle dispatching with time-dependent travel times (2003) European journal of operational research, 144, pp. 379-396 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a 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 | ||
| 504 | |a Taccari, L., Integer programming formulations for the elementary shortest path problem (2016) European Journal of Operational Research, 252, pp. 122-130 | ||
| 520 | 3 | |a 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. |l eng | |
| 593 | |a Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, CABA, Argentina | ||
| 593 | |a Universidad Torcuato Di Tella, Consejo Nacional de Investigaciones Científicas y Técnicas, CABA, Argentina | ||
| 690 | 1 | 0 | |a ELEMENTARY SHORTEST PATH |
| 690 | 1 | 0 | |a INTEGER PROGRAMMING |
| 690 | 1 | 0 | |a TIME-DEPENDENT TRAVEL TIMES |
| 700 | 1 | |a Miranda-Bront, J.J. | |
| 773 | 0 | |d Elsevier B.V., 2018 |g v. 69 |h pp. 53-60 |p Electron. Notes Discrete Math. |x 15710653 |t Electronic Notes in Discrete Mathematics | |
| 856 | 4 | 1 | |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-85051075056&doi=10.1016%2fj.endm.2018.07.008&partnerID=40&md5=d1b89d5b813e0e8fdcf9860f58b30120 |y Registro en Scopus |
| 856 | 4 | 0 | |u https://doi.org/10.1016/j.endm.2018.07.008 |y DOI |
| 856 | 4 | 0 | |u https://hdl.handle.net/20.500.12110/paper_15710653_v69_n_p53_LeraRomero |y Handle |
| 856 | 4 | 0 | |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v69_n_p53_LeraRomero |y Registro en la Biblioteca Digital |
| 961 | |a paper_15710653_v69_n_p53_LeraRomero |b paper |c PE | ||
| 962 | |a info:eu-repo/semantics/article |a info:ar-repo/semantics/artículo |b info:eu-repo/semantics/publishedVersion | ||
| 963 | |a VARI | ||
| 999 | |c 86072 | ||