The time-dependent multi-depot fleet size and mix green vehicles routeing problem: improved adaptive large neighbourhood search

Basit Öğe Kaydı
dc.authoridErfan Babaee Tirkolaee / 0000-0003-1664-9210en_US
dc.authorscopusidErfan Babaee Tirkolaee / 57196032874
dc.authorwosidErfan Babaee Tirkolaee / U-3676-2017
dc.contributor.authorAlinaghian, Mahdi
dc.contributor.authorJamshidian, Maryam
dc.contributor.authorTirkolaee, Erfan Babaee
dc.date.accessioned2021-12-27T13:29:55Z
dc.date.available2021-12-27T13:29:55Z
dc.date.issued2021en_US
dc.departmentİstinye Üniversitesi, Mühendislik ve Doğa Bilimleri Fakültesi, Endüstri Mühendisliği Bölümüen_US
dc.description.abstractThis study presents a mathematical model for the multi-depot Time-Dependent Fleet Size and Mix Green Vehicles Routeing Problem (TD-FSMGVRP). The objective function of the developed model is to minimize the total cost including vehicles' fixed cost, drivers' cost, fuel costs, and costs of Greenhouse Gas (GHG) emission. Fleet composition, load, vehicle speed, road slope, and traffic are considered as factors affecting the produced pollution. Considering the NP-Hard complexity of this problem, an Improved Adaptive Large Neighbourhood Search (IALNS) algorithm is designed to treat the problem efficiently. The performance of the proposed algorithm is enhanced using the Taguchi design method. Finally, Adaptive Large Neighbourhood Search (ALNS) algorithm and Variable Neighbourhood Search (VNS) algorithm are considered as two well-known algorithms to test the efficiency of the IALNS algorithm using benchmark problems. Furthermore, a statistical test is conducted to efficiently provide the required comparisons for large-sized problems. It is revealed that the proposed IALNS has a superior performance and can appropriately tackle the problem. Finally, the impacts of the proposed model on cost-saving are evaluated using the proposed IALNS algorithm.en_US
dc.identifier.citationAlinaghian, M., Jamshidian, M., & Tirkolaee, E. B. (2021). The time-dependent multi-depot fleet size and mix green vehicles routeing problem: improved adaptive large neighbourhood search. Optimization, 1-29.en_US
dc.identifier.doi10.1080/02331934.2021.2010078en_US
dc.identifier.issn0233-1934en_US
dc.identifier.scopus2-s2.0-85121575008en_US
dc.identifier.scopusqualityQ1en_US
dc.identifier.urihttps://doi.org/10.1080/02331934.2021.2010078
dc.identifier.uri1029-4945
dc.identifier.urihttps://hdl.handle.net/20.500.12713/2355
dc.identifier.wosWOS:000731485700001en_US
dc.identifier.wosqualityQ1en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.institutionauthorTirkolaee, Erfan Babaee
dc.language.isoenen_US
dc.publisherTAYLOR & FRANCIS LTDen_US
dc.relation.ispartofOPTIMIZATIONen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectTime-Dependent Vehicle Routeing Problemen_US
dc.subjectMultiple Depotsen_US
dc.subjectGreen Vehicle Routeing Problemen_US
dc.subjectImproved Adaptive Large Neighbourhood Searchen_US
dc.subjectVariable Neighborhood Searchen_US
dc.titleThe time-dependent multi-depot fleet size and mix green vehicles routeing problem: improved adaptive large neighbourhood searchen_US
dc.typeArticleen_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
261.pdf
Boyut:
3.5 MB
Biçim:
Adobe Portable Document Format
Açıklama:
Tam Metin / Full Text
Ä°ndir
Lisans paketi
Listeleniyor 1 - 1 / 1
Küçük Resim Yok
Ä°sim:
license.txt
Boyut:
1.44 KB
Biçim:
Item-specific license agreed upon to submission
Açıklama:
Ä°ndir

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Endüstri Mühendisliği Bölümü Makale Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu