Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem A Computational Study
The multiclass percentile user equilibrium (MCPUE) problem discussed in this paper assumes that travelers, subject to uncertainty in a transportation network, strive to minimize reserved travel time (also known as the travel time budget) to ensure a probability of arriving at their destinations on t...
Saved in:
| Published in | Transportation research record Vol. 2334; no. 1; pp. 75 - 83 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Los Angeles, CA
SAGE Publications
01.01.2013
|
| Subjects | |
| Online Access | Get full text |
| ISBN | 9780309287074 0309287073 |
| ISSN | 0361-1981 2169-4052 |
| DOI | 10.3141/2334-08 |
Cover
| Abstract | The multiclass percentile user equilibrium (MCPUE) problem discussed in this paper assumes that travelers, subject to uncertainty in a transportation network, strive to minimize reserved travel time (also known as the travel time budget) to ensure a probability of arriving at their destinations on time. An MCPUE, defined as an extension of the Wardrop equilibrium in a probabilistic network, is achieved when no travelers, regardless of their preferred on-time arrival probability, can reduce their reserved travel time by unilaterally changing their routes. Efficient numerical procedures for computing the MCPUE are studied in this paper. Specifically, a proposed new gradient projection algorithm avoids path enumeration through a column generation procedure based on a reliable shortest path algorithm. Implementation details of inner iterations, which are critical to the overall efficiency of the algorithm, are also discussed. Numerical experiments are conducted to test the computational performance of the proposed algorithm. |
|---|---|
| AbstractList | The multiclass percentile user equilibrium (MCPUE) problem discussed in this paper assumes that travelers, subject to uncertainty in a transportation network, strive to minimize reserved travel time (also known as the travel time budget) to ensure a probability of arriving at their destinations on time. An MCPUE, defined as an extension of the Wardrop equilibrium in a probabilistic network, is achieved when no travelers, regardless of their preferred on-time arrival probability, can reduce their reserved travel time by unilaterally changing their routes. Efficient numerical procedures for computing the MCPUE are studied in this paper. Specifically, a proposed new gradient projection algorithm avoids path enumeration through a column generation procedure based on a reliable shortest path algorithm. Implementation details of inner iterations, which are critical to the overall efficiency of the algorithm, are also discussed. Numerical experiments are conducted to test the computational performance of the proposed algorithm. |
| Author | Nie, Yu (Marco) Wu, Xing |
| Author_xml | – sequence: 1 givenname: Xing surname: Wu fullname: Wu, Xing email: xing.wu@lamar.edu – sequence: 2 givenname: Yu (Marco) surname: Nie fullname: Nie, Yu (Marco) |
| BookMark | eNpt0E9LwzAYBvCgE5xz-BVyEPRSTZq0aY5jzD_gcOB2LmmazEjabEkq-O3NmCf1vbyXHw88zwUY9a5XAFxhdEcwxfc5ITRD1QkY57jkGUVFfgqmnFWIIJ5XDDE6AmNESpxhXuFzMA3BNIhSXlLK8jFYvjn7afotjO8KLgcbjbQiBLhSXqo-GqvgJigPF_vBWNN4M3Rw7YXWRsJZytr2XWJw5V1jVXcJzrSwQU1__gRsHhbr-VP28vr4PJ-9ZDKnRcy0lqjEjOeCsYZz3iKliG7bopSiZYyKggvKRF61LamaFjEpWNGkArThpS4KMgG3x9ydd_tBhVh3JkhlreiVG0KNi1Q_HSOJZkcqvQvBK11LE0U0ro9eGFtjVB-WrA9L1qhK_uaX33nTCf_1j7w-yiC2qv5wg-9T5z_sG_5kfSg |
| CitedBy_id | crossref_primary_10_1080_15472450_2017_1358624 crossref_primary_10_1016_j_trc_2022_103866 crossref_primary_10_1080_23249935_2024_2396921 crossref_primary_10_1007_s11067_020_09498_2 crossref_primary_10_1016_j_oceaneng_2019_106790 crossref_primary_10_1080_15472450_2017_1326116 crossref_primary_10_1016_j_cor_2022_105723 crossref_primary_10_1016_j_trb_2018_06_003 crossref_primary_10_1016_j_ejor_2016_08_019 crossref_primary_10_1016_j_trb_2015_07_009 |
| Cites_doi | 10.1109/TAC.1976.1101194 10.1007/s11067-006-9279-6 10.1016/j.trb.2009.11.003 10.1007/978-1-4419-0820-9_2 10.1287/trsc.11.3.253 10.1177/0361198106198500124 10.1680/ipeds.1952.11259 10.3141/2091-06 10.1002/atr.5670420304 10.1016/j.ejor.2005.02.039 10.1287/opre.28.5.1122 10.1016/j.trb.2009.01.008 10.1145/358172.358406 10.1016/j.trb.2008.02.004 10.1016/j.mcm.2011.04.015 10.1016/j.trb.2011.06.001 10.1007/s10107-003-0396-4 10.1287/opre.17.4.583 10.1016/S0305-0548(98)00027-6 10.3141/2263-10 10.1016/0041-1647(71)90012-8 10.1016/S0305-0548(97)00085-3 10.1016/S0191-2615(02)00017-6 10.1016/j.trc.2004.07.009 10.1016/0305-0548(76)90017-4 10.1287/mnsc.37.2.198 10.1287/trsc.21.3.133 10.1016/j.trb.2005.10.003 |
| ContentType | Journal Article |
| Copyright | 2013 National Academy of Sciences |
| Copyright_xml | – notice: 2013 National Academy of Sciences |
| DBID | AAYXX CITATION 8FD FR3 KR7 |
| DOI | 10.3141/2334-08 |
| DatabaseName | CrossRef Technology Research Database Engineering Research Database Civil Engineering Abstracts |
| DatabaseTitle | CrossRef Technology Research Database Civil Engineering Abstracts Engineering Research Database |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-4052 |
| EndPage | 83 |
| ExternalDocumentID | 10_3141_2334_08 10.3141_2334-08 |
| GroupedDBID | -TM -~X 0R~ 4.4 54M 5WW AADUE AAGGD AAGLT AAHPS AAPEO AAQXI AARIX AATAA AAULN AAWLO AAYOK AAZLU ABCCA ABCQX ABDEX ABFXH ABIDT ABKRH ABPNF ABQPY ABRHV ABUJY ABYTW ACCVJ ACDXX ACFZE ACGFS ACJER ACKIV ACOFE ACOXC ACSIQ ACUFS ACUIR ADEBD ADEIA ADPEE ADRRZ ADUKL AEDFJ AEDXQ AENEX AESZF AEWDL AEWHI AEXNY AFKRG AFMOU AFQAA AFUIA AGDVU AGKLV AGNHF AGNWV AHDMH AHHCN AHWHD AIZZC AJUZI AKSRI ALMA_UNASSIGNED_HOLDINGS ARTOV AYPQM BPACV CBRKF CCGJY CEADM DH. DOPDO DU5 DV7 DV8 EBS EJD F5P FHBDP GROUPED_SAGE_PREMIER_JOURNAL_COLLECTION H13 H~9 J8X K-O L7B MET MFT P2P Q1R SAFTQ SAUOL SCNPE SFC TN5 Y4B ZPLXX ZPPRI ZY4 ~02 ~32 AAYXX ACCVC AJGYC AMNSR CITATION 8FD AAPII AJHME AJVBE FR3 KR7 |
| ID | FETCH-LOGICAL-c245t-ffc061792a77b999d0ee3fdd56cad774a59a47a28dd38bd07ca75b1984b96f553 |
| ISBN | 9780309287074 0309287073 |
| ISSN | 0361-1981 |
| IngestDate | Sun Aug 24 03:56:55 EDT 2025 Tue Jul 01 05:25:05 EDT 2025 Thu Apr 24 23:08:12 EDT 2025 Tue Jun 17 22:37:53 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c245t-ffc061792a77b999d0ee3fdd56cad774a59a47a28dd38bd07ca75b1984b96f553 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 1530999973 |
| PQPubID | 23500 |
| PageCount | 9 |
| ParticipantIDs | proquest_miscellaneous_1530999973 crossref_citationtrail_10_3141_2334_08 crossref_primary_10_3141_2334_08 sage_journals_10_3141_2334_08 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 20130100 2013-01-00 20130101 |
| PublicationDateYYYYMMDD | 2013-01-01 |
| PublicationDate_xml | – month: 1 year: 2013 text: 20130100 |
| PublicationDecade | 2010 |
| PublicationPlace | Los Angeles, CA |
| PublicationPlace_xml | – name: Los Angeles, CA |
| PublicationTitle | Transportation research record |
| PublicationYear | 2013 |
| Publisher | SAGE Publications |
| Publisher_xml | – name: SAGE Publications |
| References | Loui 1983; 26 Nie, Wu 2009; 43 Shao, Lam, Tam 2006; 6 Lo, Siu 2006; 40 Nie, Wu, Nelson, Dillenburg 2012; 46 Wardrop 1952; 1 Yu, Yang 1998; 25 Chen, Lam, Sumalee, Shao 2011; 54 Mirchandani, Soroush 1987; 21 Daganzo, Sheffi 1977; 11 Frank 1969; 17 Lo, Tung 2003; 37 Sigal, Alan, Pritsker, Solberg 1980; 28 Nie 2011; 45 Bertsimas, Sim 2003; 98 Yin, Lam, Ieda 2004; 12 Mirchandani 1976; 3 Zhou, Chen 2008; 42 Miller-Hooks, Mahmassani 1998; 25 Chen, Zhou 2010; 44 Bard, Bennett 1991; 37 Dial 1971; 5 Bertsekas 1976; AC-21 Walting 2006; 175 Lam, Shao, Sumalee 2008; 42 Wu X. (bibr33-2334-08) 2011 bibr19-2334-08 bibr31-2334-08 bibr32-2334-08 bibr30-2334-08 bibr13-2334-08 bibr1-2334-08 bibr12-2334-08 bibr25-2334-08 bibr11-2334-08 Jayakrishnan R. (bibr29-2334-08) 1994 bibr2-2334-08 bibr3-2334-08 bibr4-2334-08 bibr27-2334-08 bibr10-2334-08 bibr24-2334-08 Nie Y. (bibr26-2334-08) 2012; 46 bibr28-2334-08 bibr23-2334-08 bibr14-2334-08 bibr5-2334-08 bibr7-2334-08 bibr15-2334-08 bibr22-2334-08 bibr16-2334-08 bibr6-2334-08 bibr9-2334-08 bibr21-2334-08 bibr17-2334-08 bibr18-2334-08 bibr8-2334-08 bibr20-2334-08 |
| References_xml | – volume: 37 start-page: 345 issue: 4 year: 2003 end-page: 363 article-title: Network with Degradable Links: Capacity Analysis and Design publication-title: Transportation Research Part B – volume: 42 start-page: 239 year: 2008 end-page: 263 article-title: Comprehensive Analysis of Three User Equilibrium Models Under Stochastic Demand publication-title: Journal of Advanced Transportation – volume: AC-21 start-page: 174 year: 1976 end-page: 184 article-title: On the Goldstein–Lvitin–Poljak Gradient Projection Method publication-title: IEEE Transactions on Automatic Control – volume: 3 start-page: 347 year: 1976 end-page: 355 article-title: Shortest Distance and Reliability of Probabilistic Networks publication-title: Computers and Operations Research – volume: 25 start-page: 1107 year: 1998 end-page: 1125 article-title: Least Possible Time Paths in Stochastic Time-Varying Networks publication-title: Computers and Operations Research – volume: 26 start-page: 670 year: 1983 end-page: 676 article-title: Optimal Paths in Graphs with Stochastic or Multidimensional Weights publication-title: Communications of the Association for Computing Machinery – volume: 42 start-page: 890 year: 2008 end-page: 910 article-title: Modeling Impacts of Adverse Weather Conditions on a Road Network with Uncertainties in Demand and Supply publication-title: Transportation Research Part B – volume: 37 start-page: 198 year: 1991 end-page: 215 article-title: Arc Reduction and Path Preference in Stochastic Acyclic Networks publication-title: Management Science – volume: 40 start-page: 792 year: 2006 end-page: 806 article-title: Degradable Transport Network: Travel Time Budget of Travelers with Heterogeneous Risk Aversion publication-title: Transportation Research Part B – volume: 17 start-page: 583 year: 1969 end-page: 599 article-title: Shortest Paths in Probabilistic Graphs publication-title: Operations Research – volume: 21 start-page: 133 issue: 3 year: 1987 end-page: 152 article-title: Generalized Traffic Equilibrium with Probabilistic Travel Times and Perceptions publication-title: Transportation Science – volume: 25 start-page: 457 year: 1998 end-page: 468 article-title: On the Robust Shortest Path Problem publication-title: Computers and Operations Research – volume: 5 start-page: 83 issue: 2 year: 1971 end-page: 111 article-title: A Probabilistic Multipath Assignment Model That Obviates Path Enumeration publication-title: Transportation Research – volume: 45 start-page: 1641 year: 2011 end-page: 1659 article-title: Multi-Class Percentile User Equilibrium Traffic Assignment with Flow-Dependent Stochasticity publication-title: Transportation Research Part B – volume: 43 start-page: 597 year: 2009 end-page: 613 article-title: Shortest Path Problem Considering On-Time Arrival Probability publication-title: Transportation Research Part B – volume: 11 start-page: 253 issue: 3 year: 1977 end-page: 274 article-title: On Stochastic Models of Traffic Assignment publication-title: Transportation Science – volume: 28 start-page: 1122 year: 1980 end-page: 1129 article-title: The Stochastic Shortest Route Problem publication-title: Operations Research – volume: 44 start-page: 493 year: 2010 end-page: 513 article-title: The α-Reliable Mean-Excess Traffic Equilibrium Model with Stochastic Travel Times publication-title: Transportation Research Part B – volume: 6 start-page: 173 year: 2006 end-page: 204 article-title: A Reliability-Based Stochastic Traffic Assignment Model for Network with Multiple User Classes Under Uncertainty in Demand publication-title: Network Spatial Economics – volume: 175 start-page: 1539 year: 2006 end-page: 1556 article-title: User Equilibrium Traffic Network Assignment with Stochastic Travel Time and Late Arrival Penalty publication-title: European Journal of Operational Research – volume: 54 start-page: 1428 year: 2011 end-page: 1439 article-title: An Efficient Solution Algorithm for Solving Multi-Class Reliability-Based Traffic Assignment Problem publication-title: Mathematical and Computer Modeling – volume: 1 start-page: 325 year: 1952 end-page: 378 article-title: Some Theoretical Aspects of Road Traffic Research publication-title: Proceedings of the Institute of Civil Engineers – volume: 46 start-page: 403 year: 2012 end-page: 419 article-title: Reliable Route Guidance: A Case Study from Chicago publication-title: Transportation Research Part A – volume: 12 start-page: 171 year: 2004 end-page: 192 article-title: New Technology and the Modeling of Risk-Taking Behavior in Congested Road Networks publication-title: Transportation Research Part C – volume: 98 start-page: 49 year: 2003 end-page: 71 article-title: Robust Discrete Optimization and Network Flow publication-title: Mathematical Programming Series B – ident: bibr28-2334-08 doi: 10.1109/TAC.1976.1101194 – ident: bibr12-2334-08 doi: 10.1007/s11067-006-9279-6 – ident: bibr5-2334-08 doi: 10.1016/j.trb.2009.11.003 – ident: bibr15-2334-08 doi: 10.1007/978-1-4419-0820-9_2 – ident: bibr2-2334-08 doi: 10.1287/trsc.11.3.253 – ident: bibr11-2334-08 doi: 10.1177/0361198106198500124 – ident: bibr1-2334-08 doi: 10.1680/ipeds.1952.11259 – ident: bibr31-2334-08 doi: 10.3141/2091-06 – ident: bibr4-2334-08 doi: 10.1002/atr.5670420304 – ident: bibr27-2334-08 doi: 10.1016/j.ejor.2005.02.039 – ident: bibr18-2334-08 doi: 10.1287/opre.28.5.1122 – volume-title: Routing and Traffic Assignment in Stochastic Networks. year: 2011 ident: bibr33-2334-08 – ident: bibr23-2334-08 doi: 10.1016/j.trb.2009.01.008 – ident: bibr19-2334-08 doi: 10.1145/358172.358406 – ident: bibr13-2334-08 doi: 10.1016/j.trb.2008.02.004 – ident: bibr14-2334-08 doi: 10.1016/j.mcm.2011.04.015 – ident: bibr30-2334-08 – ident: bibr6-2334-08 doi: 10.1016/j.trb.2011.06.001 – ident: bibr21-2334-08 doi: 10.1007/s10107-003-0396-4 – ident: bibr24-2334-08 doi: 10.1287/opre.17.4.583 – ident: bibr22-2334-08 doi: 10.1016/S0305-0548(98)00027-6 – ident: bibr32-2334-08 doi: 10.3141/2263-10 – ident: bibr7-2334-08 doi: 10.1016/0041-1647(71)90012-8 – ident: bibr20-2334-08 doi: 10.1016/S0305-0548(97)00085-3 – ident: bibr10-2334-08 doi: 10.1016/S0191-2615(02)00017-6 – ident: bibr17-2334-08 doi: 10.1016/j.trc.2004.07.009 – ident: bibr25-2334-08 doi: 10.1016/0305-0548(76)90017-4 – volume: 46 start-page: 403 year: 2012 ident: bibr26-2334-08 publication-title: Transportation Research Part A – ident: bibr16-2334-08 doi: 10.1287/mnsc.37.2.198 – ident: bibr8-2334-08 doi: 10.1287/trsc.21.3.133 – start-page: 75 volume-title: Transportation Research Record 1443 year: 1994 ident: bibr29-2334-08 – ident: bibr3-2334-08 doi: 10.1016/j.trb.2005.10.003 – ident: bibr9-2334-08 |
| SSID | ssib044964472 ssib031724273 ssj0033473 ssib053395398 |
| Score | 2.052141 |
| Snippet | The multiclass percentile user equilibrium (MCPUE) problem discussed in this paper assumes that travelers, subject to uncertainty in a transportation network,... |
| SourceID | proquest crossref sage |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 75 |
| SubjectTerms | Algorithms Budgeting Computation Computer networks Networks Projection Traffic engineering Traffic flow |
| Subtitle | A Computational Study |
| Title | Solving the Multiclass Percentile User Equilibrium Traffic Assignment Problem |
| URI | https://journals.sagepub.com/doi/full/10.3141/2334-08 https://www.proquest.com/docview/1530999973 |
| Volume | 2334 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwELYQXNpDRV8qBSpXQr2g0E1sx_ERISpUaRGorLScothOWiS6C-yGA7--M34kYYvUxyVaRYmT9XzxfDOeByF7Ok0BNzJPrM6LBDS-SQrGYTHMK2mUBE7uyjWNT_OTCf86FdPY7z5klyz1gXl4Mq_kf6QK50CumCX7D5LtBoUT8BvkC0eQMBz_Ssbf5tf3Md3JZdIa5MIY1Y4xl_C9708WGMRx21650P72JxYzx6IRKJar7z4S4Mz3lBnS1K7kuYdHqAj0Y9-7dLqFvEUBTaPyc7sbzj962SJxHcMt8-hpCI4FbPLQORZiQlWapMp3VDmo3bkszRWYnOLRApqx4I8cQsWvh74rStSs7Kk1m6XcpaXAIMmo6NVS3Ipf0VZdDCFYL3hriTeWmO69kUmJO_Ubh5dn553LBvgRsJCeo3GugAL2ycJAd5VwNRC9-obRfFhC_Pc-0xof9Tm842MK09slg1BAx04uNsmLYFbQQ4-Rl2Stnr0izwfFJl-TcUALBbTQHi20RwtFtNABWmhAC-3RQgNa3pDJl-OLo5MkNNNITMbFMmkag2xVZZWUGqwCO6pr1lgrclNZsAEqoSouq6ywlhXajqSppNAwAVyrvBGCvSXrs_msfkeoaGqpVAOWzghLIwGjbZhlmnEN3D9nbIt8ivNTmlBpHhueXJcrMtsitLvwxhdX-f2Sj3GCS1j4cDermtXzdlGCqkbrRkl43i7OfBm-zMXqGO___Jht8qz_BHbI-vKurXeBbS71h4CnX_Q_d_4 |
| linkProvider | SAGE Publications |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8MwDLbQOAAH3ogBgyAhboW2SZrmOKFN4zE0BJPgVDVNiyZGx6O98Otx-mADDohzo6RxHPtLYn8GOFKOg3ojPEsrz7fQ40eWTxkaQy8UkRSIyQu6pv611xuyi3t-Pwd2nQtTSfD9xIRV4R8Vxrra3dRhzqlLKbNMdu-8b6hoGjDffhjcfJ3Q0R2i05m6ZMYkevxpbiiiG8kLyrvSWmNv5Ss09RwLD-BOmVg7O9R3jzWFoTORX4Uz6q7ATT2NMgbl6STPcAYfPxge_zPPVViukClpl6q0BnNxug5LM3yFG9C_nYzNBQRB1EiK1N3IgG8yMNExaYYGhgxRpUnnNR8VuQT5M0FnaFgqCOrB6LEIPSCDsojNJgy7nbuznlXVY7Ail_HMSpLIAB7phkIoBJbajmOaaM29KNQII0MuQyZC19ea-krbIgoFVyhUpqSXcE63oJFO0ngbCE9iIWWCYNk27DoIihKqqaJMIXz0KG3CcS3zIKrIyk3NjHGAhxYjn8DIJ7D9JpCvhi8lP8fvJof1ogW4d8yDSJjGk_w9QGtvALIUOF7LLERQL8vPPnb--H4AC727_lVwdX59uQuLblEzw9zT7EEje8vjFiKXTO1XyvoJPm7hTQ |
| linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVQkRAc2BFlNRLilpLEdhwfEVCxqwgqlVMUxwmqKClLcuHrmXFSWuCAOMey4_F43rM9CyH72vNAb2TgGB2EDiB-4oSMgzEMYpkoCZzcpmu6vgnOuvyiJ3p1UBjGwtQSfG-hWxX8kTXWuLtfTHZoj5jcO_QZ4w5G-E4DPLl-g0wfPXRuv07pAIkAPGNY5lwB6o_jQ4HhKGHT3lUWG3qrXqJZ4DlwCPeq4NrJob6j1piKTnh_WUBqL5DuaCqVH8pTqyxgFh8_sjz-d66LZL5mqPSoUqklMpXmy2RuIm_hCrm-Gw7wIoICe6Q2hDdBEk476CWTF2BoaBdUm56-ln0bU1A-UwBFzFZBQR_6j9YFgXaqYjarpNs-vT8-c-q6DE7ic1E4WZYg8VF-LKUGgmncNGWZMSJIYgN0MhYq5jL2Q2NYqI0rk1gKDYLlWgWZEGyNNPJhnq4TKrJUKpUBaXYxyw6Qo4wZphnXQCMDxprkYCT3KKmTlmPtjEEEhxeUT4TyidywSehXw5cqT8fvJnujhYtgD-HDSJynw_I9AquPRFlJGG8bFyMaLc3PPjb--L5LZjon7ejq_OZyk8z6tnQGXtdskUbxVqbbQGAKvVPr6yej6OPC |
| 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=Solving+the+Multiclass+Percentile+User+Equilibrium+Traffic+Assignment+Problem&rft.jtitle=Transportation+research+record&rft.au=Wu%2C+Xing&rft.au=Nie%2C+Yu+%28Marco%29&rft.date=2013-01-01&rft.issn=0361-1981&rft.eissn=2169-4052&rft.volume=2334&rft.issue=1&rft.spage=75&rft.epage=83&rft_id=info:doi/10.3141%2F2334-08&rft.externalDBID=n%2Fa&rft.externalDocID=10_3141_2334_08 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0361-1981&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0361-1981&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0361-1981&client=summon |