Presenting a robust optimization model for the location- routing problem of war equipment coverage hub based on queuing system

In this article, the modeling and solution of a location-routing problem of the war equipment hub based on the queuing system has been discussed. The purpose of presenting this model is to reduce the time of transferring war equipment between trenches and increase the safety of transferring equipment through hubs. Therefore, two important strategic and tactical decisions are made, including the location of hubs, the allocation of trenches to the hub, and the appropriate routing of the transfer of war equipment between trenches. Because the hubs are known as the point of collecting and distributing war equipment, therefore, the queue system has been used to send war equipment and organize it.

In this article, a new algorithm of MOPSO and MOALO is introduced, which has the ability to search more of the solution space. The results of solving the model with the LP-Metrics method show that the use of safe routes far from the reach of the enemy has increased the security of equipment transfer, while the time to send these items has increased. In this situation, the hubs can supply the equipment needed by the trenches that are located in the defined coverage radius.

By solving different numerical examples, MOALPSO showed that it has higher performance than MOALO and MOPSO. While the solution time by this algorithm was much higher than other algorithms. Also, the uncertainty in the demand and the time of the transfer of war equipment led to the use of the optimization method. The results of the sensitivity analysis on the uncertainty rate showed that with the increase of the uncertainty rate, the amount of demand in the nodes has increased and this problem has led to an increase in the waiting time for sending military equipment and thereby reducing security.