An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem

<div>Overlap between two flights <svg height="12.0653pt" id="M199" style="vertical-align:-3.4294pt" version="1.1" viewbox="-0.0498162 -8.6359 5.61923 12.0653" width="5.61923pt" 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="M394 607C394 634 378 655 350 655C315 655 294 620 294 594C294 564 314 546 339 546C372 546 394 574 394 607ZM360 349C373 414 374 448 351 448C321 448 249 404 183 338L197 313C223 336 265 367 276 367C285 367 283 355 275 313C241 129 220 23 189 -102C175 -158 153 -197 124 -197C106 -197 85 -187 70 -177C64 -173 51 -177 44 -183C34 -193 23 -209 23 -228C23 -244 46 -261 67 -261C86 -261 127 -245 181 -197C237 -147 279 -52 303 66L360 349Z" id="g113-107"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="423" vert-adv-y="423"></glyph.data></g></svg> and <svg height="9.49473pt" id="M200" style="vertical-align:-0.2063999pt" version="1.1" viewbox="-0.0498162 -9.28833 6.66314 9.49473" width="6.66314pt" 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="M480 416C480 431 465 448 438 448C388 448 312 383 252 330C217 299 188 273 155 237H153L257 680C262 700 263 712 253 712C240 712 183 684 97 674L92 648L126 647C166 646 172 645 163 606L23 -6L29 -12C51 -5 77 2 107 8C115 62 130 128 142 180C153 193 179 220 204 241C231 170 259 106 288 54C317 0 336 -12 358 -12C381 -12 423 2 477 80L460 100C434 74 408 54 398 54C385 54 374 65 351 107C326 154 282 241 263 299C296 332 351 377 403 377C424 377 436 372 445 368C449 366 456 368 462 375C472 386 480 402 480 416Z" id="g113-108"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="503" vert-adv-y="503"></glyph.data></g></svg> assigned to the same BSS.</div>

Journal of Optimization

fig15

Figure 15

Figure 15: An Analysis of Robustness Approaches for the Airport Baggage Sorting Station Assignment Problem 