Column generation for the equilibrium route-flow traffic assignment problem

Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic flow assignment since a modern road network is a large-scale system with huge amounts of elements. The present paper is devoted to the route-fl...

Full description

Saved in:
Bibliographic Details
Published inAnnals of mathematics and artificial intelligence Vol. 90; no. 7-9; pp. 697 - 713
Main Author Krylatov, Alexander
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 01.09.2022
Springer
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN1012-2443
1573-7470
DOI10.1007/s10472-020-09725-z

Cover

Abstract Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic flow assignment since a modern road network is a large-scale system with huge amounts of elements. The present paper is devoted to the route-flow traffic assignment problem, which solution is the most valuable from decision-making perspectives. The paper aims to fill the gap in the relation between the column generation process and the uniqueness of the equilibrium route-flow traffic assignment pattern. The independence of routes is showed to be highly significant when travel time functions are arc-additive. Indeed, on the one hand, the independence of routes is proved to guarantee the uniqueness of the equilibrium route-flow traffic assignment pattern. On the other hand, the independence of routes appears to be crucial for column generation when solving the route-flow traffic assignment problem since the equilibrium travel time is proven to be decreased only by adding independent candidate route. Obtained results contribute to the development of algorithms for route-flow traffic assignment based on travel times equilibration procedure.
AbstractList Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic flow assignment since a modern road network is a large-scale system with huge amounts of elements. The present paper is devoted to the route-flow traffic assignment problem, which solution is the most valuable from decision-making perspectives. The paper aims to fill the gap in the relation between the column generation process and the uniqueness of the equilibrium route-flow traffic assignment pattern. The independence of routes is showed to be highly significant when travel time functions are arc-additive. Indeed, on the one hand, the independence of routes is proved to guarantee the uniqueness of the equilibrium route-flow traffic assignment pattern. On the other hand, the independence of routes appears to be crucial for column generation when solving the route-flow traffic assignment problem since the equilibrium travel time is proven to be decreased only by adding independent candidate route. Obtained results contribute to the development of algorithms for route-flow traffic assignment based on travel times equilibration procedure. Keywords Nonlinear optimization * Column generation * Traffic assignment problem * User-equilibrium of Wardrop Mathematics Subject Classification (2010) 90C30 * 90C33 * 90C35
Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic flow assignment since a modern road network is a large-scale system with huge amounts of elements. The present paper is devoted to the route-flow traffic assignment problem, which solution is the most valuable from decision-making perspectives. The paper aims to fill the gap in the relation between the column generation process and the uniqueness of the equilibrium route-flow traffic assignment pattern. The independence of routes is showed to be highly significant when travel time functions are arc-additive. Indeed, on the one hand, the independence of routes is proved to guarantee the uniqueness of the equilibrium route-flow traffic assignment pattern. On the other hand, the independence of routes appears to be crucial for column generation when solving the route-flow traffic assignment problem since the equilibrium travel time is proven to be decreased only by adding independent candidate route. Obtained results contribute to the development of algorithms for route-flow traffic assignment based on travel times equilibration procedure.
Audience Academic
Author Krylatov, Alexander
Author_xml – sequence: 1
  givenname: Alexander
  orcidid: 0000-0002-6634-1313
  surname: Krylatov
  fullname: Krylatov, Alexander
  email: aykrylatov@yandex.ru
  organization: School of Mathematics and Computer Science, Yan’an University, Saint Petersburg State University
BookMark eNp9kE1r3DAQhkVJoPn6AzkZetZ29GXZx7C0TUmgl_YstPJoo2BLiWRTur--yroQ6GHRYYR4nxnNc0nOYopIyC2DDQPQnwsDqTkFDhR6zRU9fCAXTGlBtdRwVu_AOOVSio_kspRnAOjbrr0gD9s0LlNs9hgx2zmk2PiUm_kJG3xdwhh2OSxTk9MyI_Vj-t3M2XofXGNLCfs4YZybl5x2I07X5NzbseDNv3pFfn398nN7Tx9_fPu-vXukTqhuprLdoVa2bwfvnfSDZBzEIBGVBac6ZtnQMi_U0Fovd9bCIJXQwnHFuBKgxRX5tPatc18XLLN5TkuOdaThPetqN626mtqsqb0d0YToU_25q2fAKbiqz4f6fqeZBN33SlWgWwGXUykZvXFhPiqpYBgNA_Pm2qyuTXVtjq7NoaL8P_Qlh8nmP6chsUKlhuMe8_saJ6i_DmKUfw
CitedBy_id crossref_primary_10_1016_j_trpro_2023_02_066
crossref_primary_10_1080_10556788_2023_2196725
Cites_doi 10.1016/j.cor.2014.08.024
10.1080/10556788.2017.1332621
10.1134/S1990478916020095
10.1287/trsc.7.2.168
10.3141/2090-02
10.1016/0041-1647(75)90030-1
10.1068/a160067
10.1287/trsc.26.1.4
10.6028/jres.073B.010
10.1134/S199047891801009X
10.1007/s10589-014-9668-6
10.1016/j.cor.2018.11.004
10.1016/j.trb.2014.11.002
10.1016/j.sbspro.2014.07.184
10.1177/0361198196153700115
10.1061/(ASCE)0733-947X(2007)133:4(232)
10.1007/978-3-030-34102-2
10.1007/978-3-030-53552-0_9
10.1680/ipeds.1952.11259
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Nature Switzerland AG part of Springer Nature 2021
COPYRIGHT 2022 Springer
The Author(s), under exclusive licence to Springer Nature Switzerland AG part of Springer Nature 2021.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Nature Switzerland AG part of Springer Nature 2021
– notice: COPYRIGHT 2022 Springer
– notice: The Author(s), under exclusive licence to Springer Nature Switzerland AG part of Springer Nature 2021.
DBID AAYXX
CITATION
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.1007/s10472-020-09725-z
DatabaseName CrossRef
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Student
ProQuest SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database (Proquest)
ProQuest Engineering Collection
Engineering Database (Proquest)
Advanced Technologies & Aerospace Collection
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering collection
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Computer Science Database

Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1573-7470
EndPage 713
ExternalDocumentID A714079955
10_1007_s10472_020_09725_z
GrantInformation_xml – fundername: Russian Science Foundation
  grantid: 19-71-10012
  funderid: https://doi.org/10.13039/501100006769
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
2.D
203
23M
28-
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
EBLON
EBS
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IAO
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K7-
KDC
KOV
KOW
LAK
LLZTM
M4Y
M7S
MA-
N2Q
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P9O
PF0
PT4
PT5
PTHSS
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7R
Z7X
Z81
Z83
Z88
Z92
ZMTXR
~A9
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
AEIIB
PMFND
8FE
8FG
ABRTQ
AZQEC
DWQXO
GNUQQ
JQ2
L6V
P62
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PUEGO
ID FETCH-LOGICAL-c358t-46be75a96dffc4fd41203d4ee5a0c581a1d61f35d6af4baa0d45373c251253073
IEDL.DBID BENPR
ISSN 1012-2443
IngestDate Sun Sep 07 02:40:39 EDT 2025
Tue Jun 10 21:26:00 EDT 2025
Tue Jul 01 03:19:44 EDT 2025
Thu Apr 24 23:03:44 EDT 2025
Fri Feb 21 02:46:23 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 7-9
Keywords Column generation
90C30
90C35
90C33
Nonlinear optimization
Traffic assignment problem
User-equilibrium of Wardrop
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c358t-46be75a96dffc4fd41203d4ee5a0c581a1d61f35d6af4baa0d45373c251253073
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0002-6634-1313
PQID 2918203758
PQPubID 2043872
PageCount 17
ParticipantIDs proquest_journals_2918203758
gale_infotracacademiconefile_A714079955
crossref_citationtrail_10_1007_s10472_020_09725_z
crossref_primary_10_1007_s10472_020_09725_z
springer_journals_10_1007_s10472_020_09725_z
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2022-09-01
PublicationDateYYYYMMDD 2022-09-01
PublicationDate_xml – month: 09
  year: 2022
  text: 2022-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Cham
PublicationPlace_xml – name: Cham
– name: Dordrecht
PublicationTitle Annals of mathematics and artificial intelligence
PublicationTitleAbbrev Ann Math Artif Intell
PublicationYear 2022
Publisher Springer International Publishing
Springer
Springer Nature B.V
Publisher_xml – name: Springer International Publishing
– name: Springer
– name: Springer Nature B.V
References CR19
Chao, Chenga, Xub (CR5) 2014; 138
CR18
CR17
Perederieieva, Ehrgott, Raith, Wang (CR28) 2015; 54
Krylatov (CR15) 2016; 10
Bar-Gera, Luzon (CR1) 2007; 133
Galligari, Sciandrone (CR12) 2018; 33
CR32
Nguyen (CR26) 1973
Krylatov (CR16) 2018; 12
Larsson, Patriksson (CR22) 1992; 26
Dafermos, Sparrow (CR7) 1969; 73B
Florian, Constantin, Florian (CR11) 2009; 2090
Leventhal, Nemhauser, Trotter (CR25) 1973; 7
CR6
Fisk (CR9) 1984; 16A
LeBlanc, Morlok, Pierskalla (CR24) 1975; 9
Sender, Netter (CR29) 1970
Sheffi (CR30) 1985
Fisk, Nguyen (CR10) 1980
Sun, Jayakrishnan, Tsai (CR31) 1996; 1537
Bar-Gera, Luzon (CR2) 2007; 48
Patriksson (CR27) 1994
Jayakrishnan, Tsai, Prashker, Rajadhyaksha (CR14) 1994; 1443
CR23
CR21
Galligari, Sciandrone (CR13) 2019; 103
Di Lorenzo, Galligari, Sciandrone (CR8) 2015; 60
Kumar, Peeta (CR20) 2015; 71
Beckmann, McGuire, Winsten (CR3) 1956
Bertsekas (CR4) 1999
S Chao (9725_CR5) 2014; 138
C Fisk (9725_CR10) 1980
M Florian (9725_CR11) 2009; 2090
H Bar-Gera (9725_CR2) 2007; 48
9725_CR6
T Larsson (9725_CR22) 1992; 26
9725_CR32
J Sender (9725_CR29) 1970
9725_CR17
9725_CR18
9725_CR19
C Fisk (9725_CR9) 1984; 16A
C Sun (9725_CR31) 1996; 1537
S Dafermos (9725_CR7) 1969; 73B
L LeBlanc (9725_CR24) 1975; 9
R Jayakrishnan (9725_CR14) 1994; 1443
A Krylatov (9725_CR16) 2018; 12
O Perederieieva (9725_CR28) 2015; 54
H Bar-Gera (9725_CR1) 2007; 133
A Krylatov (9725_CR15) 2016; 10
A Kumar (9725_CR20) 2015; 71
A Galligari (9725_CR12) 2018; 33
S Nguyen (9725_CR26) 1973
M Patriksson (9725_CR27) 1994
D Di Lorenzo (9725_CR8) 2015; 60
9725_CR21
Y Sheffi (9725_CR30) 1985
9725_CR23
A Galligari (9725_CR13) 2019; 103
T Leventhal (9725_CR25) 1973; 7
DP Bertsekas (9725_CR4) 1999
M Beckmann (9725_CR3) 1956
References_xml – ident: CR18
– year: 1973
  ident: CR26
  publication-title: A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138
– year: 1999
  ident: CR4
  publication-title: Nonlinear Programming, 2nd edn
– volume: 54
  start-page: 90
  year: 2015
  end-page: 107
  ident: CR28
  article-title: A framework for and empirical study of algorithms for traffic assignment
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.08.024
– volume: 33
  start-page: 354
  issue: 2
  year: 2018
  end-page: 371
  ident: CR12
  article-title: A convergent and fast path equilibration algorithm for the traffic assignment problem
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556788.2017.1332621
– volume: 10
  start-page: 243
  issue: 2
  year: 2016
  end-page: 256
  ident: CR15
  article-title: Network flow assignment as a fixed point problem
  publication-title: J. Appl. Ind. Math.
  doi: 10.1134/S1990478916020095
– ident: CR6
– volume: 7
  start-page: 168
  issue: 2
  year: 1973
  end-page: 176
  ident: CR25
  article-title: A column generation algorithm for optimal traffic assignment
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.7.2.168
– volume: 2090
  start-page: 10
  year: 2009
  end-page: 16
  ident: CR11
  article-title: A new look at projected gradient method for equilibrium assignment
  publication-title: Transp. Res. Rec.
  doi: 10.3141/2090-02
– ident: CR23
– year: 1970
  ident: CR29
  publication-title: Équilibre offre-demande et tarification sur un réseau de transport Rapport de recherche, vol. 3
– volume: 1443
  start-page: 75
  year: 1994
  end-page: 83
  ident: CR14
  article-title: A faster path-based algorithm for traffic assignment
  publication-title: Transp. Res. Rec.
– year: 1994
  ident: CR27
  publication-title: The Traffic Assignment Problem: Models and Methods
– year: 1956
  ident: CR3
  publication-title: Studies in the Economics of Transportation
– ident: CR21
– ident: CR19
– volume: 9
  start-page: 309
  year: 1975
  end-page: 318
  ident: CR24
  article-title: An efficient approach to solving the road network equilibrium traffic assignment problem
  publication-title: Transp. Res.
  doi: 10.1016/0041-1647(75)90030-1
– volume: 16A
  start-page: 67
  issue: 1
  year: 1984
  end-page: 80
  ident: CR9
  article-title: A nonlinear equation framework for solving network equilibrium problems
  publication-title: Environ. Plan.
  doi: 10.1068/a160067
– year: 1980
  ident: CR10
  publication-title: A unified approach for the solution of network equilibrium problems Publication, vol. 169
– volume: 26
  start-page: 4
  issue: 1
  year: 1992
  end-page: 17
  ident: CR22
  article-title: Simplicial decomposition with disaggregated representation for the traffic assignment problem
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.26.1.4
– year: 1985
  ident: CR30
  publication-title: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods
– ident: CR17
– volume: 73B
  start-page: 91
  issue: 2
  year: 1969
  end-page: 118
  ident: CR7
  article-title: The traffic assignment problem for a general network
  publication-title: J. Res. Natl. Bur. Stand.
  doi: 10.6028/jres.073B.010
– volume: 12
  start-page: 98
  issue: 1
  year: 2018
  end-page: 111
  ident: CR16
  article-title: Reduction of a minimization problem for a convex separable function with linear constraints to a fixed point problem
  publication-title: J. Appl. Ind. Math.
  doi: 10.1134/S199047891801009X
– ident: CR32
– volume: 60
  start-page: 151
  issue: 1
  year: 2015
  end-page: 170
  ident: CR8
  article-title: A convergent and efficient decomposition method for the traffic assignment problem
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-014-9668-6
– volume: 103
  start-page: 158
  year: 2019
  end-page: 166
  ident: CR13
  article-title: A computational study of path-based mathods for optimal traffic assignment with both inelastic and elastic demand
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.11.004
– volume: 71
  start-page: 213
  year: 2015
  end-page: 229
  ident: CR20
  article-title: Entropy weighted average method for the determination of a single representative path flow solution for the static user equilibrium traffic assignment problem
  publication-title: Transp. Res. B
  doi: 10.1016/j.trb.2014.11.002
– volume: 138
  start-page: 86
  year: 2014
  end-page: 96
  ident: CR5
  article-title: Range of user-equilibrium route flow with applications
  publication-title: Procedia – Soc. Behav. Sci.
  doi: 10.1016/j.sbspro.2014.07.184
– volume: 1537
  start-page: 106
  issue: 1
  year: 1996
  end-page: 115
  ident: CR31
  article-title: Computational study of a path-based algorithm and its variants for static traffic assignment
  publication-title: Transp. Res. Rec.
  doi: 10.1177/0361198196153700115
– volume: 133
  start-page: 232
  issue: 4
  year: 2007
  end-page: 239
  ident: CR1
  article-title: Differences among route flow solutions for the user-equilibrium traffic assignment problem
  publication-title: J. Transp. Eng.
  doi: 10.1061/(ASCE)0733-947X(2007)133:4(232)
– volume: 48
  start-page: 408
  issue: 9
  year: 2007
  end-page: 412
  ident: CR2
  article-title: Non-unique route flow solutions for user-equilibrium assignments
  publication-title: Traffic Eng. Control
– volume: 103
  start-page: 158
  year: 2019
  ident: 9725_CR13
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.11.004
– volume: 1443
  start-page: 75
  year: 1994
  ident: 9725_CR14
  publication-title: Transp. Res. Rec.
– volume: 138
  start-page: 86
  year: 2014
  ident: 9725_CR5
  publication-title: Procedia – Soc. Behav. Sci.
  doi: 10.1016/j.sbspro.2014.07.184
– volume: 10
  start-page: 243
  issue: 2
  year: 2016
  ident: 9725_CR15
  publication-title: J. Appl. Ind. Math.
  doi: 10.1134/S1990478916020095
– volume-title: A mathematical programming approach to equilibrium methods of traffic assignment with fixed demands. Publication 138
  year: 1973
  ident: 9725_CR26
– ident: 9725_CR18
  doi: 10.1007/978-3-030-34102-2
– volume-title: A unified approach for the solution of network equilibrium problems Publication, vol. 169
  year: 1980
  ident: 9725_CR10
– volume: 71
  start-page: 213
  year: 2015
  ident: 9725_CR20
  publication-title: Transp. Res. B
  doi: 10.1016/j.trb.2014.11.002
– volume: 1537
  start-page: 106
  issue: 1
  year: 1996
  ident: 9725_CR31
  publication-title: Transp. Res. Rec.
  doi: 10.1177/0361198196153700115
– ident: 9725_CR17
  doi: 10.1007/978-3-030-53552-0_9
– volume: 133
  start-page: 232
  issue: 4
  year: 2007
  ident: 9725_CR1
  publication-title: J. Transp. Eng.
  doi: 10.1061/(ASCE)0733-947X(2007)133:4(232)
– volume: 16A
  start-page: 67
  issue: 1
  year: 1984
  ident: 9725_CR9
  publication-title: Environ. Plan.
  doi: 10.1068/a160067
– ident: 9725_CR6
– volume-title: The Traffic Assignment Problem: Models and Methods
  year: 1994
  ident: 9725_CR27
– ident: 9725_CR19
– ident: 9725_CR21
– ident: 9725_CR23
– volume: 12
  start-page: 98
  issue: 1
  year: 2018
  ident: 9725_CR16
  publication-title: J. Appl. Ind. Math.
  doi: 10.1134/S199047891801009X
– volume: 2090
  start-page: 10
  year: 2009
  ident: 9725_CR11
  publication-title: Transp. Res. Rec.
  doi: 10.3141/2090-02
– volume-title: Nonlinear Programming, 2nd edn
  year: 1999
  ident: 9725_CR4
– volume: 26
  start-page: 4
  issue: 1
  year: 1992
  ident: 9725_CR22
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.26.1.4
– volume: 33
  start-page: 354
  issue: 2
  year: 2018
  ident: 9725_CR12
  publication-title: Optim. Methods Softw.
  doi: 10.1080/10556788.2017.1332621
– volume: 54
  start-page: 90
  year: 2015
  ident: 9725_CR28
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2014.08.024
– ident: 9725_CR32
  doi: 10.1680/ipeds.1952.11259
– volume-title: Studies in the Economics of Transportation
  year: 1956
  ident: 9725_CR3
– volume-title: Équilibre offre-demande et tarification sur un réseau de transport Rapport de recherche, vol. 3
  year: 1970
  ident: 9725_CR29
– volume: 48
  start-page: 408
  issue: 9
  year: 2007
  ident: 9725_CR2
  publication-title: Traffic Eng. Control
– volume: 60
  start-page: 151
  issue: 1
  year: 2015
  ident: 9725_CR8
  publication-title: Comput. Optim. Appl.
  doi: 10.1007/s10589-014-9668-6
– volume: 7
  start-page: 168
  issue: 2
  year: 1973
  ident: 9725_CR25
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.7.2.168
– volume: 9
  start-page: 309
  year: 1975
  ident: 9725_CR24
  publication-title: Transp. Res.
  doi: 10.1016/0041-1647(75)90030-1
– volume: 73B
  start-page: 91
  issue: 2
  year: 1969
  ident: 9725_CR7
  publication-title: J. Res. Natl. Bur. Stand.
  doi: 10.6028/jres.073B.010
– volume-title: Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods
  year: 1985
  ident: 9725_CR30
SSID ssj0009686
Score 2.298352
Snippet Today efficient traffic management seems to be impossible without the support of the artificial intelligence systems based on mathematical models of traffic...
SourceID proquest
gale
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 697
SubjectTerms Algorithms
Analysis
Artificial Intelligence
Assignment problem
Complex Systems
Computer Science
Equilibrium
Mathematics
Operations research
Roads & highways
Time functions
Traffic assignment
Traffic flow
Traffic management
Traffic models
Travel time
Uniqueness
SummonAdditionalLinks – databaseName: SpringerLink Journals (ICM)
  dbid: U2A
  link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LS8QwEIAHHxc9-BbXFzkIHjTQNEm7PS6iiKInF7yFNA8RdFf3gbC_3kxMXd_guWkSZjLJhMx8A3DAqlozWxoqa-GpkJWj2lWMVoVn2sqwpGyMtrguzrvi4lbepqSwYRPt3jxJxp36Q7KbKHOK1x1Ezkg6mYV5Ge7uaI7dvDNF7RaxviOCq2g4vHhKlfm5j0_H0ddN-dvraDx0zlZgKXmLpPOm3lWYcb01WG4qMZBkmGuwePVOXx2uw-UJbjk9cheR0ih5ElxTEloQ9zy-j1H-40cy6IdOqH_ov5DRQCNKggRP-v4uxgeQVGlmA7pnpzcn5zQVTaCGy_aIiqJ2pdRVYb03wlvB8oxb4ZzUmZFtFjRTMM-lLbQXtdaZFZKX3KCfI9HgN2Gu1--5LSA897Uu68x6Gy4dsl2VnBvEFliTGebyFrBGdsokojgWtnhQUxYyylsFeasobzVpwdH7P09vPI0_Wx-iShQaW-jZ6JQzEOaH2CrVQdwgIu1kC3YbralkhUOVV4in52HqLThuNDn9_Pu42_9rvgMLOWZFxNCzXZgbDcZuL_gqo3o_Ls1XXyXf_A
  priority: 102
  providerName: Springer Nature
Title Column generation for the equilibrium route-flow traffic assignment problem
URI https://link.springer.com/article/10.1007/s10472-020-09725-z
https://www.proquest.com/docview/2918203758
Volume 90
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV1LbxMxEB61zQUOPAqI0BL5gMQBLOK1vY8DQqFKWlERIUSkcrK8flSVStKmiSr11zPjehsBotddr3c1L4_XM98H8EY0rRW-cly3KnKlm8BtaARvyiis12hSPlVbTMujmfpyok-2YNr1wlBZZRcTU6D2C0f_yD8UDUGNS0xvP11ccmKNotPVjkLDZmoF_zFBjG1DD0NyjXbf-zyefvu-geEtE_cjgVpxXNhkbqPJzXSqKjhtpwjSRvObP5aqvwP2PyenaUGaPIFHOZNko1vVP4WtMN-Fxx1LA8tOuwsPv94hs149g-MDCkdzdprgpkkrDNNWhiNYuFyfpQ6A9S-2XOAkPJ4vrtlqaQlmgmGWfXaaagdYZqF5DrPJ-MfBEc-ECtxJXa-4KttQaduUPkanolcCJepVCNoOna4Faq0UUWpf2qhaa4deaVlJRzmQpmDwAnbmi3l4CUwWsbVVO_TR44ZE100lpSNIA--GToSiD6KTnXEZbZxIL87NBieZ5G1Q3ibJ29z04d3dMxe3WBv3jn5LKjHkiDizs7mfAL-PIK3MiKAICe5O92G_05rJHnplNvbUh_edJje3___eV_fPtgcPCuqQSGVo-7CzWq7Da8xbVu0AtuvJ4QB6o8Ofx-NBNk28OitGvwE-B-yL
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwEB7R5UB7AEpbdSmlPoB6aK2uYzvZHBCiPLSwsKoqkLi5jh8Iie7CPoTKj-O34TEOq7aCG-c4k2RmPB7HM98HsMbKSjNbGCor4amQpaPalYyWuWfayuBSNlZb9PLOiTg4laczcFv3wmBZZR0TY6C2A4P_yL9lJUKN85Debl5eUWSNwtPVmkJDJ2oFuxEhxlJjR9f9uQ5buNHG_k6w93qW7e0eb3doYhmghsv2mIq8coXUZW69N8JbwcJjrHBO6paRbRY-JWeeS5trLyqtW1ZIXnCDiYHEGRLkvoBZgR2uDZj9vtv78XMK-5tHrkkE0aJhIeWpbSc174kio7h9QwgdSW_-Whr_XSD-O6mNC-DeIsynzJVs3bvaa5hx_SVYqFkhSAoSS_Dq6AEJdvQGutsY_vrkLMJboxeQkCaTMIK4q8l57DiY_CbDQRBC_cXgmoyHGmEtSMjqz89irQJJrDdv4eRZVPsOGv1B370HwjNf6aJqWW_DBki2y4JzgxAK1rQMc1kTWK07ZRK6OZJsXKgpLjPqWwV9q6hvddOELw_3XN5jezw5-jOaROHED5KNTv0L4f0QQkttIfQhwuvJJqzUVlMpIozU1H-b8LW25PTy489dflraJ5jrHB8dqsP9XvcDvMywOyOWwK1AYzycuI8hZxpXq8kxCfx67rlwB3RvJh4
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ1LT9wwEIBHFCRUDtDSIpZH60MlDtQiju1kc1wBK1pa1AMrcbMcP1ZIkIUlKyR-PR5vwvKsxDmObc147LE88w3AD1aUmtncUFkKT4UsHNWuYLTIPNNWhiVlY7TFSXY0EL_P5NmjLP4Y7d4-SU5zGpDSVNV7V9bvPUp8E3lK8eqD-BlJ7z7AQtiOGa70QdqbYXezWOsRIVY0HGS8SZt5vY8nR9PzDfrFS2k8gPqfYLnxHElvqurPMOeqVVhpqzKQxkhXYenvA4n15gsc7-P2U5FhxEujFkhwU0loQdz15DxG_E8uyXgUOqH-YnRL6rFGrAQJXvX5MMYKkKbqzFcY9A9P949oU0CBGi67NRVZ6XKpi8x6b4S3gqUJt8I5qRMjuyxoKWOeS5tpL0qtEyskz7lBn0ei8a_BfDWq3DoQnvpS52VivQ0XENktcs4NIgysSQxzaQdYKztlGro4Frm4UDMuMspbBXmrKG9114Hdh3-upmyN_7beQZUoNLzQs9FN_kCYHyKsVA_Rg4i3kx3YarWmGou8UWmBqHoept6Bn60mZ5_fHnfjfc2_w-K_g7768-vkeBM-ppgsESPStmC-Hk_cdnBh6vJbXKX3RHXnKw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Column+generation+for+the+equilibrium+route-flow+traffic+assignment+problem&rft.jtitle=Annals+of+mathematics+and+artificial+intelligence&rft.au=Krylatov%2C+Alexander&rft.date=2022-09-01&rft.pub=Springer+Nature+B.V&rft.issn=1012-2443&rft.eissn=1573-7470&rft.volume=90&rft.issue=7-9&rft.spage=697&rft.epage=713&rft_id=info:doi/10.1007%2Fs10472-020-09725-z
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1012-2443&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1012-2443&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1012-2443&client=summon