Abstract: We address the bin packing problem (BPP), which aims to maximize bin utilization when packing a variety of items. The offline problem, where the complete information about the item set and ...
OnGP Average Time,0.024407,0.022990,0.022414,0.021998,0.021693,0.021424,0.021338,0.021286,0.021472,0.021887, OnGP Average Bins,444703.200000,443939.800000,443857. ...
OnGP Average Time,0.024532,0.023159,0.022461,0.021907,0.021605,0.021360,0.021376,0.021258,0.021403,0.022148, OnGP Average Bins,434677.000000,434056.800000,433997. ...
Abstract: The capacitated vehicle routing problem with 2dimensional loading constraints ($\mathbf{2 L}-\mathbf{C V R P}$) integrates aspects of both the vehicle routing problem and the two-dimensional ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results