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

<div>Effect of <svg height="9.04777pt" id="M106" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.99795 10.5164 9.04777" width="10.5164pt" 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="M743 375C743 570 607 650 407 650H136L130 622C214 612 220 606 204 526L125 122C110 43 105 36 24 27L17 0H250C382 0 482 23 571 76C680 141 743 248 743 375ZM644 379C644 188 520 36 305 36C277 36 249 38 229 46C205 55 202 71 212 126L293 553C300 588 306 600 317 606C330 613 356 617 390 617C547 617 644 537 644 379Z" id="g113-69"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="766" vert-adv-y="766"></glyph.data></g></svg> on the data set Nice1~6 and Path1~6.</div>

Mathematical Problems in Engineering

fig5

Figure 5

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