Kernighan-Lin and Fiduccia-Mattheyses Heuristics Kernighan-Lin Heuristic: This heuristic is used for floorplanning, where the goal is to place a set o...
Kernighan-Lin and Fiduccia-Mattheyses Heuristics
Kernighan-Lin Heuristic:
This heuristic is used for floorplanning, where the goal is to place a set of objects (e.g., workstations, servers) on a rectangular grid of cells while minimizing the number of empty cells.
The heuristic works by assigning a score to each cell in the grid based on its size, distance to the nearest obstacles, and the number of cells it would leave empty if filled.
Cells with high scores are considered more suitable for placement.
Fiduccia-Mattheyses Heuristic:
This heuristic is used for both floorplanning and 2D placement problems, where the goal is to place a set of objects on a grid of cells while minimizing the total distance between objects.
The heuristic works by assigning a score to each cell in the grid based on its location, size, and the number of cells it would leave empty if filled.
Cells with high scores are considered more suitable for placement.
Example:
Kernighan-Lin Heuristic: Place objects of different sizes on a grid, starting from the corners and working your way inwards. Leave as few empty cells as possible.
Fiduccia-Mattheyses Heuristic: Place objects of different sizes on a grid, placing them as far apart as possible while leaving as few empty cells as possible