Least Expected Time Paths in Stochastic Schedule-Based Transit Networks

<div>Average number of nondominated paths generated by the LET-Path algorithm with different subsets of <svg height="9.46864pt" id="M752" style="vertical-align:-0.54566pt" version="1.1" viewbox="-0.0498162 -8.92298 9.12938 9.46864" width="9.12938pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M663 549C663 621 607 680 521 680C283 680 82 444 82 188C82 80 142 -15 258 -15C311 -15 361 -1 408 23C428 -8 451 -38 500 -38C535 -38 584 -16 633 44L618 58C582 23 543 10 516 10C485 10 469 28 454 52C564 133 637 268 637 396C637 502 561 542 497 542C414 542 336 469 336 362C336 331 339 284 371 232L393 242C369 289 366 322 366 347C366 448 430 506 494 506C539 506 586 470 586 396C586 266 508 157 469 118C458 106 446 97 435 86C418 115 396 142 349 142C313 142 284 123 241 84L254 67C283 90 305 96 330 96C359 96 375 77 390 53C350 29 307 15 256 15C179 15 142 78 142 150C142 331 347 645 517 645C590 645 624 603 643 547L663 549Z" id="g198-18"></path><glyph.data ascent="687" descent="-226" horiz-adv-x="692" vert-adv-y="692"></glyph.data></g></svg> per <svg height="6.1673pt" id="M753" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -5.96091 6.20645 6.1673" width="6.20645pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M445 282C445 390 384 448 297 448C266 448 231 437 189 418C96 376 23 279 23 151C23 65 66 -12 169 -12C233 -12 294 18 337 53C411 113 445 201 445 282ZM355 280C355 161 302 62 243 36C231 31 219 30 207 30C147 30 111 78 111 154C111 302 180 380 220 399C231 404 246 407 264 407C311 407 355 367 355 280Z" id="g113-112"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="468" vert-adv-y="468"></glyph.data></g></svg>-<svg height="9.49473pt" id="M754" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 7.34169 9.49473" width="7.34169pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M530 686C535 705 530 712 521 712C504 712 448 684 359 674L358 648H393C437 648 439 646 429 593L400 435C372 447 345 448 332 448C286 448 194 414 144 373C68 311 23 203 23 111C23 26 57 -12 91 -12C120 -12 147 3 188 29C227 54 290 102 341 170H343L322 71C308 6 320 -12 341 -12C373 -12 442 27 501 96L485 120C455 91 422 67 408 67C401 67 401 76 404 91C440 294 479 473 530 686ZM387 375L355 241C326 187 200 53 142 53C126 53 109 73 109 130C109 217 154 337 218 381C240 396 265 404 297 404S372 390 387 375Z" id="g113-101"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="555" vert-adv-y="555"></glyph.data></g></svg> pair.</div>

Mathematical Problems in Engineering

fig8

Figure 8

Figure 8: Least Expected Time Paths in Stochastic Schedule-Based Transit Networks 