Automation and Remote Control

, Volume 72, Issue 1, pp 141–159 | Cite as

Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution

  • M. A. Mesyagutov
  • E. A. Mukhacheva
  • G. N. Belov
  • G. Scheithauer
Computer-Aided Design and Programming


Consideration was given to the one-dimensional bin packing problem under the conditions for heterogeneity of the items put into bins and contiguity of choosing identical items for the next bin. The branch-and-bound method using the “next fit” principle and the “linear programming” method were proposed to solve it. The problem and its solution may be used to construct an improved lower bound in the problem of two-dimensional packing.


Remote Control Packing Problem Identical Item Partial Packing Priority Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Mukhacheva, E.A., Mukhacheva, A.S., and Chiglintsev, A.V., Block-structure Genetic Algorithm in the Problems of Two-dimensional Packing, Inf. Tekhnol., 1999, no. 11, pp. 13–18.Google Scholar
  2. 2.
    Martello, S., Monachi, M., and Vigo, D., An Exact Approach to the Strip-Packing Problem, INFORMS J. Comput., 2003, no. 15(3), pp. 310–319.Google Scholar
  3. 3.
    Mukhacheva, E.A. and Mukhacheva, A.S., The Rectangular Packing Problem: Local Optimum Search Methods Based on Block Structures, Autom. Remote Control, 2004, no. 2, pp. 248–257.Google Scholar
  4. 4.
    Kartak, V.M., Mesyagutov, M.A., Mukhacheva, E.A., and Filippova, A.S., Local Search of Orthogonal Packings Using the Lower Bounds, Autom. Remote Control, 2009, no. 6, pp. 1054–1066.Google Scholar
  5. 5.
    Zhitnikov, V.P. and Filippova, A.S., Problem of Orthogonal Packing in Half-infinite Strip: Search in the Neighborhood of the Local Lower Bound, Inf. Tekhnol., 2007, no. 5, pp. 55–62.Google Scholar
  6. 6.
    Hartmann, S., Project Scheduling under Limited Resources, Berlin: Springer, 2000.Google Scholar
  7. 7.
    Garey, M.L. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979. Translated under the title Vychislitel’nye machiny i trudnoreshaemye zadachi, Moscow: Mir, 1982.zbMATHGoogle Scholar
  8. 8.
    Martello, S. and Toth, P., Knapsack Problems: Algorithms and Computer Implementations, Chichester: Wiley, 1990.zbMATHGoogle Scholar
  9. 9.
    Belov, G. and Scheithauer, G., A Cutting Plane Algorithm for the One-dimensional Cutting Stock Problem with Multiple Stock Lengths, Eur. Oper. Res., 2002, no. 14(2), pp. 274–294.Google Scholar
  10. 10.
    Hopper, E. and Turton, B., A Review of the Application of Metaheuristic Algorithms to 2D Regular and Irregular Strip Packing Problems, Artific. Intelligent., 2001, no. 16, pp. 257–300.Google Scholar
  11. 11.
    Belov, G., Scheithauer, G., and Mukhacheva, E.A., One-dimensional Heuristics Adapted for Twodimensional Rectangular Strip Packing, J. Oper. Res. Soc., 2008, no. 59, pp. 823–832.Google Scholar
  12. 12.
    Mukhacheva, E.A. and Nazarov, D.A., Design of Rectangular Packings: Block Structure-based Reconstruction Algorithm, Autom. Remote Control, 2008, no. 2, pp. 262–277.Google Scholar
  13. 13.
    Booth, K. and Lueker, G., Testing for the Consecutive Ones Property, Interval Graphs, and Planarity Using PQ-Tree Algorithms, J. Computat. Sys. Sci., 1976, no. 13, pp. 335–379.Google Scholar
  14. 14.
    Bortfeld, A., A Genetic Algorithm for the Two-dimensional Strip Packing Problem with Rectangular Prices, Eur. J. Oper. Res., 2006, no. 172, pp. 814–837.Google Scholar
  15. 15.
    Berkey, J. and Wang, P., Two Dimensional Finite Bin Packing Algorithms, J. Oper. Res. Soc., 1987, no. 38, pp. 423–429.Google Scholar
  16. 16.
    Martello, S. and Vigo, D., Exact Solution of the Two-dimensional Finite Bin Packing Problem, Manage. Sci., 1998, no. 44, pp. 388–399.Google Scholar
  17. 17.
    Kartak, V., Refreshed Lower Bound for the Problem of Packing Rectangulars in Half-infinite Strip, Vest. UGATU, Ser. Upravlen. Vychislit. Tekhn. Informat., 2008, no. 10, 2(27), pp. 154–159.Google Scholar
  18. 18.
    Baldacci, R. and Boschetti, M., A Cutting-plane Approach for the Two-dimensional Orthogonal Nonguillotine Cutting Problem, Eur. J. Oper. Res., 2007, no. 183(3), pp. 1136–1149.Google Scholar
  19. 19.
    Fekete, S. and Schepers, J., A General Framework for Bounds for Higher-dimensional Orthogonal Packing Problems, Math. Met. Oper. Res., 2004, no. 60, pp. 311–329.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2011

Authors and Affiliations

  • M. A. Mesyagutov
    • 1
  • E. A. Mukhacheva
    • 1
  • G. N. Belov
    • 2
  • G. Scheithauer
    • 2
  1. 1.Ufa State Aviation Technical UniversityUfaRussia
  2. 2.Technical University of DresdenDresdenGermany

Personalised recommendations