A Day-to-Day Route Choice Model Based on Reinforcement Learning

<table>Travel time evolution with different <svg height="9.89089pt" id="M231" style="vertical-align:-0.2129898pt" version="1.1" viewbox="-0.0498162 -9.6779 3.75774 9.89089" width="3.75774pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M238 681C243 705 239 712 230 712C217 712 156 682 75 674L70 648H105C148 648 153 641 144 598L39 110C18 11 35 -12 55 -12C90 -12 166 36 221 103L205 125C174 93 130 65 118 65C112 65 108 68 114 96L238 681Z" id="g113-109"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="269" vert-adv-y="269"></glyph.data></g></svg>-value when <svg height="12.2707pt" id="M232" style="vertical-align:-3.57194pt" version="1.1" viewbox="-0.0498162 -8.69876 40.7016 12.2707" width="40.7016pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M642 419L635 448C586 435 552 411 532 392C518 379 509 351 496 304C484 260 462 196 445 150C424 93 388 40 314 30L413 508L406 510L344 491L257 36C205 46 175 84 175 169C175 195 180 241 185 277C189 304 190 331 190 358C190 413 175 448 141 448C111 448 69 429 23 373L30 347C51 365 68 375 81 375C93 375 108 368 108 327C108 307 104 268 101 239C98 211 95 180 95 155C95 33 159 -8 248 -14L213 -186C206 -220 221 -254 230 -261L261 -230L306 -11C339 -4 366 6 389 20C431 46 473 87 503 155C533 224 557 286 571 325C586 367 606 393 642 419Z" id="g113-245"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="654" vert-adv-y="654"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,12.648,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z" id="g117-34"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="587" vert-adv-y="587"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,24.386,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,30.889,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z" id="g113-47"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="228" vert-adv-y="228"></glyph.data></g><g transform="matrix(.0135,0,0,-0.0135,33.978,0)"><path d="M137 343C167 482 260 545 321 574C357 591 397 603 429 609L423 641C382 634 335 622 295 608C189 570 37 457 37 238C37 84 125 -12 242 -12C362 -12 447 89 447 209C447 311 374 393 267 393C247 393 226 386 204 376L137 343ZM227 337C318 337 361 256 361 173C361 105 336 22 258 22C176 22 126 120 126 240C126 266 127 291 132 310C155 323 189 337 227 337Z" id="g113-55"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="480" vert-adv-y="480"></glyph.data></g></svg>.</table>

Mathematical Problems in Engineering

A Day-to-Day Route Choice Model Based on Reinforcement Learning

Figure 17