Journal of the Operational Research Society

, Volume 54, Issue 4, pp 419–425 | Cite as

A distributed global optimization method for packing problems

  • H-L Li
  • J-F Tsai
  • N-Z Hu
Technical Note

Abstract

Packing optimization problems aim to seek the best way of placing a given set of rectangular cartons within a minimum volume rectangular container. Currently, packing optimization methods either have difficulty in finding a globally optimal solution or are computationally inefficient, because models involve too many 0–1 variables and because use of just a single computer. This study proposes a distributed computation method for solving a packing problem by a set of personal computers via the Internet. First, the traditional packing optimization model is converted into an equivalent model containing many fewer 0–1 variables. Then the model is decomposed into several sub-problems by dividing the objective value into many intervals. Each of these sub-problems is a linearized logarithmic program expressed as a linear mixed 0–1 problem. The whole problem is solvable and reaches a globally optimal solution. The numerical examples demonstrate that the proposed method can obtain the global optimum of a packing problem effectively.

Keywords

cutting stock problem distributed computation layout optimization 

References

  1. Fayard D and Zissimopoulos V (1995). An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Eur J Opl Res 84: 618–632.CrossRefGoogle Scholar
  2. Hifi M and Ouafi R (1997). Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates. Comput Ind Eng 32: 187–205.CrossRefGoogle Scholar
  3. Beasley JE (1985). An algorithm for the two-dimensional assortment problem. Eur J Opl Res 19: 253–261.CrossRefGoogle Scholar
  4. Liu FH and Hsiao CJ (1997). A three-dimensional pallet loading method for single-size boxes. J Opl Res Soc 48: 726–735.CrossRefGoogle Scholar
  5. Terno J, Scheithauer G, Sommerwei BU and Riehme J (2000). An efficient approach for the multi-pallet loading problem. Eur J Opl Res 123: 372–381.CrossRefGoogle Scholar
  6. Scheithauer G (1999). LP-based bounds for the container and multi-container loading problem. Int Trans Oper Res 6: 199–213.CrossRefGoogle Scholar
  7. Dowsland WB (1991). Three-dimensional packing-solution approaches and heuristic development. Int J Prod Res 29: 1673–1685.CrossRefGoogle Scholar
  8. Martello S, Pisinger D and Vigo D (2000). The three-dimensional bin packing problem. Oper Res 48: 256–267.CrossRefGoogle Scholar
  9. Faina L (2000). A global optimization algorithm for the three-dimensional packing problem. Eur J Opl Res 126: 340–354.CrossRefGoogle Scholar
  10. Pisinger D (2002). Heuristics for the container loading problem. Eur J Opl Res 141: 382–392.CrossRefGoogle Scholar
  11. Chen CS, Lee SM and Shen QS (1995). An analytical model for the container loading problem. Eur J Opl Res 80: 68–76.CrossRefGoogle Scholar
  12. Li HL and Chang CT (1998). An approximately global optimization method for assortment problems. EurJ Opl Res 105: 604–612.CrossRefGoogle Scholar
  13. Schraga L (1998). Optimization modeling with LINGO. 2nd edition. Lindo Systems Inc: Chicago.Google Scholar

Copyright information

© Palgrave Macmillan Ltd 2003

Authors and Affiliations

  • H-L Li
    • 1
  • J-F Tsai
    • 1
  • N-Z Hu
    • 1
  1. 1.National Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations