A Line Planning Approach for High-Speed Rail Networks with Time-Dependent Demand and Capacity Constraints

<div>Space-time diagram of trains in <svg height="14.0461pt" id="M552" style="vertical-align:-3.9436pt" version="1.1" viewbox="-0.0498162 -10.1025 16.0566 14.0461" width="16.0566pt" 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="M719 146L691 147C666 77 657 72 612 72H528C572 125 688 224 688 364C688 546 558 665 384 665C212 665 77 541 77 361C77 221 188 124 239 72H150C110 72 97 80 73 147L46 146L63 0H307L314 18C284 71 178 203 178 360C178 529 256 631 383 631C509 631 588 523 588 363C588 197 485 67 453 18L458 0H701L719 146Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,9.841,-5.741)"><path d="M486 158C486 177 478 202 466 220C413 228 386 236 336 262C386 288 413 297 466 304C478 323 486 347 485 366C470 376 444 381 422 380C389 338 368 319 321 288C323 345 329 372 349 422C339 442 322 461 305 470C289 461 271 442 262 422C281 372 287 345 290 288C243 319 222 338 189 380C167 381 142 376 125 366C125 347 133 322 145 304C198 296 225 288 275 262C225 236 198 227 145 220C133 201 125 177 126 158C141 148 167 143 189 144C222 186 243 205 290 236C288 179 282 152 262 102C272 82 289 63 306 54C322 63 340 82 350 102C330 152 324 179 321 236C368 205 390 186 422 144C444 143 470 148 486 158Z"></path></g><g transform="matrix(.0091,0,0,-0.0091,9.841,3.784)"><path d="M290 377C321 398 342 415 358 430C378 450 389 473 389 502C389 578 329 635 238 635H237C184 635 137 610 109 578L64 515L88 493C112 529 154 573 208 573S303 542 303 482C303 409 233 370 141 341L149 308C165 313 190 319 215 319C272 319 341 283 341 193C342 98 292 43 222 43C163 43 122 72 96 94C88 101 79 100 70 94C61 87 47 73 46 60C44 47 48 37 62 23C76 10 118 -12 165 -12C238 -12 430 62 430 223C430 297 379 359 290 375V377Z"></path></g></svg> on Beijing-Shenzhen corridor (from Beijing to Shenzhen).</div>

Mathematical Problems in Engineering

fig7

Figure 7

Figure 7: A Line Planning Approach for High-Speed Rail Networks with Time-Dependent Demand and Capacity Constraints 