H

Heuristics

Implementation of UCS on Romania to find shortest distance from Arad to Bucharest based on best-first search algorithm. It uses a dictionary that stores current city mapped to (parent city, current best distance), and frontier is a priority queue to process nodes containing (node id, current city, priority value).

A new optimisation method for open-shop scheduling with arbitrary constraints based on simulated annealing and genetic algorithms