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

Basit Öğe Kaydı
dc.contributor.authorPaksoy, Turan
dc.contributor.authorGüleş, Hasan Kürşat
dc.date.accessioned2017-01-05T09:59:42Z
dc.date.available2017-01-05T09:59:42Z
dc.date.issued2006
dc.description.abstractSupply chain management encompasses a complex business relations 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 entities 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 spanning tree based genetic algorithm approach to a design and optimization of distribution networks problem (which is a combination of multiple-choice Knapsack problem with the capacitated location-allocation problem) in supply chain management is made and optimum combination of genetic operators is searched as an extension of Syarif et al. (2002).en_US
dc.identifier.citationPaksoy, T., Güleş, H. K. (2006). A performance analysis for minimum spanning tree based genetic algorithm approach to design and optimize distribution network problem. Selcuk Journal of Applied Mathematics, 7 (1), 69-93.en_US
dc.identifier.endpage93
dc.identifier.issn1302-7980en_US
dc.identifier.startpage69
dc.identifier.urihttps://hdl.handle.net/20.500.12395/3711
dc.identifier.volume7
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.publisherSelcuk University Research Center of Applied Mathematicsen_US
dc.relation.ispartofSelcuk Journal of Applied Mathematicsen_US
dc.relation.publicationcategoryMakale - Kategori Belirleneceken_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectPerformans analizien_US
dc.subjectPerformance analysisen_US
dc.subjectMinimum kapsayan ağaç tabanlı yaklaşımen_US
dc.subjectMinimum spanning tree based approachen_US
dc.subjectGenetik algoritmalaren_US
dc.subjectGenetic algorithmsen_US
dc.subjectSupply chain managementen_US
dc.subjectTedarik zinciri yönetimien_US
dc.subjectDağıtım ağların dizaynien_US
dc.subjectDesign of distribution networksen_US
dc.subjectDağıtım ağlarının optimizasyonuen_US
dc.subjectOptimization of distribution networksen_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:
167-325-1-SM.pdf
Boyut:
660.6 KB
Biçim:
Adobe Portable Document Format
Açıklama:
Makale
İndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
İsim:
license.txt
Boyut:
1.51 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
İndir

Koleksiyon

Selcuk Journal of Applied Mathematics/ makale koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu