| dc.creator | Vitale, Ignacio | |
| dc.creator | Dondo, Rodolfo | |
| dc.date | 2019-09 | |
| dc.date | 2019 | |
| dc.date | 2020-02-26T16:41:03Z | |
| dc.date.accessioned | 2023-07-14T18:31:36Z | |
| dc.date.available | 2023-07-14T18:31:36Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/89663 | |
| dc.identifier | issn:2618-3277 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7431754 | |
| dc.description | The elementary shortest-path problem with time-windows and capac-ity constraints is a problem used for solving vehicle-routing and crew-scheduling applications. It occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the column-generation formulation of the vehicle routing problem with time windows and its variations. In the problem there is a directed graph with a source node and a destination node, and each arc has a cost and a vector of weights specifying its requirements of a resource with a finite capacity. A minimum cost source–destination directed path is sought such that the total consumption of the resource does not exceed the capacity. The problem ins NP-hard in the strong sense. We review integer-linear formulation to the problem and compare them in order to study their computational efficiency. | |
| dc.description | Sociedad Argentina de Informática e Investigación Operativa | |
| dc.format | application/pdf | |
| dc.format | 147-158 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-sa/3.0/ | |
| dc.rights | Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | Shortest path problem | |
| dc.subject | Alternative formulations | |
| dc.subject | Column generation | |
| dc.title | On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
