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

Jing Chen, Pengfei Gui, Tao Ding, Sanggyun Na and Yingtang Zhou
Additional contact information
Jing Chen: Institute of Innovation & Application, Zhejiang Ocean University, Zhoushan 316022, China
Pengfei Gui: School of Business Administration, Wonkwang University, Jeonbuk 54538, Korea
Tao Ding: School of Business Administration, Wonkwang University, Jeonbuk 54538, Korea
Sanggyun Na: School of Business Administration, Wonkwang University, Jeonbuk 54538, Korea
Yingtang Zhou: Institute of Innovation & Application, Zhejiang Ocean University, Zhoushan 316022, China

Sustainability, 2019, vol. 11, issue 23, 1-22

Abstract: With the continuous improvement of people’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’s cold chain logistics is to offer fresh food while minimizing CO 2 emissions. The fresh degree and CO 2 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 2 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.

Keywords: cold chain logistics; vehicle routing problem; improved ant colony algorithm; tabu search; fresh degree; CO 2 emissions (search for similar items in EconPapers)
JEL-codes: O13 Q Q0 Q2 Q3 Q5 Q56 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
https://www.mdpi.com/2071-1050/11/23/6584/pdf (application/pdf)
https://www.mdpi.com/2071-1050/11/23/6584/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jsusta:v:11:y:2019:i:23:p:6584-:d:289479

Access Statistics for this article

Sustainability is currently edited by Ms. Alexandra Wu

More articles in Sustainability from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().