Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem

Published: 2022, Last Modified: 15 May 2025Comput. Oper. Res. 2022EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•We propose the quadratic multiple constraint variable sized bin-packing problem (QMC-VSBPP).•A variable neighborhood search heuristic is proposed to solve QMC-VSBPP.•A GA and a VNS for VSBPP are adapted for the state-of-the-art QMC-VSBPP.•The commercial solver CPLEX was applied to QMC-VSBPP.•The proposed VNS can obtain better solutions compared to the adapted GA, the adapted VNS, and CPLEX.
Loading