SEARCH WITHIN CONTENT
Štefan PEŠKO / Tomáš MAJER
Citation Information : Transport Problems. Volume 10, Issue 3, Pages 125-130, DOI: https://doi.org/10.21307/tp-2015-040
License : (CC BY-SA 4.0)
Published Online: 21-April-2017
The robust p-median problem in changing networks is a version of known discrete p-median problem in network with uncertain edge lengths where uncertainty is characterised by given interval. The uncertainty in edge lengths may appear in travel time along the edges in any network location problem. Several possible future scenarios with respect to the lengths of edges are presented. The planner will want a strategy of positioning p medians that will be working “as well as possible" over the future scenarios. We present MILP formulation of the problem and the solution method based on exchange MILP heuristic. The cluster of each median is presented by rooted tree with the median as root. The performance of the proposed heuristic is compared to the optimal solution found via Gurobi solver for MILP models through some illustrative instances of Slovak road network in Ţilina.