a robust optimization approach for a multi-period location-arc routing problem with time windows: a case study of a bank

A location-arc routing problem (larp) is a practical problem, while a few mathematical programming models have been considered for this problem. in this paper, a mixed non-linear programming model is presented for a multi-period larp with the time windows under demand uncertainty. the time windows modeling in the arc routing problem is rarely. to the best our knowledge, it is the first time that the robust larp model is verified and an optimal solution is presented for it. for this purpose, the cplex solver is used for solving the treasury location problems of a bank as a case study. these problems are node-based with close nods and can be transformed into arc-based. therefore, the method lrp and larp models can be used to solve these problems. the comparing results of the lrp and larp models prove that the larp has a better performance regarding timing and optimal solution. furthermore, comparing the results of deterministic and robust larp models for this case study shows the validity of the robust optimization approach.