Modern Models and Algorithms of Open-end Bin Packing Problems

We present the models and algorithms of the Open-end Bin Packing Problem and two variants of the problem: Ordered Open-end Bin Packing Problem and Open-end Bin Packing Problem with Conflicts. We got the results by testing the algoritms on several instances. The resutls are discussed and the models are solved by Gurobi. Then we proposed the local search algorithms based on the heuristic solutions of Open-end Bin Packing Problem with Conflicts.