Clustering-based NSGA-II on Multi-Objective Location-Routing Problem

Main Article Content

Rafi Naufal Al Mochtari Pohan
Anna Maria Sri Asih


Determining facility locations and planning routes for efficient goods/materials distribution in the supply chain, known as the location-routing problem (LRP), poses a significant challenge in logistics. This research focuses on developing a method to achieve desirable outcomes in LRP with soft time windows by integrating clustering techniques with the NSGA-II algorithm. A case study is conducted to optimize commodities distribution in D.I Yogyakarta, Indonesia using the proposed method. The study demonstrates how clustering can enhance the results of the multi-objective location-routing problem with time windows (MLRPTW) through analysis. The solution set reveals that the clustering-based NSGA-II outperforms the classical approach in terms of both objective functions (cost minimization and service level maximization). By grouping retailers based on similarities in location and opening time windows, the method improved population initialization, resulting lower distribution center (DC) costs and higher retailer satisfaction. Retailers within the same cluster tend to share the same DC, which is closer in proximity, also tend to have similarity in terms of working hours (time windows). Moreover, incorporating clustering within NSGA-II decreases the computational time which is preferable by decision maker. We also explored and compared k-medoids as a clustering method alternative, the result shows there is no significant improvement compared to k-means.

Article Details

How to Cite
R. N. A. M. Pohan and Anna Maria Sri Asih, “Clustering-based NSGA-II on Multi-Objective Location-Routing Problem”, J. Ind. Eng. Edu., vol. 1, no. 2, pp. 97–113, Sep. 2023.


C. A. C. Coello, A. H. Aguirre, and E. Zitzler, Evolutionary multi-criterion optimization. Springer-Verlag Berlin/Heidelberg, 2005.

DevTech Systems. "Achieving Economic Growth Through Improved Export Logistics in Indonesia," 2022. [Online]. Available: [Accessed: May 14, 2023].

EKA Logistics, "80 Percent of Logistics Activities in Tanjung Priok Still Rely on Land Transport," EKA Logistics, 2019. [Online]. Available: [Accessed: May 14, 2023].

F. D. Pradana, "Aplikasi Multi-Objective Linear Programming dan Geographic Information System (GIS) untuk Analisis Potensi Lokasi Pusat Distribusi, Skripsi Departemen Teknik Mesin dan Industri," 2015.

G. Nagy and S. Salhi, "Location-routing: Issues, models and methods," European Journal of Operational Research, vol. 177, no. 2, pp. 649-672, 2007.

Guerrero, J. C., & Díaz-Ramírez, J. (2017). A review on transportation last-mile network design and urban freight vehicles. In Proceedings of the 2017 International Conference on Industrial Engineering and Operations Management.

H. Liu, W. Wang, and Q. Zhang, "Multi‐objective location‐routing problem of reverse logistics based on GRA with entropy weight," Grey Systems: Theory and Application, 2012.

Ismail, Ra-ees, and Osden Jokonya. "Factors Affecting the Adoption of Emerging Technologies in Last-Mile Delivery in the Retail Industry." Procedia Computer Science 219 (2023): 2084-2092.

J. Hosoda and T. Irohara, "A Clustering Algorithm for Location Routing Problem with Outsourced Delivery," Proceedings of the International Conference on Industrial Engineering and Operations Management Pilsen, Czech Republic, 2019.

K. E. Parsopoulos and M. N. Vrahatis, "Particle swarm optimization method in multiobjective problems," in Proceedings of the 2002 ACM symposium on Applied computing, 2002.

Kolen, A.W.J., Rinnooy Kan, A.H.G. and Trienekens, H.W.J.M., 1987, Vehicle routing with time windows, Operations Research, vol. 35, no. 2, pp. 266-273

L. Celine, "Optimasi Multi-Objective Location Routing Problem yang Mempertimbangkan Service Level dengan Menggunakan Metode NSGA-II, Skripsi Departemen Teknik Industri," 2020.

M. Drexl and M. Schneider, "A survey of variants and extensions of the location-routing problem," European Journal of Operational Research, vol. 241, no. 2, pp. 283-308, 2015.

M. Gharavani and M. Setak, "A capacitated location routing problem with semi soft time windows," Advanced Computational Techniques in Electromagnetics, vol. 1, pp. 26-40, 2015.

M. H. F. Zarandi et al., "Capacitated location-routing problem with time windows under uncertainty," Knowledge-Based Systems, vol. 37, pp. 480-489, 2013.

N. A. Dharmika, "Multi-Objective Location Routing Problem with Time Windows dengan Tujuan Mengoptimalkan Biaya dan Service Level, Skripsi Departemen Teknik Mesin dan Industri," 2019.

P. Pongcharoen et al., "Determining optimum genetic algorithm parameters for scheduling the manufacturing and assembly of complex products," International Journal of Production Economics, vol. 78, no. 3, pp. 311-322, 2002.

R. Kothari and D. Pitts, "On finding the number of clusters," Pattern Recognition Letters, vol. 20, no. 4, pp. 405-416, 1999.

R. Parayoga and A. M. S. Asih, "Empirical Study of MOPSO and NSGA II comparison in multi-objective location routing problem incorporating the service level of delivery."

S. C. Maruti, "Penentuan Lokasi Pusat Distribusi, Moda Transportasi dan Rute dengan Multi-Objective Location Routing Problem Menggunakan Metode NSGA-II, Skripsi Departemen Teknik Mesin dan Industri," 2017.

S. Nanjundan et al., "Identifying the number of clusters for K-Means: A hypersphere density based approach," arXiv preprint arXiv:1912.00643, 2019.

S. Shah and M. Singh, "Comparison of a time efficient modified K-mean algorithm with K-mean and K-medoid algorithm," in 2012 International Conference on Communication Systems and Network Technologies, 2012.

S. T. Mara, R. J. Kuo, and A. M. Asih, “Location‐routing problem: A classification of recent research,” International Transactions in Operational Research, vol. 28, no. 6, pp. 2941–2983, 2021. doi:10.1111/itor.12950

Semet, F., Taillard, E., 1993. Solving real-life vehicle routing problems efficiently using tabu search. Annals ofOperations Research 41, 4, 469–488.

World Bank, "Logistics Performance Index," The World Bank, 2021. [Online]. Available: [Accessed: May 14, 2023].

X. Hu and R. Eberhart, "Multiobjective optimization using dynamic neighborhood particle swarm optimization," in Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No. 02TH8600), vol. 2, 2002.

X. Hu and R. Eberhart, "Multiobjective optimization using dynamic neighborhood particle swarm optimization," in Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), Honolulu, HI, USA, 2002, pp. 1677-1681 vol.2, doi: 10.1109/CEC.2002.1004494.

Y. Wang et al., "Two-echelon location-routing optimization with time windows based on customer clustering," Expert Systems with Applications, vol. 104, pp. 244-260, 2018.

Zarandi, M. H. F., Alinaghian, M., & Hajiaghaei-Keshteli, M. (2013). Capacitated location-routing problem with time windows under uncertainty. Knowledge-Based Systems, 37, 480-489.