Heuristic methods for solving the p-median problem

Are there any Julia implementations of heuristic methods (e.g. genetic algorithm, simulated annealing, tabu search, variable neighborhood search) for solving the p-median problem? I did find a Lagrangian relaxation implementation: https://github.com/chkwon/jpor_codes/blob/master/chap9/p-median.jl