Three-stage heuristic algorithm for three-dimensional irregular packing problem

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review

4 Scopus Citations
View graph of relations

Author(s)

  • Hongteng Wu
  • Stephen C.H. Leung
  • Yain-whar Si
  • Defu Zhang
  • Adi Lin

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)431-444
Journal / PublicationApplied Mathematical Modelling
Volume41
Early online date21 Sep 2016
Publication statusPublished - Jan 2017

Abstract

This paper studies a new practical problem which can be decomposed into three three-dimensional packing problems: three-dimensional irregular packing with variable-size cartons problem, three-dimensional variable-size bin packing problem, and the single container loading problem. Since the three sub-problems are NP-hard, searching a good solution becomes more difficult. In this paper, mathematical models of each sub-problem are developed and three-stage heuristic algorithms are proposed to solve this new problem. Experiments are conducted with random instances generated by real-life case. Computational results indicate that the proposed algorithm is efficient and can yield satisfactory results.

Research Area(s)

  • Irregular packing problem, Packing, Three-stage heuristic algorithms

Citation Format(s)

Three-stage heuristic algorithm for three-dimensional irregular packing problem. / Wu, Hongteng; Leung, Stephen C.H.; Si, Yain-whar; Zhang, Defu; Lin, Adi.

In: Applied Mathematical Modelling, Vol. 41, 01.2017, p. 431-444.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalNot applicablepeer-review