Please use this identifier to cite or link to this item: http://dspace.univ-relizane.dz/home/handle/123456789/207
Full metadata record
DC FieldValueLanguage
dc.contributor.authoryachba, Khadidja-
dc.contributor.authorbelayachi, naima-
dc.contributor.authorBouamrane, Karim-
dc.date.accessioned2023-03-16T10:13:33Z-
dc.date.available2023-03-16T10:13:33Z-
dc.date.issued2021-
dc.identifier.issnDOI: 10.4018/JGIM.298678-
dc.identifier.urihttp://dspace.univ-relizane.dz/home/handle/123456789/207-
dc.description.abstractIn order to solve the transport problem, a set of bio-inspired meta heuristics are proposed. They are based on the natural behavior of swarms, bees, birds, and ants that emerged as an alternative to overcome the difficulties presented by conventional methods in the field of optimization. In this work, the authors use a hybrid of two optimization methods in order to solve the problem of product distribution from a central warehouse to the different warehouses distributed in different cities. The optimization of the distribution process is done by identifying through the proposed contribution the optimal path that combines between a minimum distance with a good condition of the path taken. In order to situate the approach proposed in this article, the authors compare the results obtained with the result obtained using ACO without hybridization. The results obtained by hybridizing the two methods, ant colony optimization (ACO) and tabu search (TS), are better.en_US
dc.language.isoenen_US
dc.publisherJournal of Global Information Management (JGIM)en_US
dc.relation.ispartofseries30(8);1-17-
dc.subjectAnt Colony Optimization, Distribution, Hybridization, Logistic, Optimization Methods, Supply Chain, Taboo Research, Transporten_US
dc.titleTS and ACO in Hybrid Approach for Product Distribution Problemen_US
dc.typeArticleen_US
Appears in Collections:Thèses de Doctorat

Files in This Item:
File Description SizeFormat 
article classe A.pdf676.54 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.