A New Imperialist Competitive Algorithm for Multiobjective Low Carbon Parallel Machines Scheduling

<table class="figure-group"><tr class="fig-image" id="a"><td><object data="https://static.hindawi.com/articles/mpe/volume-2018/5914360/figures/5914360.fig.004a.svgz" name="5914360.fig.004a" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(a) </b>The comparison for total tardiness in <svg height="8.69875pt" id="M451" style="vertical-align:-0.3499298pt" version="1.1" viewbox="-0.0498162 -8.34882 38.6238 8.69875" width="38.6238pt" 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="M153 550H386L412 615L406 623H120L82 318C104 327 142 338 184 338C294 338 347 275 347 187C347 112 305 39 221 39C160 39 119 71 97 89C88 97 80 96 71 90C59 80 50 67 49 57C48 45 52 36 66 23C80 9 123 -12 169 -12C221 -11 288 15 342 59C403 109 431 165 431 225C431 308 366 395 238 395C212 395 165 379 127 364L153 550Z" id="g113-54"></path></g><g transform="matrix(.013,0,0,-0.013,6.24,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path></g><g transform="matrix(.013,0,0,-0.013,15.432,0)"><path d="M528 54L331 254L528 455L492 493L294 291L96 493L60 455L257 254L60 54L96 16L294 217L492 16L528 54Z" id="g117-42"></path></g><g transform="matrix(.013,0,0,-0.013,25.969,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path></g><g transform="matrix(.013,0,0,-0.013,32.209,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path></g></svg></td></tr><tr class="fig-image" id="b"><td><object data="https://static.hindawi.com/articles/mpe/volume-2018/5914360/figures/5914360.fig.004b.svgz" name="5914360.fig.004b" type="image/svg+xml"></object></td></tr><tr class="fig-caption"><td><b>(b) </b>The comparison for energy consumption in <svg height="8.69875pt" id="M452" style="vertical-align:-0.3499298pt" version="1.1" viewbox="-0.0498162 -8.34882 38.6238 8.69875" width="38.6238pt" 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="M153 550H386L412 615L406 623H120L82 318C104 327 142 338 184 338C294 338 347 275 347 187C347 112 305 39 221 39C160 39 119 71 97 89C88 97 80 96 71 90C59 80 50 67 49 57C48 45 52 36 66 23C80 9 123 -12 169 -12C221 -11 288 15 342 59C403 109 431 165 431 225C431 308 366 395 238 395C212 395 165 379 127 364L153 550Z" id="g113-54"></path></g><g transform="matrix(.013,0,0,-0.013,6.24,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path></g><g transform="matrix(.013,0,0,-0.013,15.432,0)"><path d="M528 54L331 254L528 455L492 493L294 291L96 493L60 455L257 254L60 54L96 16L294 217L492 16L528 54Z" id="g117-42"></path></g><g transform="matrix(.013,0,0,-0.013,25.969,0)"><path d="M384 0V27C293 34 287 42 287 114V635C232 613 172 594 109 583V559L157 557C201 555 205 550 205 499V114C205 42 199 34 109 27V0H384Z" id="g113-50"></path></g><g transform="matrix(.013,0,0,-0.013,32.209,0)"><path d="M241 635C89 635 35 457 35 312C35 153 89 -12 240 -12C390 -12 443 166 443 312C443 466 390 635 241 635ZM238 602C329 602 354 454 354 312C354 172 330 22 240 22C152 22 124 173 124 313S148 602 238 602Z" id="g113-49"></path></g></svg></td></tr></table>

<div>The comparison of four algorithms for convergence.</div>

Mathematical Problems in Engineering

fig4

Figure 4

Figure 4: A New Imperialist Competitive Algorithm for Multiobjective Low Carbon Parallel Machines Scheduling 