A modified micro-genetic algorithm for robust emergency system designing

We study a robust emergency system in a transport network where it is necessary to solve a problem of finding p service centers for randomly emergency demands in nodes. The objective of our problem is to minimize the upper bound of partial object functions for given number of detrimental scenarios. Transport network is modelled in a matrix form i.e elements of the matrix are response times from a potential service center to a location of an user. Such matrix is given for every detrimental scenario. At last every location is given a number of shared users. We present modified micro-genetic algorithm on the instance of transport network of Slovak Republic. We verify it in selected regions of network via comparing it to known exact solutions. We also seek an approximate solution for a total network.