0% found this document useful (0 votes)
7 views1 page

Tutorial 9 - Advanced Search Techniques and Applications

The document outlines a tutorial on advanced search techniques for COMP2024 in Spring 2025. It includes questions on Policy Matrix Evolution, differences between 1D offline and online bin packing, common heuristics used in bin packing, and a practical application of First-Fit and Best-Fit heuristics. The tutorial is prepared 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 DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views1 page

Tutorial 9 - Advanced Search Techniques and Applications

The document outlines a tutorial on advanced search techniques for COMP2024 in Spring 2025. It includes questions on Policy Matrix Evolution, differences between 1D offline and online bin packing, common heuristics used in bin packing, and a practical application of First-Fit and Best-Fit heuristics. The tutorial is prepared 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 DOCX, 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