: Since many years ago finding a good location was struggling for human beings. Therefore hub location problems as one of the location problem zones is taking more attention of researchers during last decades. Hubs are nodes (stations, airports, post offices,… in a graph (network) that receive traffic (mail, phone calls, passengers, etc.) from different origins (nodes) and redirect this traffic directly to the destination nodes (when a link exists) or to other hubs. Hub location problems first specifies which nodes to be hubs and the allocate non-hub nodes to hub nodes. Hub maximal covering location problem is the one which is issued in this thesis. This problem considers a coverage distance for hub nodes to cover non-hub nodes and maximizes the flow between nodes in the network. To the best of our knowledge all other hub maximal covering problems have been considered only a single objective function and covering parameter is considered as a primal and definite parameter. In this thesis a multi-objective model is presented which maximizes the flows between nodes, minimizes distance traveling between nodes and minimizes number of vehicles and servers in hub nodes for serving other hub or non-hub nodes. It seems logical that by increasing maximal coverage distance and therefore nodes which could receive and send flows, minimizing distance which is traveled between nodes is necessary. From the other aspect optimizing number of servers and vehicles which are servicing in hub nodes by considering high cost in these areas is vital. In this study for solving the model which was presented in small samples an exact solution and for medium and large instances by considering the run times of exact solutions, NSGA-II algorithm is being used. Numerical instances show the efficiency of the used algorithm.