An iterative bidirectional heuristic placement algorithm for solving the two-dimensional knapsack packing problem

References

• Baker, B., and J. Schwarz. 1983. “Shelf Algorithms for Two-Dimensional Packing Problems.” SIAM Journal on Computing 12 (3): 508–525.
   Web of Science ®Google Scholar
• Beasley, J. E. 1985a. “Algorithms for Unconstrained Two-Dimensional Guillotine Cutting.” The Journal of the Operational Research Society 36 (4): 297–306.
   Web of Science ®Google Scholar
• Beasley, J. E. 1985b. “An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure.” Operations Research 33 (1): 49–64.
   Web of Science ®Google Scholar
• Bengtsson, Bengt-Erik. 1982. “Packing Rectangular Pieces—A Heuristic Approach.” The Computer Journal 25 (3): 353–357.
   Web of Science ®Google Scholar
• Burke, E. K., G. Kendall, and G. Whitwell. 2004. “A New Placement Heuristic for the Orthogonal Stock-Cutting Problem.” Operations Research 52 (4): 655–671.
   Web of Science ®Google Scholar
• Christofides, Nicos, and Charles Whitlock. 1977. “An Algorithm for Two-Dimensional Cutting Problems.” Operations Research 25 (1): 30–44.
   Web of Science ®Google Scholar
• Egeblad, Jens, and David Pisinger. 2009. “Heuristic Approaches for the Two- and Three-Dimensional Knapsack Packing Problem.” Computers & Operations Research 36 (4): 1026–1049.
   Web of Science ®Google Scholar
• Hifi, Mhand. 1998. “Exact Algorithms for the Guillotine Strip Cutting/packing Problem.” Computers & Operations Research 25 (11): 925–940.
   Web of Science ®Google Scholar
• Hopper, Eva. 2000. “Two-Dimensional Packing Utilising Evolutionary Algorithms and Other Meta-Heuristic Methods.” University of Wales, Cardiff, UK. http://www.inf.utfsm.cl/~mcriff/EA/eva-space-planning/part1.pdf.
   Google Scholar
• Hopper, Eva, and B. C. H. Turton. 2001. “An Empirical Investigation of Meta-Heuristic and Heuristic Algorithms for a 2D Packing Problem.” European Journal of Operational Research 128 (1): 34–57.
   Web of Science ®Google Scholar
• Imahori, Shinji, and Mutsunori Yagiura. 2010. “The Best-Fit Heuristic for the Rectangular Strip Packing Problem: An Efficient Implementation and the Worst-Case Approximation Ratio.” Computers & Operations Research 37 (2) Oxford, UK, UK: 325–333.
   Web of Science ®Google Scholar
• Korte, Bernhard, and Jens Vygen. 2002. “Bin-Packing.” In Combinatorial Optimization: Theory and Algorithms, 2nd ed., 407–422. Berlin: Springer-Verlag.
   Google Scholar
• Leung, Stephen C. H., and Defu Zhang. 2011. “A Fast Layer-Based Heuristic for Non-Guillotine Strip Packing.” Expert Systems with Applications 38 (10): 13032–13042.
   Web of Science ®Google Scholar
• Leung, Stephen C. H., Defu Zhang, and Kwang Mong Sim. 2011. “A Two-Stage Intelligent Search Algorithm for the Two-Dimensional Strip Packing Problem.” European Journal of Operational Research 215 (1): 57–69.
   Web of Science ®Google Scholar
• Leung, Stephen C. H., Defu Zhang, Changle Zhou, and Tao Wu. 2012. “A Hybrid Simulated Annealing Metaheuristic Algorithm for the Two-Dimensional Knapsack Packing Problem.” Computers & Operations Research 39 (1): 64–73.
   Web of Science ®Google Scholar
• Lodi, Andrea, Silvano Martello, and Daniele Vigo. 1999. “Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems.” INFORMS Journal on Computing 11 (4): 345–357.
   Web of Science ®Google Scholar
• Lourenço, Helena R, Olivier C. Martin, and Thomas Stützle. 2010. “Iterated Local Search: Framework and Applications.” In Handbook of Metaheuristics, edited by Michel Gendreau and Jean-Yves Potvin, 363–397. Boston, MA: Springer US.
   Google Scholar
• Martello, Silvano, Michele Monaci, and Daniele Vigo. 2003. “An Exact Approach to the Strip-Packing Problem.” INFORMS Journal on Computing 15 (3): 310–319.
   Web of Science ®Google Scholar
• Özcan, Ender, Zhang Kai, and John H. Drake. 2013. “Bidirectional Best-Fit Heuristic Considering Compound Placement for Two Dimensional Orthogonal Rectangular Strip Packing.” Expert Systems with Applications 40 (10): 4035–4043.
   Web of Science ®Google Scholar
• Pinto, Eduarda Ferreira, and José Fernando Oliveira. 2005. “Algorithms Based on Graphs for the Non-Guillotinable Two-Dimensional Packing Problem.” In Second ESICUP Meeting. Southampton, United Kingdom.
   Google Scholar
• Shiangjen, K., J. Chaijaruwanich, W. Srisujjalertwaja, and S. Somhom. 2015. “Enhancing the Efficiency of Heuristic Placement Algorithm for Two-Dimensional Orthogonal Knapsack Packing Problem.” In Software Engineering and Service Science (ICSESS), 2015 6th IEEE International Conference on, 33–36.
   Google Scholar
• Wang, Pearl Y, and Christine L. Valenzela. 2001. “Data Set Generation for Rectangular Placement Problems.” European Journal of Operational Research 134 (2): 378–391.
   Web of Science ®Google Scholar
• Wei, Lijun, Defu Zhang, and Qingshan Chen. 2009. “A Least Wasted First Heuristic Algorithm for the Rectangular Packing Problem.” Computers & Operations Research 36 (5): 1608–1614.
   Web of Science ®Google Scholar
• Wei, Lijun, Hu Qin, Brenda Cheang, and Xianhao Xu. 2016. “An Efficient Intelligent Search Algorithm for the Two-Dimensional Rectangular Strip Packing Problem.” International Transactions in Operational Research 23 (1–2): 65–92.
   Web of Science ®Google Scholar
• Yang, Shuangyuan, Shuihua Han, and Weiguo Ye. 2013. “A Simple Randomized Algorithm for Two-Dimensional Strip Packing.” Computers & Operations Research 40 (1): 1–8.
   Web of Science ®Google Scholar