An Optimization Method for the Remanufacturing Dynamic Facility Layout Problem with Uncertainties

<div>(a) Sample matrix <svg height="9.04777pt" id="M153" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 9.65971 9.04777" width="9.65971pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="703" vert-adv-y="703"></glyph.data></g></svg>; (b) sample matrix <svg height="9.04777pt" id="M154" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 8.47659 9.04777" width="8.47659pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z" id="g113-70"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="616" vert-adv-y="616"></glyph.data></g></svg>; (c) sample matrix <svg height="9.21094pt" id="M155" style="vertical-align:-0.2129908pt" version="1.1" viewbox="-0.0498162 -8.99795 9.40133 9.21094" width="9.40133pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M673 297H417L411 270C517 261 522 258 506 183L487 92C476 38 428 19 360 19C207 19 123 132 123 287C123 472 243 631 441 631C557 631 617 583 617 469L647 472C650 545 655 604 658 632C625 643 554 666 467 666C201 666 23 502 23 278C23 90 156 -16 339 -16C410 -16 501 6 569 24C566 43 567 70 573 101L589 183C604 259 607 262 667 271L673 297Z" id="g113-72"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="684" vert-adv-y="684"></glyph.data></g></svg> derived from <svg height="9.04777pt" id="M156" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 9.65971 9.04777" width="9.65971pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M686 28C612 35 607 44 591 112C563 234 541 360 519 489L489 666L457 658L147 121C100 40 89 36 24 28L17 0H240L250 28C168 34 159 41 190 101L262 237H482C495 180 503 137 510 91C517 47 514 35 441 28L433 0H677L686 28ZM475 280H285L429 541H431L475 280Z" id="g113-66"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="703" vert-adv-y="703"></glyph.data></g></svg> and <svg height="9.04777pt" id="M157" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 8.47659 9.04777" width="8.47659pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.0135,0,0,-0.0135,0,0)"><path d="M593 650H142L136 622C219 616 224 611 209 531L130 120C114 39 108 34 23 28L17 0H501C518 32 557 130 568 158L540 169C519 132 495 93 469 70C439 43 409 35 332 35C272 35 241 37 225 50C211 61 211 89 222 149L253 320H350C441 320 443 312 441 239H471L510 434H481C455 366 448 358 360 358H260L303 572C311 613 312 615 348 615H431C509 615 522 603 532 581C544 555 546 531 545 491L574 493C583 555 592 631 593 650Z" id="g113-70"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="616" vert-adv-y="616"></glyph.data></g></svg>.</div>

Discrete Dynamics in Nature and Society

fig3

Figure 3

Figure 3: An Optimization Method for the Remanufacturing Dynamic Facility Layout Problem with Uncertainties 