A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network

<div>Illustration of the notation <svg height="11.5564pt" id="M28" style="vertical-align:-2.26807pt" version="1.1" viewbox="-0.0498162 -9.28833 23.6396 11.5564" width="23.6396pt" 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="M822 650H589L583 622C660 617 677 607 674 561C672 534 664 481 647 390L600 137H596L273 650H126L120 622C176 620 194 615 207 594C221 571 225 557 214 504L161 257C141 166 129 112 121 85C108 42 83 30 29 28L23 0H260L266 28C193 33 173 42 176 89C178 122 186 172 202 255L256 527H259L583 -8H612L690 390C708 481 720 535 728 558C744 603 756 619 816 622L822 650Z" id="g113-79"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="839" vert-adv-y="839"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,10.91,0)"><path d="M300 -147C201 -63 143 98 143 270S200 602 300 686L282 710C136 610 70 450 70 271V270C70 89 136 -72 282 -170L300 -147Z" id="g113-41"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,15.408,0)"><path d="M244 607C244 633 228 655 200 655C166 655 146 618 146 594C146 564 166 546 191 546C221 546 244 574 244 607ZM222 91L209 114C184 94 148 66 133 66C127 66 124 73 130 96L201 370C213 416 211 448 191 448C162 448 88 407 29 352L42 328C73 354 104 371 114 371C120 371 119 365 115 345L53 92C32 5 45 -12 68 -12C103 -12 186 50 222 91Z" id="g113-106"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="273" vert-adv-y="273"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,18.957,0)"><path d="M275 270C275 450 212 609 64 710L45 686C145 604 203 442 203 270S147 -63 45 -147L64 -170C213 -68 275 89 275 270Z" id="g113-42"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="346" vert-adv-y="346"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A Branch and Bound Algorithm for the Exact Solution of the Problem of EMU Circulation Scheduling in Railway Network 