Analysis of Urban Rail Transit Station Planning Combining Simulated Annealing Algorithm

<table class="table-group" id="tab2"><tr><td><table class="table"><tr><td class="thead-hr" colspan="14"><hr/></td></tr><tr class="thead"><td class="align_left">Station number</td><td class="align_center">1</td><td class="align_center">2</td><td class="align_center">3</td><td class="align_center">4</td><td class="align_center">5</td><td class="align_center">6</td><td class="align_center">7</td><td class="align_center">8</td><td class="align_center">9</td><td class="align_center">10</td><td class="align_center">11</td><td class="align_center">12</td><td class="align_center">13</td></tr><tr><td class="thead-hr" colspan="14"><hr/></td></tr><tr><td class="align_left">XA</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">0</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td></tr><tr><td class="align_left">XB</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td><td class="align_center">0</td><td class="align_center">1</td><td class="align_center">1</td></tr><tr><td class="align_left"><span style="width: 16.7759ptpx;"><svg height="9.01194pt" id="M31" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.96212 16.7759 9.01194" width="16.7759pt" 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="M600 0V24L339 665L311 657L43 24V0H600ZM497 50H107L303 539L497 50Z"></path></g><g transform="matrix(.013,0,0,-0.013,8.327,0)"><path d="M620 675H597C578 656 570 650 541 650H144C112 650 104 653 94 675H72C59 618 42 552 23 493L53 491C71 534 88 564 105 585C124 608 144 615 238 615H290L197 121C182 40 174 34 88 28L82 0H361L367 28C275 34 266 38 281 121L374 615H441C522 615 543 608 553 583C562 560 566 531 565 493L597 494C603 551 612 629 620 675Z"></path></g></svg></span></td><td class="align_center" colspan="13"><span style="width: 83.2287ptpx;"><svg height="9.16851pt" id="M32" style="vertical-align:-0.2063904pt" version="1.1" viewbox="-0.0498162 -8.96212 83.2287 9.16851" width="83.2287pt" 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="M600 0V24L339 665L311 657L43 24V0H600ZM497 50H107L303 539L497 50Z"></path></g><g transform="matrix(.013,0,0,-0.013,8.327,0)"><path d="M620 675H597C578 656 570 650 541 650H144C112 650 104 653 94 675H72C59 618 42 552 23 493L53 491C71 534 88 564 105 585C124 608 144 615 238 615H290L197 121C182 40 174 34 88 28L82 0H361L367 28C275 34 266 38 281 121L374 615H441C522 615 543 608 553 583C562 560 566 531 565 493L597 494C603 551 612 629 620 675Z"></path></g><g transform="matrix(.013,0,0,-0.013,20.244,0)"><path d="M535 323V373H52V323H535ZM535 138V188H52V138H535Z"></path></g><g transform="matrix(.013,0,0,-0.013,31.507,0)"><path d="M412 140C382 77 369 73 315 73H129L270 222C362 320 402 379 402 466C402 571 322 635 234 635C177 635 130 609 99 576L42 495L64 475C90 514 133 568 201 568C274 568 318 519 318 435C318 349 255 267 193 193C144 135 87 78 32 23V0H405C417 45 427 89 440 131L412 140Z"></path></g><g transform="matrix(.013,0,0,-0.013,37.747,0)"><path d="M153 550H386L412 615L406 623H120L82 318C104 327 142 338 184 338C294 338 347 275 347 187C347 112 305 39 221 39C160 39 119 71 97 89C88 97 80 96 71 90C59 80 50 67 49 57C48 45 52 36 66 23C80 9 123 -12 169 -12C221 -11 288 15 342 59C403 109 431 165 431 225C431 308 366 395 238 395C212 395 165 379 127 364L153 550Z"></path></g><g transform="matrix(.013,0,0,-0.013,43.987,0)"><path d="M456 178V225H360V632H320C217 496 115 347 20 206V178H280V106C280 40 276 34 189 27V0H445V27C364 34 360 39 360 106V178H456ZM280 225H82C149 335 214 431 278 520H280V225Z"></path></g><g transform="matrix(.013,0,0,-0.013,50.227,0)"><path d="M113 -12C146 -12 170 11 170 46C170 78 146 103 114 103S58 78 58 46C58 11 82 -12 113 -12Z"></path></g><g transform="matrix(.013,0,0,-0.013,53.191,0)"><path d="M447 623H65C61 580 56 530 47 475H76C100 541 106 550 172 550H388C308 376 196 170 91 -1L98 -12L172 -2C268 204 360 408 455 611L447 623Z"></path></g><g transform="matrix(.013,0,0,-0.013,61.613,0)"><path d="M797 0V26C739 32 732 36 732 103V296C732 394 682 449 605 449C576 449 550 437 529 423C504 407 475 389 446 366C425 418 382 449 334 449C303 449 279 437 253 421C222 403 201 385 180 371V452C135 432 85 419 41 411V388C99 379 102 374 102 310V103C102 38 93 32 27 26V0H238V26C189 32 180 38 180 103V338C210 363 250 390 289 390C351 390 377 348 377 275V103C377 37 368 32 306 26V0H520V26C465 32 456 38 456 101V296C456 314 455 326 453 338C491 369 529 390 565 390C628 390 653 345 653 274V107C653 36 642 32 583 26V0H797Z"></path></g><g transform="matrix(.013,0,0,-0.013,72.26,0)"><path d="M135 536C164 536 186 560 186 587C186 617 164 639 136 639C109 639 85 617 85 587C85 560 109 536 135 536ZM252 0V26C188 32 181 38 181 106V451C138 433 90 420 39 412V388C99 379 102 374 102 312V106C102 38 95 32 32 26V0H252Z"></path></g><g transform="matrix(.013,0,0,-0.013,75.744,0)"><path d="M524 0V26C466 32 460 36 460 104V297C460 393 411 449 331 449C302 449 276 437 248 419C223 402 201 387 181 372V451C137 432 90 420 42 411V388C96 378 102 374 102 310V104C102 38 97 33 29 26V0H246V26C187 32 181 36 181 104V339C211 365 250 390 290 390C357 390 381 345 381 276V109C381 40 374 32 315 26V0H524Z"></path></g></svg></span></td></tr><tr class="table-tr"><td colspan="14"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Optimization results of <i>A</i> and <i>B</i> train parking plan.</div>

Discrete Dynamics in Nature and Society

tab2

Table 2

Table 2: Analysis of Urban Rail Transit Station Planning Combining Simulated Annealing Algorithm 