Chakat Chueadee, P. Kriengkorakot, Nuchsara Kriengkorakot
{"title":"MDEALS解决泰国呵叻府陆港木薯淀粉物流网络问题","authors":"Chakat Chueadee, P. Kriengkorakot, Nuchsara Kriengkorakot","doi":"10.3390/logistics6040072","DOIUrl":null,"url":null,"abstract":"Background: This research aimed to establish a network linked to generation, for the transport route of tapioca starch products to a land port, serving as the logistics hub of Thailand’s Nakhon Ratchasima province. Methods: The adaptive large neighborhood search (ALNS) algorithm, combined with the differential evolution (DE) approach, was used for the problem analysis, and this method was named modified differential evolution adaptive large neighborhood search (MDEALNS) is a new method that includes six steps, which are (1) initialization, (2) mutation, (3) recombination, (4) updating with ALNS, (5) Selection and (6) repeat the (2) to (5) steps until the termination condition is met. The MDEALNS algorithm designed a logistics network linking the optimal route and a suitable open/close factory allocation with the lowest transport cost for tapioca starch. The operating supply chain of tapioca starch manufacturing in the case study. The proposed methods have been tested with datasets of the three groups of test instances and the case study consisted of 404 farms, 33 factories, and 1 land port. Results: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS. Conclusions: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS.","PeriodicalId":56264,"journal":{"name":"Logistics-Basel","volume":null,"pages":null},"PeriodicalIF":3.6000,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MDEALNS for Solving the Tapioca Starch Logistics Network Problem for the Land Port of Nakhon Ratchasima Province, Thailand\",\"authors\":\"Chakat Chueadee, P. Kriengkorakot, Nuchsara Kriengkorakot\",\"doi\":\"10.3390/logistics6040072\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Background: This research aimed to establish a network linked to generation, for the transport route of tapioca starch products to a land port, serving as the logistics hub of Thailand’s Nakhon Ratchasima province. Methods: The adaptive large neighborhood search (ALNS) algorithm, combined with the differential evolution (DE) approach, was used for the problem analysis, and this method was named modified differential evolution adaptive large neighborhood search (MDEALNS) is a new method that includes six steps, which are (1) initialization, (2) mutation, (3) recombination, (4) updating with ALNS, (5) Selection and (6) repeat the (2) to (5) steps until the termination condition is met. The MDEALNS algorithm designed a logistics network linking the optimal route and a suitable open/close factory allocation with the lowest transport cost for tapioca starch. The operating supply chain of tapioca starch manufacturing in the case study. The proposed methods have been tested with datasets of the three groups of test instances and the case study consisted of 404 farms, 33 factories, and 1 land port. Results: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS. Conclusions: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS.\",\"PeriodicalId\":56264,\"journal\":{\"name\":\"Logistics-Basel\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":3.6000,\"publicationDate\":\"2022-10-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Logistics-Basel\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3390/logistics6040072\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MANAGEMENT\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Logistics-Basel","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3390/logistics6040072","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MANAGEMENT","Score":null,"Total":0}
MDEALNS for Solving the Tapioca Starch Logistics Network Problem for the Land Port of Nakhon Ratchasima Province, Thailand
Background: This research aimed to establish a network linked to generation, for the transport route of tapioca starch products to a land port, serving as the logistics hub of Thailand’s Nakhon Ratchasima province. Methods: The adaptive large neighborhood search (ALNS) algorithm, combined with the differential evolution (DE) approach, was used for the problem analysis, and this method was named modified differential evolution adaptive large neighborhood search (MDEALNS) is a new method that includes six steps, which are (1) initialization, (2) mutation, (3) recombination, (4) updating with ALNS, (5) Selection and (6) repeat the (2) to (5) steps until the termination condition is met. The MDEALNS algorithm designed a logistics network linking the optimal route and a suitable open/close factory allocation with the lowest transport cost for tapioca starch. The operating supply chain of tapioca starch manufacturing in the case study. The proposed methods have been tested with datasets of the three groups of test instances and the case study consisted of 404 farms, 33 factories, and 1 land port. Results: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS. Conclusions: The computational results show that MDEALNS method can reduced the distance and the fuel cost and outperformed the highest performance of the original method used by LINGO, DE, and ALNS.