A new formulation to the shortest path problem with time windows and capacity constraints

Autores
Dondo, Rodolfo Gabriel
Año de publicación
2012
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is NP-hard in the strong sense. Classical solution approaches are based on a nonelementary shortest-path problem with resource constraints using dynamic-programming labeling algorithms. In this way, numerous label-setting algorithms have been developed. Contrarily to this approach and with the aim to obtain elemental and optimal solutions, we propose a new mixed integerlinear formulation to the SPPTWCC. Some valid inequalities that can be used to strengthen the linear relaxation of the SPPTWCC are also proposed. Numerical experiments on some VRPTW instances taken from Solomon's benchmark problems show that (near) optimal solutions are easily obtained in spite of the considerable problem size. Also the number of generated columns is kept at a very low level.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Materia
Vehicle Routing
Column Generation,
Milp Formulation
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/18786
Acceder
id CONICETDig_ceb1e9434369254155e4c5fcb83b21fb
oai_identifier_str oai:ri.conicet.gov.ar:11336/18786
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling A new formulation to the shortest path problem with time windows and capacity constraintsDondo, Rodolfo GabrielVehicle RoutingColumn Generation,Milp Formulationhttps://purl.org/becyt/ford/2.11https://purl.org/becyt/ford/2The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is NP-hard in the strong sense. Classical solution approaches are based on a nonelementary shortest-path problem with resource constraints using dynamic-programming labeling algorithms. In this way, numerous label-setting algorithms have been developed. Contrarily to this approach and with the aim to obtain elemental and optimal solutions, we propose a new mixed integerlinear formulation to the SPPTWCC. Some valid inequalities that can be used to strengthen the linear relaxation of the SPPTWCC are also proposed. Numerical experiments on some VRPTW instances taken from Solomon's benchmark problems show that (near) optimal solutions are easily obtained in spite of the considerable problem size. Also the number of generated columns is kept at a very low level.Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaPlanta Piloto de Ingeniería Química2012-07info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/18786Dondo, Rodolfo Gabriel; A new formulation to the shortest path problem with time windows and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 42; 3; 7-2012; 257-2650327-07931851-8796CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/http://www.laar.uns.edu.ar/indexes/artic_v4203/Vol42_03_257.pdfinfo:eu-repo/semantics/altIdentifier/url/http://ref.scielo.org/knj2sqinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-03T09:51:28Zoai:ri.conicet.gov.ar:11336/18786instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-09-03 09:51:29.081CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv A new formulation to the shortest path problem with time windows and capacity constraints
title A new formulation to the shortest path problem with time windows and capacity constraints
spellingShingle A new formulation to the shortest path problem with time windows and capacity constraints
Dondo, Rodolfo Gabriel
Vehicle Routing
Column Generation,
Milp Formulation
title_short A new formulation to the shortest path problem with time windows and capacity constraints
title_full A new formulation to the shortest path problem with time windows and capacity constraints
title_fullStr A new formulation to the shortest path problem with time windows and capacity constraints
title_full_unstemmed A new formulation to the shortest path problem with time windows and capacity constraints
title_sort A new formulation to the shortest path problem with time windows and capacity constraints
dc.creator.none.fl_str_mv Dondo, Rodolfo Gabriel
author Dondo, Rodolfo Gabriel
author_facet Dondo, Rodolfo Gabriel
author_role author
dc.subject.none.fl_str_mv Vehicle Routing
Column Generation,
Milp Formulation
topic Vehicle Routing
Column Generation,
Milp Formulation
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.11
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is NP-hard in the strong sense. Classical solution approaches are based on a nonelementary shortest-path problem with resource constraints using dynamic-programming labeling algorithms. In this way, numerous label-setting algorithms have been developed. Contrarily to this approach and with the aim to obtain elemental and optimal solutions, we propose a new mixed integerlinear formulation to the SPPTWCC. Some valid inequalities that can be used to strengthen the linear relaxation of the SPPTWCC are also proposed. Numerical experiments on some VRPTW instances taken from Solomon's benchmark problems show that (near) optimal solutions are easily obtained in spite of the considerable problem size. Also the number of generated columns is kept at a very low level.
Fil: Dondo, Rodolfo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
description The Shortest-path problem with timewindows and capacity constraints (SPPTWCC) is a problem used for solving vehicle-routing and crewscheduling applications. The SPPTWCC occurs as a sub-problem used to implicitly generate the set of all feasible routes and schedules in the columngeneration formulation of the vehicle routing problem with time windows (VRPTW) and its variations. The problem is NP-hard in the strong sense. Classical solution approaches are based on a nonelementary shortest-path problem with resource constraints using dynamic-programming labeling algorithms. In this way, numerous label-setting algorithms have been developed. Contrarily to this approach and with the aim to obtain elemental and optimal solutions, we propose a new mixed integerlinear formulation to the SPPTWCC. Some valid inequalities that can be used to strengthen the linear relaxation of the SPPTWCC are also proposed. Numerical experiments on some VRPTW instances taken from Solomon's benchmark problems show that (near) optimal solutions are easily obtained in spite of the considerable problem size. Also the number of generated columns is kept at a very low level.
publishDate 2012
dc.date.none.fl_str_mv 2012-07
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/18786
Dondo, Rodolfo Gabriel; A new formulation to the shortest path problem with time windows and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 42; 3; 7-2012; 257-265
0327-0793
1851-8796
CONICET Digital
CONICET
url http://hdl.handle.net/11336/18786
identifier_str_mv Dondo, Rodolfo Gabriel; A new formulation to the shortest path problem with time windows and capacity constraints; Planta Piloto de Ingeniería Química; Latin American Applied Research; 42; 3; 7-2012; 257-265
0327-0793
1851-8796
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://www.laar.uns.edu.ar/indexes/artic_v4203/Vol42_03_257.pdf
info:eu-repo/semantics/altIdentifier/url/http://ref.scielo.org/knj2sq
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Planta Piloto de Ingeniería Química
publisher.none.fl_str_mv Planta Piloto de Ingeniería Química
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1842269096677212160
score 13.13397

Publicaciones similares