On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints

Autores
Vitale, Ignacio; Dondo, Rodolfo
Año de publicación
2019
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Shortest path problem
Alternative formulations
Column generation
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-sa/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/89663
Acceder
id SEDICI_084a1380f92b07ace8dd3b837784ee6f
oai_identifier_str oai:sedici.unlp.edu.ar:10915/89663
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity ConstraintsVitale, IgnacioDondo, RodolfoCiencias InformáticasShortest path problemAlternative formulationsColumn generationThe 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.Sociedad Argentina de Informática e Investigación Operativa2019-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf147-158http://sedici.unlp.edu.ar/handle/10915/89663enginfo:eu-repo/semantics/altIdentifier/issn/2618-3277info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-sa/3.0/Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:50:38Zoai:sedici.unlp.edu.ar:10915/89663Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:50:38.425SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
title On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
spellingShingle On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
Vitale, Ignacio
Ciencias Informáticas
Shortest path problem
Alternative formulations
Column generation
title_short On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
title_full On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
title_fullStr On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
title_full_unstemmed On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
title_sort On Alternative Formulations to the Shortest Path Problem with Time Windows and Capacity Constraints
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
Shortest path problem
Alternative formulations
Column generation
topic Ciencias Informáticas
Shortest path problem
Alternative formulations
Column generation
dc.description.none.fl_txt_mv 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.
Sociedad Argentina de Informática e Investigación Operativa
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.
publishDate 2019
dc.date.none.fl_str_mv 2019-09
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/89663
url http://sedici.unlp.edu.ar/handle/10915/89663
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/2618-3277
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-sa/3.0/
Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-sa/3.0/
Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
dc.format.none.fl_str_mv application/pdf
147-158
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_ 1842260384394772480
score 13.13397

Publicaciones similares