https://www.scipedia.com/wd/index.php?action=history&feed=atom&title=Kleyntssens_et_al_2012aKleyntssens et al 2012a - Revision history2026-04-18T14:25:07ZRevision history for this page on the wikiMediaWiki 1.27.0-wmf.10https://www.scipedia.com/wd/index.php?title=Kleyntssens_et_al_2012a&diff=203158&oldid=prevScipediacontent: Scipediacontent moved page Draft Content 728533435 to Kleyntssens et al 2012a2021-02-02T07:09:18Z<p>Scipediacontent moved page <a href="/public/Draft_Content_728533435" class="mw-redirect" title="Draft Content 728533435">Draft Content 728533435</a> to <a href="/public/Kleyntssens_et_al_2012a" title="Kleyntssens et al 2012a">Kleyntssens et al 2012a</a></p>
<table class="diff diff-contentalign-left" data-mw="interface">
<tr style='vertical-align: top;' lang='en'>
<td colspan='1' style="background-color: white; color:black; text-align: center;">← Older revision</td>
<td colspan='1' style="background-color: white; color:black; text-align: center;">Revision as of 07:09, 2 February 2021</td>
</tr><tr><td colspan='2' style='text-align: center;' lang='en'><div class="mw-diff-empty">(No difference)</div>
</td></tr></table>Scipediacontenthttps://www.scipedia.com/wd/index.php?title=Kleyntssens_et_al_2012a&diff=203157&oldid=prevScipediacontent: Created page with " == Abstract == The aircraft loading problem is a real-world combinatorial optimisation problem highly constrained. This weight must be distributed to keep the centre of grav..."2021-02-02T07:09:13Z<p>Created page with " == Abstract == The aircraft loading problem is a real-world combinatorial optimisation problem highly constrained. This weight must be distributed to keep the centre of grav..."</p>
<p><b>New page</b></p><div><br />
== Abstract ==<br />
<br />
The aircraft loading problem is a real-world combinatorial optimisation problem highly constrained. This weight must be distributed to keep the centre of gravity within speci ed limits. Moreover, an aircraft has usually several cargo compart- ments with speci c contours and structural limitations such as oor loading, com- bined load limits and cumulative load limitations. Finally, some shipments are par- ticularly restrictive to transport, like dangerous goods, live animals and perishable goods. This paper is concerned with the incorporation of these latter constraints in a mixed integer linear program for the problem of loading a set of Unit Load- ing Devices and bulk into an aircraft. Experimental results show that our method achieves optimal solutions within only few seconds. Peer reviewed<br />
<br />
<br />
== Original document ==<br />
<br />
The different versions of the original document can be found in:<br />
<br />
* [https://orbi.uliege.be/handle/2268/111172 https://orbi.uliege.be/handle/2268/111172],<br />
: [http://www.orbel.be http://www.orbel.be]</div>Scipediacontent