| dc.creator | Vitale, Ignacio | |
| dc.creator | Dondo, Rodolfo | |
| dc.date | 2020-10 | |
| dc.date | 2020 | |
| dc.date | 2021-04-12T12:18:23Z | |
| dc.date.accessioned | 2023-07-15T01:16:28Z | |
| dc.date.available | 2023-07-15T01:16:28Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/116727 | |
| dc.identifier | http://49jaiio.sadio.org.ar/pdfs/siiio/SIIIO-01.pdf | |
| dc.identifier | issn:2618-3277 | |
| dc.identifier.uri | https://repositorioslatinoamericanos.uchile.cl/handle/2250/7457611 | |
| dc.description | The resource constrained elementary shortest-path problem is a problem used for solving vehicle-routing, production-scheduling and crew-scheduling applications. It occurs as a sub-problem used to implicitly generate the set of all feasible columns in a column-generation solution algorithm. 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 resources. A minimum-cost source to destination directed path is sought such that the total consumption of resources does not exceed the resources vehicle-capacity. The problem is NP-hard in the strong sense. We propose a new label-setting heuristic algorithm based on the dynamic update of resources and prices vectors according the partial label-path and embed it into a column generation algorithm to solve some testing problems. Later we perform some numerical experiments in order to study its computational efficiency. | |
| dc.description | Sociedad Argentina de Informática e Investigación Operativa | |
| dc.format | application/pdf | |
| dc.format | 1-9 | |
| dc.language | en | |
| dc.rights | http://creativecommons.org/licenses/by-nc-sa/3.0/ | |
| dc.rights | Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.subject | Resource constrained shortest path | |
| dc.subject | Label setting | |
| dc.subject | Column generation | |
| dc.title | A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem | |
| dc.type | Objeto de conferencia | |
| dc.type | Objeto de conferencia | |
