Dr. A. Ghodratnama, Prof. R. Tavakkoli-Moghaddam, Dr. A. Ghodratnama Baboli Vahdani, Mr. B. Vahdani,
Volume 25, Issue 4 (10-2014)
Abstract
Hub location-allocation problems are currently a subject of keen interest in the research community. However, when this issue is considered in practice, significant difficulties such as traffic, commodity transportation and telecommunication tend to be overlooked. In this paper, a novel robust mathematical model for a p-hub covering problem, which tackles the intrinsic uncertainty of some parameters, is investigated. The main aim of the mathematical model is to minimize costs involving: 1) the covering cost 2) the sum of the transportation costs 3) the sum of the opening cost of facilities in the hubs 4) the sum of the reopening cost of facilities in hubs 5) the sum of the activating cost facilities in hubs and 6) the sum of the transporters' purchasing cost. To solve this model, use has been made of the new extensions to the robust optimization theory. To evaluate the robustness of the solutions obtained by the novel robust optimization approach, they are compared to those generated by the deterministic mixed-integer linear programming (MILP) model for a number of different test problems. Finally, the conclusions are presented.
Dr. Yahia Zare Mehrjerdi, Amir Ebrahimi Zade, Dr. Hassan Hosseininasab,
Volume 26, Issue 3 (9-2015)
Abstract
Abstract One of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. Practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. Change in problem parameters during the planning horizon is one of the key factors causing the results of theoretical models to be impractical in real world situations. To dissolve this problem in this paper a mathematical model for dynamic single allocation hub covering problem is proposed in which the covering radius of hub nodes is one of the decision variables. Also Due to NP-Hardness of the problem and huge computational time required to solve the problem optimally an effective genetic algorithm with dynamic operators is proposed afterwards. Computational results show the satisfying performance of the proposed genetic algorithm in achieving satisfactory results in a reasonable time. Keywords: hub location problem, dynamic hub covering problem, flexible covering radius, dynamic genetic algorithm.