Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search

With the continuous improvement of people&#8217;s living standards and their increasing demand for fresh food, the cold chain logistics industry has developed rapidly. One of the biggest challenges to today&#8217;s cold chain logistics is to offer fresh food while minimizing CO<sub>2&l...

Full description

Bibliographic Details
Main Authors: Jing Chen, Pengfei Gui, Tao Ding, Sanggyun Na, Yingtang Zhou
Format: Article
Language:English
Published: MDPI AG 2019-11-01
Series:Sustainability
Subjects:
Online Access:https://www.mdpi.com/2071-1050/11/23/6584
id doaj-0ff68c934e754b2abc5cfe55edaabe1c
record_format Article
spelling doaj-0ff68c934e754b2abc5cfe55edaabe1c2020-11-25T02:22:03ZengMDPI AGSustainability2071-10502019-11-011123658410.3390/su11236584su11236584Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu SearchJing Chen0Pengfei Gui1Tao Ding2Sanggyun Na3Yingtang Zhou4Institute of Innovation & Application, Zhejiang Ocean University, Zhoushan 316022, ChinaSchool of Business Administration, Wonkwang University, Jeonbuk 54538, KoreaSchool of Business Administration, Wonkwang University, Jeonbuk 54538, KoreaSchool of Business Administration, Wonkwang University, Jeonbuk 54538, KoreaInstitute of Innovation & Application, Zhejiang Ocean University, Zhoushan 316022, ChinaWith the continuous improvement of people&#8217;s living standards and their increasing demand for fresh food, the cold chain logistics industry has developed rapidly. One of the biggest challenges to today&#8217;s cold chain logistics is to offer fresh food while minimizing CO<sub>2</sub> emissions. The fresh degree and CO<sub>2</sub> emissions are involved in the vehicle routing optimization problem in the cold chain logistics. In order to meet the quality requirement for fresh agricultural products and low carbon logistics, a novel routing optimization model considering the costs of quality deterioration and carbon emissions (Low Carbon and Freshness Degrees Vehicle Routing Problem (LCFD-VRP)) for cold chain distribution was established in this study. This model takes into account the fixed cost, fuel cost and time window penalty cost. An improved ant colony algorithm (IACA) is used to optimize the whole vehicle distribution routing with its strong global search ability. Tabu Search (TS) algorithm is used to search the single vehicle distribution routing with its good local search ability. An IACA combined with TS (IACATS) was proposed to solve the above LCFD-VRP model. The practicability of the model and the effectiveness of the above improved algorithm are verified using a real case study. The results of Zhoushan Dayang Refrigerated Logistics Co., Ltd. showed that, compared with the traditional algorithm, IACATS could reduce the dispatching of two refrigerated vehicles, thus lowering the total cost by 4.94%, shortening the actual transportation distance by 5.50% and cutting the total CO<sub>2</sub> emissions by 8.9%. Therefore, the LCFD-VRP model can effectively help to achieve the low carbon emissions, multi-variety and low-cost distribution of fresh agricultural products. The proposed model and IACATS algorithm would be used to optimize VRP in cold chain enterprises. The results of this study also provide management suggestions for cold chain enterprises to effectively balance economic cost and environmental cost.https://www.mdpi.com/2071-1050/11/23/6584cold chain logisticsvehicle routing problemimproved ant colony algorithmtabu searchfresh degreeco<sub>2</sub> emissions
collection DOAJ
language English
format Article
sources DOAJ
author Jing Chen
Pengfei Gui
Tao Ding
Sanggyun Na
Yingtang Zhou
spellingShingle Jing Chen
Pengfei Gui
Tao Ding
Sanggyun Na
Yingtang Zhou
Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
Sustainability
cold chain logistics
vehicle routing problem
improved ant colony algorithm
tabu search
fresh degree
co<sub>2</sub> emissions
author_facet Jing Chen
Pengfei Gui
Tao Ding
Sanggyun Na
Yingtang Zhou
author_sort Jing Chen
title Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
title_short Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
title_full Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
title_fullStr Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
title_full_unstemmed Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search
title_sort optimization of transportation routing problem for fresh food by improved ant colony algorithm based on tabu search
publisher MDPI AG
series Sustainability
issn 2071-1050
publishDate 2019-11-01
description With the continuous improvement of people&#8217;s living standards and their increasing demand for fresh food, the cold chain logistics industry has developed rapidly. One of the biggest challenges to today&#8217;s cold chain logistics is to offer fresh food while minimizing CO<sub>2</sub> emissions. The fresh degree and CO<sub>2</sub> emissions are involved in the vehicle routing optimization problem in the cold chain logistics. In order to meet the quality requirement for fresh agricultural products and low carbon logistics, a novel routing optimization model considering the costs of quality deterioration and carbon emissions (Low Carbon and Freshness Degrees Vehicle Routing Problem (LCFD-VRP)) for cold chain distribution was established in this study. This model takes into account the fixed cost, fuel cost and time window penalty cost. An improved ant colony algorithm (IACA) is used to optimize the whole vehicle distribution routing with its strong global search ability. Tabu Search (TS) algorithm is used to search the single vehicle distribution routing with its good local search ability. An IACA combined with TS (IACATS) was proposed to solve the above LCFD-VRP model. The practicability of the model and the effectiveness of the above improved algorithm are verified using a real case study. The results of Zhoushan Dayang Refrigerated Logistics Co., Ltd. showed that, compared with the traditional algorithm, IACATS could reduce the dispatching of two refrigerated vehicles, thus lowering the total cost by 4.94%, shortening the actual transportation distance by 5.50% and cutting the total CO<sub>2</sub> emissions by 8.9%. Therefore, the LCFD-VRP model can effectively help to achieve the low carbon emissions, multi-variety and low-cost distribution of fresh agricultural products. The proposed model and IACATS algorithm would be used to optimize VRP in cold chain enterprises. The results of this study also provide management suggestions for cold chain enterprises to effectively balance economic cost and environmental cost.
topic cold chain logistics
vehicle routing problem
improved ant colony algorithm
tabu search
fresh degree
co<sub>2</sub> emissions
url https://www.mdpi.com/2071-1050/11/23/6584
work_keys_str_mv AT jingchen optimizationoftransportationroutingproblemforfreshfoodbyimprovedantcolonyalgorithmbasedontabusearch
AT pengfeigui optimizationoftransportationroutingproblemforfreshfoodbyimprovedantcolonyalgorithmbasedontabusearch
AT taoding optimizationoftransportationroutingproblemforfreshfoodbyimprovedantcolonyalgorithmbasedontabusearch
AT sanggyunna optimizationoftransportationroutingproblemforfreshfoodbyimprovedantcolonyalgorithmbasedontabusearch
AT yingtangzhou optimizationoftransportationroutingproblemforfreshfoodbyimprovedantcolonyalgorithmbasedontabusearch
_version_ 1724863726399520768