Showing 1 - 6 of 6
In this paper, we consider the two-dimensional variable-sized bin packing problem (2DVSBPP) with guillotine constraint …. 2DVSBPP is a well-known NP-hard optimization problem which has several real applications. A mixed bin packing algorithm … (MixPacking) which combines a heuristic packing algorithm with the Best Fit algorithm is proposed to solve the single bin problem …
Persistent link: https://www.econbiz.de/10010871071
the problem and the search was then extended with a collection of packing heuristics to solve the loading constraints in 2 …
Persistent link: https://www.econbiz.de/10010594993
-dimensional orthogonal packing constraints. A variable neighborhood search is proposed to address the routing aspect, and a skyline heuristic …
Persistent link: https://www.econbiz.de/10011209375
Persistent link: https://www.econbiz.de/10010513872
Persistent link: https://www.econbiz.de/10011778491
Persistent link: https://www.econbiz.de/10010398834