Issues in the implementation of the DSD algorithm for the traffic assignment problem

Autores
Lotito, Pablo Andres
Año de publicación
2006
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
In this paper we consider the practical implementation of the disaggregated simplicial decomposition (DSD) algorithm for the traffic assignment problem. It is a column generation method that at each step has to solve a huge number of quadratic knapsack problems (QKP). We propose a Newton-like method to solve the QKP when the quadratic functional is convex but not necessarily strictly. Our O(n) algorithm does not improve the complexity of the current methods but extends them to a more general case and is better suited for reoptimization and so a good option for the DSD algorithm. It also allows the solution of many QKP's simultaneously in a vectorial or parallel way.
Fil: Lotito, Pablo Andres. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil; Argentina
Materia
LARGE SCALE OPTIMIZATION
NETWORK FLOWS
NON LINEAR PROGRAMMING
QUADRATIC PROGRAMMING
TRAFFIC
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/125314
Acceder
id CONICETDig_17039ef190f80e3844c43dd23ae53962
oai_identifier_str oai:ri.conicet.gov.ar:11336/125314
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Issues in the implementation of the DSD algorithm for the traffic assignment problemLotito, Pablo AndresLARGE SCALE OPTIMIZATIONNETWORK FLOWSNON LINEAR PROGRAMMINGQUADRATIC PROGRAMMINGTRAFFIChttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1In this paper we consider the practical implementation of the disaggregated simplicial decomposition (DSD) algorithm for the traffic assignment problem. It is a column generation method that at each step has to solve a huge number of quadratic knapsack problems (QKP). We propose a Newton-like method to solve the QKP when the quadratic functional is convex but not necessarily strictly. Our O(n) algorithm does not improve the complexity of the current methods but extends them to a more general case and is better suited for reoptimization and so a good option for the DSD algorithm. It also allows the solution of many QKP's simultaneously in a vectorial or parallel way.Fil: Lotito, Pablo Andres. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil; ArgentinaElsevier Science2006-12info: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/125314Lotito, Pablo Andres; Issues in the implementation of the DSD algorithm for the traffic assignment problem; Elsevier Science; European Journal of Operational Research; 175; 3; 12-2006; 1577-15870377-2217CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S0377221705002250info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2005.02.029info: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-29T09:35:32Zoai:ri.conicet.gov.ar:11336/125314instacron: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-29 09:35:33.173CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Issues in the implementation of the DSD algorithm for the traffic assignment problem
title Issues in the implementation of the DSD algorithm for the traffic assignment problem
spellingShingle Issues in the implementation of the DSD algorithm for the traffic assignment problem
Lotito, Pablo Andres
LARGE SCALE OPTIMIZATION
NETWORK FLOWS
NON LINEAR PROGRAMMING
QUADRATIC PROGRAMMING
TRAFFIC
title_short Issues in the implementation of the DSD algorithm for the traffic assignment problem
title_full Issues in the implementation of the DSD algorithm for the traffic assignment problem
title_fullStr Issues in the implementation of the DSD algorithm for the traffic assignment problem
title_full_unstemmed Issues in the implementation of the DSD algorithm for the traffic assignment problem
title_sort Issues in the implementation of the DSD algorithm for the traffic assignment problem
dc.creator.none.fl_str_mv Lotito, Pablo Andres
author Lotito, Pablo Andres
author_facet Lotito, Pablo Andres
author_role author
dc.subject.none.fl_str_mv LARGE SCALE OPTIMIZATION
NETWORK FLOWS
NON LINEAR PROGRAMMING
QUADRATIC PROGRAMMING
TRAFFIC
topic LARGE SCALE OPTIMIZATION
NETWORK FLOWS
NON LINEAR PROGRAMMING
QUADRATIC PROGRAMMING
TRAFFIC
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv In this paper we consider the practical implementation of the disaggregated simplicial decomposition (DSD) algorithm for the traffic assignment problem. It is a column generation method that at each step has to solve a huge number of quadratic knapsack problems (QKP). We propose a Newton-like method to solve the QKP when the quadratic functional is convex but not necessarily strictly. Our O(n) algorithm does not improve the complexity of the current methods but extends them to a more general case and is better suited for reoptimization and so a good option for the DSD algorithm. It also allows the solution of many QKP's simultaneously in a vectorial or parallel way.
Fil: Lotito, Pablo Andres. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Tandil; Argentina
description In this paper we consider the practical implementation of the disaggregated simplicial decomposition (DSD) algorithm for the traffic assignment problem. It is a column generation method that at each step has to solve a huge number of quadratic knapsack problems (QKP). We propose a Newton-like method to solve the QKP when the quadratic functional is convex but not necessarily strictly. Our O(n) algorithm does not improve the complexity of the current methods but extends them to a more general case and is better suited for reoptimization and so a good option for the DSD algorithm. It also allows the solution of many QKP's simultaneously in a vectorial or parallel way.
publishDate 2006
dc.date.none.fl_str_mv 2006-12
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/125314
Lotito, Pablo Andres; Issues in the implementation of the DSD algorithm for the traffic assignment problem; Elsevier Science; European Journal of Operational Research; 175; 3; 12-2006; 1577-1587
0377-2217
CONICET Digital
CONICET
url http://hdl.handle.net/11336/125314
identifier_str_mv Lotito, Pablo Andres; Issues in the implementation of the DSD algorithm for the traffic assignment problem; Elsevier Science; European Journal of Operational Research; 175; 3; 12-2006; 1577-1587
0377-2217
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/abs/pii/S0377221705002250
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ejor.2005.02.029
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 Elsevier Science
publisher.none.fl_str_mv Elsevier Science
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_ 1844613108162625536
score 13.070432

Publicaciones similares