A Study on Greedy Technique in Container Loading Problem and Knapsack Problem
DOI:
https://doi.org/10.32628/IJSRST218389Keywords:
Greedy Method, Container Loading Problem, Knapsack ProblemAbstract
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.
References
- “Operational Research in the British Army 1939–1945”, October 1947, Report C67/3/4/48, UK National Archives file WO291/1301
- “Operations research (industrial engineering) :: History – Britannica Online En- cyclopedia”. Britannica.com. Retrieved 13 November 2011.
- Black, Paul E. (2 February 2005). ”greedy algorithm”. Dictionary of Algorithms and Data Structures. U.S. National Institute of Standards and Technology (NIST). Re- trieved 17 August 2012.
Downloads
Published
Issue
Section
License
Copyright (c) IJSRST

This work is licensed under a Creative Commons Attribution 4.0 International License.