Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorKocaoğlu, Yasemin
dc.contributor.authorÇakmak, Emre
dc.contributor.authorKocaoğlu, Batuhan
dc.contributor.authorGümüş, Alev
dc.date.accessioned2021-06-05T19:56:44Z
dc.date.available2021-06-05T19:56:44Z
dc.date.issued2020
dc.identifier.issn1024-123X
dc.identifier.issn1563-5147
dc.identifier.urihttps://doi.org/10.1155/2020/3943798
dc.identifier.urihttps://hdl.handle.net/20.500.12960/353
dc.description0000-0003-1803-9408en_US
dc.description0000-0002-3406-3144en_US
dc.descriptionWOS:000522079100001en_US
dc.description.abstractManaging the distribution of goods is a vital operation for many companies. A successful distribution system requires an effective distribution strategy selection and optimum route planning at the right time and minimum cost. Furthermore, customer's demand and location can vary from order to order. In this situation, a mixed delivery system is a good solution for it and allows the use of different strategies together to decrease delivery costs. Although the "distribution strategy selection" is a critical issue for companies, there are only a few studies that focus on the mixed delivery network problem. There is a need to propose an efficient solution for the mixed delivery problem to guide researchers and practitioners. This paper develops a new "modified" savings-based genetic algorithm which is named "distribution strategy selection and vehicle routing hybrid algorithm (DSSVRHA)." Our new algorithm aims to contribute to the literature a new hybrid solution to solve a mixed delivery network problem that includes three delivery modes: "direct shipment," "milk run," and "cross-docking" efficiently. It decides the appropriate distribution strategy and also optimal routes using a heterogeneous fleet of vehicles at minimum cost. The results of the hybrid algorithm are compared with the results of the optimization model. And the performance of the hybrid algorithm is validated with statistical analysis. The computational results reveal that our developed algorithm provides a good solution for reducing the supply chain distribution costs and computational time.en_US
dc.language.isoengen_US
dc.publisherHindawi Ltden_US
dc.relation.ispartofMathematical Problems in Engineeringen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.subject[No Keywords]en_US
dc.titleA Novel Approach for Optimizing the Supply Chain: A Heuristic-Based Hybrid Algorithmen_US
dc.typearticleen_US
dc.departmentİktisadi ve İdari Bilimler Fakültesi, Lojistik Yönetimi Bölümüen_US
dc.departmentİktisadi ve İdari Bilimler Fakültesi, Yönetim Bilişim Sistemleri Bölümüen_US
dc.department-temp[Kocaoglu, Yasemin; Gumus, Alev] Yildiz Tech Univ, Ind Engn, TR-34349 Istanbul, Turkey; [cakmak, Emre] Piri Reis Univ, Int Logist & Transportat, TR-34940 Istanbul, Turkey; [Kocaoglu, Batuhan] Piri Reis Univ, Management Informat Syst, TR-34940 Istanbul, Turkeyen_US
dc.contributor.institutionauthorÇakmak, Emre
dc.contributor.institutionauthorKocaoğlu, Batuhan
dc.identifier.doi10.1155/2020/3943798
dc.identifier.volume2020en_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster