A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem

<div>Effect of the least waste strategy on the data set <svg height="9.21094pt" id="M109" style="vertical-align:-0.2129908pt" version="1.1" viewbox="-0.0498162 -8.99795 9.18375 9.21094" width="9.18375pt" 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="M645 631C614 643 545 666 457 666C215 666 23 519 23 283C23 90 158 -16 337 -16C412 -16 489 2 522 10C543 39 590 127 606 167L580 181C519 89 459 18 348 18C201 18 122 136 122 287C122 464 244 632 435 632C544 632 602 595 608 472L639 475C643 526 645 581 645 631Z" id="g113-68"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="668" vert-adv-y="668"></glyph.data></g></svg>.</div>

Mathematical Problems in Engineering

fig6

Figure 6

Figure 6: A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem 