Presenting a robust mathematical model for locating the hubs of the post office of Tehran city under uncertainty conditions

This paper presents a robust model for the hub location optimization problem and how each hub is covered in which each of them has capacity. The innovation of this research is to consider the capacity for the hubs as well as presenting an objective function, which is aimed at maximizing the utility and finding the best locations for hubs and allocating non-flood cities to hubs under the coverage constraints. This is a two- objective function problem that converts to a single-objective problem using the weighting method. First, the problem is formulated in deterministic form. Then, with regard to demand and processing time, as non- random variable, it is modeled as robust. Finally, using the data of the post office of Tehran city, the problem will be solved using GAMS software.

Keywords:

Robust optimization , Capacitated Hub covering , p-median , Hub problem