Scribd
Upload
4 views1 page

Tutorial 9 - Advanced Search Techniques and Applications

The document outlines Tutorial 9 for COMP2024, focusing on advanced search techniques in bin packing. It includes questions on Policy Matrix Evolution, the differences between 1D offline and online bin packing, and common heuristics used in bin packing problems. Additionally, it provides a practical exercise applying First-Fit and Best-Fit heuristics to a specific bin packing problem with given items and bin capacity.

Uploaded by

Simon Lau Boung Yew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Tutorial 9 - Advanced Search Techniques and Applications

The document outlines Tutorial 9 for COMP2024, focusing on advanced search techniques in bin packing. It includes questions on Policy Matrix Evolution, the differences between 1D offline and online bin packing, and common heuristics used in bin packing problems. Additionally, it provides a practical exercise applying First-Fit and Best-Fit heuristics to a specific bin packing problem with given items and bin capacity.

Uploaded by

Simon Lau Boung Yew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

COMP2024 Spring 2025

Tutorial 9 – Advanced Search Techniques


1. What is Policy Matrix Evolution, and how does it contribute to heuristic generation?

2. Explain the difference between 1D offline and online bin packing.

3. Describe FOUR (4) common heuristics used in bin packing problems.

4. Apply the First-Fit and Best-Fit heuristics to the following bin packing problem:
Items: {4, 8, 5, 1, 7, 6, 1, 4, 2, 2}, Bin Capacity: 10

Prepared by Simon Lau Boung Yew Page 1 of 1

You might also like