Solving Capacitated Location Routing Problem by Variable Neighborhood Descent and GA-Artificial Neural Network Hybrid Method
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.
 Drexl M. Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research. 2013;227(2): 275-283.
 Duhamel C, Lacomme P, Prins C, Prodhon C. A GRASP×ELS approach for the capacitated location-routing problem. Computers & Operations Research. 2010;37(11): 1912-1923.
 Escobar JW. Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem. 4OR. 2014;12(1): 99.
 Chen HL, Yang B, Wang G, Liu J, Xu X, Wang SJ, Liu DY. A novel bankruptcy prediction model based on an adaptive fuzzy k-nearest neighbor method. Knowledge-Based Systems. 2011;24(8): 1348-1359.
 Kadiyala A, Kaur D, Kumar A. Development of hybrid genetic-algorithm-based neural networks using regression trees for modeling air quality inside a public transportation bus. Journal of the Air & Waste Management Association. 2013;63(2): 205-218.
 Pekel E, Soner Kara S. Passenger Flow Prediction Based on Newly Adopted Algorithms. Applied Artificial Intelligence. 2017;31(1): 64-79.
 Prodhon C, Prins C. A survey of recent research on location-routing problems. European Journal of Operational Research. 2014;238(1): 1-17.
 Jarboui B, Derbel H, Hanafi S, Mladenović N. Variable neighborhood search for location routing. Computers & Operations Research. 2013;40(1): 47-57.
 Hansen P, Mladenović N. Variable neighbourhood search. Handbook of metaheuristics. Boston, Dordrecht, London: Kluwer Academic Publisher. 2003; p. 145-184.
 Mladenović N, Hansen P. Variable neighbourhood search. Computers & Operations Research. 1997;24(11): 1097-1100.
 Nikbakhsh E, Zegordi SH. A heuristic algorithm and a lower bound for the two-echelon location-routing problem with soft time window constraints. Scientia Iranica Transaction E: Industrial Engineering. 2010;17(1): 36-47.
 Belenguer J, Benavent E, Prins C, Prodhon C, Calvo RW. A branch-and-cut method for the capacitated location-routing problem. Computers & Operations Research. 2011;38(6): 931-941.
 Riera-Ledesma J, Salazar-González JJ. Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach. Computers & Operations Research. 2012;39(2): 391-404.
 Ponboon S, Qureshi AG, Taniguchi E. Branch-and-price algorithm for the location-routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review. 2016;86: 1-19.
 Marinakis Y, Marinaki M, Migdalas A. A hybrid clonal selection algorithm for the location routing problem with stochastic demands. Annals of Mathematics and Artificial Intelligence. 2016;76(1-2): 121-142.
 Golozari F, Jafari A, Amiri M. Application of a hybrid simulated annealing-mutation operator to solve fuzzy capacitated location-routing problem. The International Journal of Advanced Manufacturing Technology. 2013;67(5-8): 1791-1807.
 Bay SD. Nearest neighbor classification from multiple feature subsets. Intelligent Data Analysis. 1999;3(3): 191-209.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).