the algorithms are of your choice. for example, you may use any of the general purpose heuristic optimization algorithms from the course material, including, but not limited to, branch and bound, simulated annealing, greedy local search, tabu search, genetic algorithm etc. or, you can use any other algorithm that you may find by searching the literature, or you may create your own heuristic algorithms.
