چکیده:
This paper presents a new robust mathematical model for the multi-product capacitated single allocation hub location problem with maximum covering radius. The objective function of the proposed model minimizes the cost of establishing hubs, the expected cost of preparing hubs for handling products, shipping and transportation in all scenarios, and the cost variations over different scenarios. In the proposed model, a single product of a single node cannot be allocated to more than one hub, but different products of one node can be allocated to different hubs. Also, a product can be allocated to a hub only if equipment related to that product is installed on that hub. Considering the NP-Hard complexity of this problem, a GA-based meta-heuristic algorithm is developed to solve the large-scale variants of the problem. To evaluate the performance of the proposed algorithm, its results are compared with the results of the exact method and simulated annealing algorithm. These results show the good performance of the proposed algorithm.
خلاصه ماشینی:
com A New Robust Mathematical Model for the Multi-product Capacitated Single Allocation Hub Location Problem with Maximum Covering Radius Mahdi Alinaghiana,*, S.
Reza Madania and Hossain Moradia a Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran Abstract This paper presents a new robust mathematical model for the multi-product capacitated single allocation hub locationproblem with maximum covering radius.
In summary, innovations of this study include incorporation of covering radius into multi- product capacitated single-allocation hub location problem, incorporation of data uncertainty and development of a robust model for the proposed Corresponding author email address: alinaghian@cc.
In the remainder of this paper, Section 2 reviews the previous studies on hub location problem, Section 3 describes the proposed robust model, Section 4 presents the proposed solution methods, Section 5 evaluates the performance of the proposed algorithms, and Section 6 concludes the paper.
, & Yaman developed a linear mixed integer programming formulations using a minimax criteria for the robust uncapacitated multiple allocation p-hub median problem under polyhedral demand uncertainty and utilized two Benders decomposition based exact solution algorithms in order to solve large-scale instances of the problems (Meraklı, M.
, & Yaman in another research presented a mathematical formulation of a capacitated multiple allocation hub location problem with hose demand uncertainty and utilized an algorithm to solve the dual sub problem using complementary slackness (Meraklı, M.
, (2000) "The capacitated multiple allocation hub location problem: Formulations and algorithms", European Journal of Operational Research, Vol. 120, pp.