Solving Capacitated Location Routing Problem by Variable Neighborhood Descent and GA-Artificial Neural Network Hybrid Method

• Main Authors: Engin Pekel, Selin Soner Kara
• Format: Article
• Language: English
• Published: University of Zagreb, Faculty of Transport and Traffic Sciences 2018-11-01
• Series: Promet (Zagreb)
• Subjects: artificial neural network; capacitated location-routing problem; genetic algorithm; heuristics; k-nearest neighborhood; variable neighborhood descent
• Online Access: https://traffic.fpz.hr/index.php/PROMTT/article/view/2640

This paper aims to find the optimal depot locations and vehicle routings for spare parts of an automotive company considering future demands. The capacitated location-routing problem (CLRP), which has been practiced by various methods, is performed to find the optimal depot locations and routings by additionally using the artificial neural network (ANN). A novel multi-stage approach, which is performed to lower transportation cost, is carried out in CLRP. Initially, important factors for customer demand are tested with an univariate analysis and used as inputs in the prediction step. Then, genetic algorithm (GA) and ANN are hybridized and applied to provide future demands. The location of depots and the routings of the vehicles are determined by using the variable neighborhood descent (VND) algorithm. Five neighborhood structures, which are either routing or location type, are implemented in both shaking and local search steps. GA-ANN and VND are applied in the related steps successfully. Thanks to the performed VND algorithm, the company lowers its transportation cost by 2.35% for the current year, and has the opportunity to determine optimal depot locations and vehicle routings by evaluating the best and the worst cases of demand quantity for ten years ahead.