A novel approach based on heuristics and a neural network to solve a capacitated location routing problem

TitreA novel approach based on heuristics and a neural network to solve a capacitated location routing problem
Publication TypeJournal Article
Year of Publication2020
AuthorsOudouar, F, Lazaar, M, Miloud, ZEl
JournalSimulation Modelling Practice and Theory
Mots-clésClustering, Location routing problem, Neural network, Optimization, Self-organizing map, Unsupervised learning

In this work, we describe a method to solve the capacitated location-routing problem (CLRP) to minimize the delivery distance for a vehicle. The CLRP consists of locating depots, assigning each customer to one depot, and determining routes. The objective is to minimize the cost (distance). In the locating problem, we use a self-organizing map (SOM) to determine the depots and assign customers to depots. The SOM is an unsupervised learning method with two layers and has proven effective in several research areas, such as clustering. In the routing problem, we use the Clarke and Wright technique to determine routes. In the present work, we propose an improvement of the capacitated self-organizing map (CSOM) to optimize the location of depots and the Or-Opt algorithm to ameliorate the routes obtained by Clarke and Write (CSOM&CW). The numerical results show that the proposed method can meet many benchmarks of small and medium instances. Computational results assess the higher performance of our approach and demonstrate its efficiency in solving large-size instances.




Suivez-nous sur





Avenue Mohammed Ben Abdallah Regragui, Madinat Al Irfane, BP 713, Agdal Rabat, Maroc

  Télécopie : (+212) 5 37 68 60 78

  Secrétariat de direction : 06 61 48 10 97

        Secrétariat général : 06 61 34 09 27

        Service des affaires financières : 06 61 44 76 79

        Service des affaires estudiantines : 06 62 77 10 17 / n.mhirich@um5s.net.ma

        Résidences : 06 61 82 89 77



Education - This is a contributing Drupal Theme
Design by WeebPal.