Discussion
This section contains the discussion of the algorithms used and their results. Paragraph 2.1 explains the used algorithms. Paragraph 2.2 is about the experiments done with these algorithms. Paragraph 2.3 deals with the results of these experiments.
2.1 Algorithms used
2.1.1 GreedySolver
The Greedy solver uses the Greedy principle to fill the knapsack. This means that the algorithm always selects the best parcels first. It then puts as much as possible of these parcels in the knapsack. When that is not possible anymore it selects the second best parcel, etc.
For selecting the best parcel it uses two different selection methods. The first one is selecting the parcel with the highest value/volume ratio. The second one is selecting the parcel with the greatest volume.
The algorithm runs two times. The first time the best parcel is the parcel with the highest value/volume ratio. The second time it runs the best parcel is the parcel with the greatest volume.......
Join Now or Login to view the rest of this paper.
Approximate Word Count: 621
Approximate Pages: 3 (260 words per double-spaced page) |