A performance analysis for minimum spanning tree based genetic algorithm approach to design and optimize distribution network problem

Basit Öğe Kaydı
dc.authorid0000-0001-8051-8560
dc.contributor.authorPaksoy, Turan.
dc.contributor.authorGüleş, Hasan Kürşat.
dc.date.accessioned2020-03-26T17:02:49Z
dc.date.available2020-03-26T17:02:49Z
dc.date.issued2006
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractSupply chain management encompasses a complex business rela­tions network that contains synchronized inter and intra organizational efforts to optimizing forward flow of materials and reverse flow of knowledge through the overall production and distribution system from raw material suppliers to the last customers. Thus, one of the vital issues in supply chain management is design and optimization of a large network consisting of various business enti­ties such as suppliers, manufacturers, distribution centers and customers. In the literature, this design problem is generally defined as non polynomial-hard (NP-hard) and genetic algorithm approach is one of the popular solution methods for the problem. From this point of view, in this study, performance analysis for minimum span­ning based genetic algorithm approach to a design and optimization of distri­bution networks problem (which is a combination of multiple-choice Knapsack problem with the capacitated location-allocation problem) in supply chain man­agement is made and optimum combination of genetic operators is searched. 162 experimentations are made by a genetic algorithm based program written in Borland Delphi 6.0. The program is run 972 times and as a result of experi­mentations, optimum combination is determined as elitist tournament /partially matching (PMX) for the problem. Furthermore, there is no statistical differ­ence at p <0.05 significance level between two mutation operators, which are analyzed. Also, 50x1500 is found as optimum for the combination of population size-generation number.en_US
dc.identifier.endpage93en_US
dc.identifier.issn1302-7980en_US
dc.identifier.issue1en_US
dc.identifier.startpage69en_US
dc.identifier.urihttp://www.trdizin.gov.tr/publication/paper/detail/TmpVNU16RXg=
dc.identifier.urihttps://hdl.handle.net/20.500.12395/20217
dc.identifier.volume7en_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.relation.ispartofTürkiye Klinikleri Psikiyatri Dergisien_US
dc.relation.publicationcategoryMakale - Ulusal Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectMatematik, Genetic Algorithms, Performance Analysis.en_US
dc.titleA performance analysis for minimum spanning tree based genetic algorithm approach to design and optimize distribution network problemen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
1..pdf
Boyut:
660.6 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale Dosyası
İndir

Koleksiyon

TR-Dizin İndeksli Yayınlar Koleksiyonu