Skip to content

Commit a0dd0a3

Browse files
Create README.md
adding readme
1 parent e06723d commit a0dd0a3

File tree

1 file changed

+16
-0
lines changed

1 file changed

+16
-0
lines changed

README.md

+16
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,16 @@
1+
# A hybrid multi-objective genetic algorithm for the container loading problem
2+
3+
In this project, we propose to use a hybrid genetic algorithm to solve a single container loading problem, by optimizing the utilized volume, the number, and total value of the contained boxes. Within the framework of the proposed algorithm, a special diploid representation scheme of individuals is used and a modified heuristic packing method, derived from the deepest bottom left with fill (DBLF) packing method, is employed to realize a 3D packing of the boxes.
4+
5+
*For a detailed description of the methods and background have a look at the project [report](https://github.com/Nivedha-Ramesh/Container-Loading-Problem/blob/master/Report.pdf).*
6+
7+
![True Solution](https://github.com/Nivedha-Ramesh/Container-Loading-Problem/blob/master/True%20Solution.png)
8+
9+
10+
![Rank 1 solution](https://github.com/Nivedha-Ramesh/Container-Loading-Problem/blob/master/Rank1%20Solution.png)
11+
12+
13+
![FitnessTrend](https://github.com/Nivedha-Ramesh/Container-Loading-Problem/blob/master/Fitness%20Variation.png)
14+
15+
16+
![Pareto Front](https://github.com/Nivedha-Ramesh/Container-Loading-Problem/blob/master/image%20(6).png)

0 commit comments

Comments
 (0)