# Heuristic methods for solving the p-median problem

**URL:** <https://discourse.julialang.org/t/heuristic-methods-for-solving-the-p-median-problem/14022>\
**Category:** Optimization (Mathematical)\
**Created:** [August 25, 2018, 3:00am UTC](https://discourse.julialang.org/t/heuristic-methods-for-solving-the-p-median-problem/14022 "2018-08-25T03:00:52Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![Stuart\_Rogers](https://sea2.discourse-cdn.com/julialang/user_avatar/discourse.julialang.org/stuart_rogers/32/10694_2.png) [@Stuart\_Rogers](https://discourse.julialang.org/u/Stuart_Rogers)\
**Post date:** [August 25, 2018, 3:00am UTC](https://discourse.julialang.org/t/heuristic-methods-for-solving-the-p-median-problem/14022/1 "2018-08-25T03:00:53Z")

</div>

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](https://github.com/chkwon/jpor_codes/blob/master/chap9/p-median.jl)