Research on Multi-Objective Optimization of Low-Carbon Cold Chain Routes Using LNS-NSGA2 Algorithm

This paper addresses the high costs, stringent time sensitivity, and perishability issues encountered in the cold chain logistics of fresh products. To tackle these challenges, a multi-objective low-carbon cold chain route optimization model is established. This model aims to simultaneously minimize the total cost (comprising transportation cost, cargo damage cost, and carbon emission cost), while maximizing customer satisfaction (encompassing both time satisfaction and quality satisfaction). To achieve this goal, we propose the LNS-NSGA2 algorithm, which integrates the advantages of local search strategies with genetic algorithms. Building upon the traditional NSGA2 algorithm, the LNS-NSGA2 algorithm incorporates the “destroy” and “repair” mechanisms from the LNS (Large Neighborhood Search) algorithm, coupled with a binary tournament selection strategy, to enhance the algorithm's local search capability and thus exploring the solution space more efficiently. Through a comparative analysis of a series of large-scale experimental cases, the results demonstrate that compared to the traditional NSGA2 algorithm, the LNS-NSGA2 algorithm effectively reduces distribution costs while significantly improving customer satisfaction. It can notably enhance the quality of the Pareto Frontier, providing superior distribution schemes for fresh food trading outlets and cold chain logistics enterprises.

Authors

Institutions

Publication Details

Published
2024-11-22
DOI
https://doi.org/10.1109/icdsca63855.2024.10859373
Primary Topic
Advanced Manufacturing and Logistics Optimization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Research on Multi-Objective Optimization of Low-Carbon Cold Chain Routes Using LNS-NSGA2 Algorithm

Junjie Wan
Advanced Manufacturing and Logistics Optimization
article

Research on Multi-Objective Optimization of Low-Carbon Cold Chain Routes Using LNS-NSGA2 Algorithm

Junjie Wan
article en

Abstract

This paper addresses the high costs, stringent time sensitivity, and perishability issues encountered in the cold chain logistics of fresh products. To tackle these challenges, a multi-objective low-carbon cold chain route optimization model is established. This model aims to simultaneously minimize the total cost (comprising transportation cost, cargo damage cost, and carbon emission cost), while maximizing customer satisfaction (encompassing both time satisfaction and quality satisfaction). To achieve this goal, we propose the LNS-NSGA2 algorithm, which integrates the advantages of local search strategies with genetic algorithms. Building upon the traditional NSGA2 algorithm, the LNS-NSGA2 algorithm incorporates the “destroy” and “repair” mechanisms from the LNS (Large Neighborhood Search) algorithm, coupled with a binary tournament selection strategy, to enhance the algorithm's local search capability and thus exploring the solution space more efficiently. Through a comparative analysis of a series of large-scale experimental cases, the results demonstrate that compared to the traditional NSGA2 algorithm, the LNS-NSGA2 algorithm effectively reduces distribution costs while significantly improving customer satisfaction. It can notably enhance the quality of the Pareto Frontier, providing superior distribution schemes for fresh food trading outlets and cold chain logistics enterprises.

Yanshan University (CN)
Openalex Percentile: Top 60%
Advanced Manufacturing and Logistics Optimization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.