A Study on Greedy Technique in Container Loading Problem and Knapsack Problem

The main aim of the paper is to use application of greedy algorithm in container loading problem and Knapsack problem. Greedy method gives an optimal solution to the problem by considering the inputs one at a time, checking to see if it can be included in the set of values which give an optimal solution and then check if it is the feasible solution. The Greedy algorithm could be understood very well with a well-known problem referred to as container loading problem and Knapsack problem. The basic Container Loading Problem can be defined as the problem of placing a set of boxes into the container respecting the geometric constraints: the boxes cannot overlap and cannot exceed the dimensions of the container. The knapsack problem is in combinatorial optimization problem. It appears as a sub problem in many, more complex mathematical models of real world problems.