Applying Mathematical Programming Approach to Design an Optimal Hierarchical P-hub Center network

In this paper, we propose an optimal hierarchical p-hub center network which contains three echelons (central hubs, hubs and nodes). In addition, our problem is a single assignment in second and third levels. Our main objective is minimization of maximum transferring time between origin and destination nodes. Determining locations of both central hubs and hubs, we show how to dispatch flow throughout the network. Also, we apply a mathematical programming approach for the proposed problem. Effectiveness and validation of our model are illustrated by numerical example.

کلیدواژه ها:

p-hub center problem ، location-allocation ، hierarchical network ، minimax type problem