A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem

Autores
Vitale, Ignacio; Dondo, Rodolfo
Año de publicación
2020
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Resource constrained shortest path
Label setting
Column generation
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/116727
Acceder
id SEDICI_ade9cc41c179ab11fb744f00906a4bd0
oai_identifier_str oai:sedici.unlp.edu.ar:10915/116727
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problemVitale, IgnacioDondo, RodolfoCiencias InformáticasResource constrained shortest pathLabel settingColumn generationThe 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.Sociedad Argentina de Informática e Investigación Operativa2020-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1-9http://sedici.unlp.edu.ar/handle/10915/116727enginfo:eu-repo/semantics/altIdentifier/url/http://49jaiio.sadio.org.ar/pdfs/siiio/SIIIO-01.pdfinfo:eu-repo/semantics/altIdentifier/issn/2618-3277info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/3.0/Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:19:13Zoai:sedici.unlp.edu.ar:10915/116727Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:19:13.856SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
title A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
spellingShingle A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
Vitale, Ignacio
Ciencias Informáticas
Resource constrained shortest path
Label setting
Column generation
title_short A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
title_full A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
title_fullStr A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
title_full_unstemmed A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
title_sort A dynamic-pricing label-setting algorithm for solving the elementary resource constrained shortest path problem
dc.creator.none.fl_str_mv Vitale, Ignacio
Dondo, Rodolfo
author Vitale, Ignacio
author_facet Vitale, Ignacio
Dondo, Rodolfo
author_role author
author2 Dondo, Rodolfo
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Resource constrained shortest path
Label setting
Column generation
topic Ciencias Informáticas
Resource constrained shortest path
Label setting
Column generation
dc.description.none.fl_txt_mv 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.
Sociedad Argentina de Informática e Investigación Operativa
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.
publishDate 2020
dc.date.none.fl_str_mv 2020-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/116727
url http://sedici.unlp.edu.ar/handle/10915/116727
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://49jaiio.sadio.org.ar/pdfs/siiio/SIIIO-01.pdf
info:eu-repo/semantics/altIdentifier/issn/2618-3277
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/3.0/
Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/3.0/
Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported (CC BY-NC-SA 3.0)
dc.format.none.fl_str_mv application/pdf
1-9
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846064250256097280
score 13.22299

Publicaciones similares