Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download file Download BibTeX

Title

Multi-criteria 3-dimension bin packing problem

Authors

Year of publication

2015

Published in

Research in Logistics & Production

Journal year: 2015 | Journal volume: vol. 5 | Journal number: no. 1

Article type

scientific article

Publication language

english

Keywords
EN
  • bin packing problem
  • multi-criteria
  • genetic algorithm
  • simulated annealing
  • discrete optimization
  • Pareto efficiency
Abstract

EN In this paper a multi-criteria approach to the 3-dimensions bin packing problem is considered. The chosen maximization criteria are the number and the total volume of the boxes loaded into the container. Existing solution representation and decoding method are applied to the problem. Next, two metaheuristic algorithms, namely simulated annealing and genetic algorithm are developed using the TOPSIS method for solution evaluation. Both algorithms are then used to obtain approximations of the Pareto front for a set of benchmarks from the literature. Despite the fact that both criteria work in favor of each other, we managed to obtain multiple solutions in many cases, proving that lesser number of boxes can lead to better utilization of the container volume and vice versa. We also observed, that the genetic algorithms performs slightly better in our test both in the terms of hyper-volume indicator and number of non-dominated solutions.

Pages (from - to)

85 - 94

Full text of article

Download file

Access level to full text

public

Ministry points / journal

8

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.