Loading...
Please wait, while we are loading the content...
Similar Documents
A Hyper-Heuristic Approach to solve the Multi-Objective Container Loading Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Gonzalez, Y. Leon, Carol Boyd Miranda, Gutiérrez |
| Copyright Year | 2014 |
| Abstract | TheContainer Loading Problem (CLP) belongs to an area of active research and has numerous a pplications in the real world, particularly in container transportatio n and distribution industries. When solving the CLP, normally, the goal is to distribute a set of rectangular piec es (boxes) in one large rectangular object (container) so as to maximize the total volume of packed boxes. Ho wever, a rather common aspect in the scope of this problem is the weight limit of the containers, since t h y normally can’t exceed a certain weight for their transportation. In our case of study, the goal is to load the items (boxes) that would provide the highest total volume and weight to the container. These two objectives are conflictin g because the volume of the box is usually not proportional to its weight. This way, the problem can be stat ed as a multi-objective optimization problem, trying to optimize the pieces layout inside the container so that the volume is maximized at the same time that the weight, without exceeding the weight limits. The fo rmulation of the here addressed problem is as follows. We have a container with known width W , lengthL, heightH , maximum weightPmax, and a set of N rectangular boxes. These boxes belong to one of the sets of bo xes typesD = {T1 . . . Tm}. Associated with eachTi type exists a weight pi < Pmax and a volumevi. The aim is to find: |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://meta2014.sciencesconf.org/44558/document |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
