276
Views
10
CrossRef citations to date
0
Altmetric
Original Articles

A superior linearization method for signomial discrete functions in solving three-dimensional open-dimension rectangular packing problems

, &
Pages 746-761 | Received 03 Nov 2015, Accepted 30 Jun 2016, Published online: 10 Aug 2016

References

  • Adjiman, C. S., I. P. Androulakis, and C. A. Floudas. 2000. “Global Optimization of Mixed-Integer Nonlinear Problems.” AIChE Journal 46 (9): 1769–1797. doi: 10.1002/aic.690460908
  • Bansal, N., H. Xin, K., Iwama, M. Sviridenko, and G. A. Zhang. 2013. “A Harmonic Algorithm for the 3D Strip Packing Problem.” SIAM Journal on Computing 42 (2): 579–592. doi: 10.1137/070691607
  • Bischoff, E. E., and M. D. Marriott. 1990. “A Comparative Evaluation of Heuristics for Container Loading.” European Journal of Operational Research 44: 267–276. doi: 10.1016/0377-2217(90)90362-F
  • Bortfeldt, A., and H. Gehring. 1999. “Two Metaheuristics for Strip Packing Problems.” In Proceedings of the Fifth International Conference of the Decision Sciences Institute, Athens, edited by D. K. Despotis and C. Zopounidis, Vol. 2, 1153–1156. Athens: New Technologies Publications.
  • Bortfeldt, A., and D. Mack. 2007. “A Heuristic for the Three-Dimensional Strip Packing Problem.” European Journal of Operational Research 183: 1267–1279. doi: 10.1016/j.ejor.2005.07.031
  • Bortfeldt, A., and G. Wäscher. 2013. “Constraints in Container Loading—A State-of-the-Art Review.” European Journal of Operational Research 229 (1): 1–20. doi: 10.1016/j.ejor.2012.12.006
  • Chen, C. S., S. M. Lee, and Q. S. Shen. 1995. “An Analytical Model for the Container Loading Problem.” European Journal of Operational Research 80 (1): 68–76. doi: 10.1016/0377-2217(94)00002-T
  • Faina, L. 2000. “A Global Optimization Algorithm for the Three-Dimensional Packing Problem.” European Journal of Operational Research 126: 340–354. doi: 10.1016/S0377-2217(99)00292-1
  • George, J. A., and D. F. Robinson. 1980. “A Heuristic for Packing Boxes into a Container.” Computers and Operations Research 7: 147–156. doi: 10.1016/0305-0548(80)90001-5
  • Glover, F. 1975. “Improved Linear Integer Programming Formulations of Nonlinear Integer Problems.” Management Science 22 (4): 455–60. doi: 10.1287/mnsc.22.4.455
  • Hu, N. Z., H. L. Li, and J. F. Tsai. 2012. “Solving Packing Problems by a Distributed Global Optimization Algorithm.” Mathematical Problems in Engineering 2012: Article ID 931092. doi:10.1155/2012/931092
  • Jansen, K., and R. Solis-Oba. 2006. “An Asymptotic Approximation Algorithm for 3D-Strip Packing.” Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithm (SODA 2006), 143–152. ACM Press.
  • Junqueira, L., R. Morabito, and D. S. Yamashita. 2012a. “Three-Dimensional Container Loading Models with Cargo Stability and Load Bearing Constraints.” Computers and Operations Research 39 (1): 74–85. doi: 10.1016/j.cor.2010.07.017
  • Junqueira, L., R. Morabito, and D. S. Yamashita. 2012b. “MIP-Based Approaches for the Container Loading Problem with Multi-drop Constraints.” Annals of Operations Research 199 (1): 51–75. doi: 10.1007/s10479-011-0942-z
  • Junqueira, L., R. Morabito, Yamashita, D. S., and H. H. Yanasse. 2013. “Optimization Models for the Three Dimensional Container Loading Problem with Practical Constraints.” In Modeling and Optimization in Space Engineering, edited by G. Fasano and J. D. Pintér, 271–293. New York: Springer.
  • Li, K., and K. H. Cheng. 1990. “On Three-Dimensional Packing.” SIAM Journal on Computing 19 (5): 847–867. doi: 10.1137/0219059
  • Li, K., and K. H. Cheng. 1992. “Heuristic Algorithms for On-Line Packing in Three Dimensions.” Journal of Algorithms 13: 589–605. doi: 10.1016/0196-6774(92)90058-K
  • Li, H. L., Y. H. Huang, and S. C. Fang. 2013. “A Logarithmic Method for Reducing Binary Variables and Inequality Constraints in Solving Task Assignment Problems.” INFORMS Journal on Computing 25: 643–653. doi: 10.1287/ijoc.1120.0527
  • Li, H. L., J. F. Tsai, and N. Z. Hu. 2003. “A Distributed Global Optimization Method for Packing Problems.” Journal of the Operational Research Society 54: 419–425. doi: 10.1057/palgrave.jors.2601528
  • Miyazawa, F. K., and Y. Wakabayashi. 1997. “An Algorithm for the Three-Dimensional Packing Problem with Asymptotic Performance Analysis.” Algorithmica 18: 122–144. doi: 10.1007/BF02523692
  • Pisinger, D. 2002. “Heuristics for the Container Loading Problem.” European Journal of Operational Research 141: 382–392. doi: 10.1016/S0377-2217(02)00132-7
  • Tsai, J. F., and H. L. Li. 2006. “A Global Optimization Method for Packing Problems.” Engineering Optimization 38: 687–700. doi: 10.1080/03052150600603264
  • Tsai, J. F., and M. H. Lin. 2013. “An Improved Framework for Solving NLIPs with Signomial Terms in the Objective or Constraints to Global Optimality.” Computers & Chemical Engineering 53: 44–54. doi: 10.1016/j.compchemeng.2013.01.015
  • Tsai, J. F., P. C. Wang, and M. H. Lin. 2015. “A Global Optimization Approach for Solving Three-Dimensional Open Dimension Rectangular Packing Problems.” Optimization: A Journal of Mathematical Programming and Operations Research 64 (12): 2601–2618. doi:10.1080/02331934.2013.877906.
  • Vielma, J. P., and G. L. Nemhauser. 2011. “Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints.” Mathematical Programming 128: 49–72. doi: 10.1007/s10107-009-0295-4
  • Wäscher, G., H. Hausner, and H. Schumann. 2007. “An Improved Typology of Cutting and Packing Problems.” European Journal of Operational Research 183: 1109–1130. doi: 10.1016/j.ejor.2005.12.047
  • Wu, Y., W. Li, M. Goh, and R. de Souza. 2010. “Three-Dimensional Bin Packing Problem with Variable Bin Height.” European Journal of Operational Research 202 (2): 347–355. doi: 10.1016/j.ejor.2009.05.040

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.