Multitasking hub location considering the risk of transportation in the rail network using the non-dominated ranking genetic algorithm
Multitasking hub location considering the risk of transportation in the rail network using the non-dominated ranking genetic algorithm
Elnaz Elmi1 Mohammadreza Frajzadeh2
1) Master s graduate, Islamic Azad University, Science and Research Branch
2) Master s graduate, Ghazali Institute of Higher Education
IOI Code
:
XCCZ-FGGFK
Publication :
10th International Conference on Recent Advances in Industrial Management and Engineering(mieconf.ir)
Abstract :
Abstract
Hub Location Problems Following the location of the hub facility and allocation of demand points to the hub so that the goals of the designers are met. It is rail. In this study, a new mathematical model based on the conditions and situation in the country for locating hubs for products in Iran is presented. Due to the complexity of the model and the inability of existing softwares such as Gamz to solve difficult optimization problems, the genetic algorithm for underestimating rankings (NRGA) was used. In this study, 15 problems were used to test the algorithm. The size of these issues was designed based on the issues in the literature, from small to large, and the number of nodes from 8 to 100 areas and the number of hubs from 4 to 30 were selected. The first 5 issues are designed in small size, the second 5 issues are designed in medium size and the last 5 issues are designed in large size. There are three modes of rail, air and land transportation, and the maximum number of reusable hubs is 0.75. The results showed that as the number of centers that can be opened can be increased, the values of the cost function function increase but the reliability increases. But with increasing maximum number of reusable hubs, the cost increases. Also, by increasing the time required for the transfer, the values of the objective function reduce the cost and increase the amount of reliability
Keywords : hub location transportation risk non dominated rating genetic algorithm