Solving a Multi-Objective Location-Routing Problem with Minimum Cost and Total Time Balance

Setyo Tri Windras Mara ； Anna Maria Sri Asih ； R. J. Kuo

《International Journal of Information and Management Sciences》 30卷3期 (2019/09) Pp. 249-269

https://doi.org/10.6186/IJIMS.201909_30(3).0004

摘要

In transportation activities, providing a workload balance for drivers and vehicles can contribute several benefits for the firm. However, few attention has been paid to the importance of workload balance in location-routing problem (LRP) research. Thus, this study intends to present a mathematical model to solve the multi-objective LRP which addresses this issue. The proposed model considers two objective functions: (1) to minimize the total cost and (2) to balance the workload in distribution activities. The main purposes of this model are to obtain the optimal location of a distribution center, number of vehicles established, and delivery routes which satisfy both of these two objectives. Furthermore, to solve the model, this study proposes the non-dominated sorting genetic algorithm-II (NSGA-II) for several problem scenarios with different numbers of customers. The experimental results show that the proposed algorithm performs well in terms of quality and computational time of the solution.

關鍵字

Location-Routing Problem (LRP) ； multi-objective ； workload balance ； total time difference ； NSGA-II

參考文獻

Adra, S. F. and Fleming, P. J. (1999). Diversity management in evolutionary many-objective opti- mization, IEEE Transactions on Evolutionary Computation, Vol.15, No.2, 183-195.

Christofides, N. and Eilon, S. (1969). An algorithm for the vehicle-dispatching problem, Operational Research Quarterly, Vol.20, No.3, 309-318.

Collette, Y. and Siarry, P. (2005). Three new metrics to measure the convergence of metaheuris- tics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization, Computers & Operations Research, Vol.32, no.4, 773-792.

Corne, D. W., Knowles, J. D. and Oates, M. J. (2000). The Pareto envelope-based selection algo- rithm for multiobjective optimization, In International Conference on Parallel Problem Solving from Nature. Springer, Berlin, Heidelberg, 839-848.

Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, Vol.6, No.2, 182-197.