Optimization of Dairy Cold-Chain Distribution Routes Using an Ant Colony Algorithm: A Case Study of Ningbo Milk Group

Demand for fresh dairy products places substantial pressure on distribution networks to deliver refrigerated goods efficiently while controlling operating costs, product deterioration, and transport-related emissions. Because dairy products are temperature-sensitive and have limited shelf lives, inappropriate routing decisions can increase vehicle mileage, refrigeration energy consumption, delivery time, and the risk of quality loss. This study develops a cost-oriented vehicle-routing model for a single dairy distribution center and applies an ant colony optimization algorithm to the route-planning problem. The proposed formulation considers fixed vehicle expenses, transport costs, refrigeration during travel and unloading, product damage, and carbon-emission costs. A case study of Ningbo Milk Group in Ningbo, China, considers a single distribution center serving ten specified customer delivery points. The algorithm is evaluated in MATLAB through ten simulation trials and is compared with genetic algorithm and tabu search approaches using the reported case parameters. The ninth of the ten simulation trials produces the lowest reported modeled distribution cost of RMB~2,160, with a total route length of 83~km and three refrigerated delivery vehicles. These numerical findings suggest that ant colony optimization can serve as a useful route-planning heuristic for the specified case-study delivery network and its assumed operating conditions. However, wider operational benefits, emissions reductions, and generalizability require additional field validation, sensitivity analysis, and comparison across multiple demand scenarios.

Authors

Publication Details

Journal
Archives des sciences a multidisciplinary journal
Published
2026-11-20
DOI
https://doi.org/10.68304/as/76528
Primary Topic
Vehicle Routing Optimization Methods
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Optimization of Dairy Cold-Chain Distribution Routes Using an Ant Colony Algorithm: A Case Study of Ningbo Milk Group

Jingxin Wang
Archives des sciences a multidisciplinary journal
Vehicle Routing Optimization Methods
article

Optimization of Dairy Cold-Chain Distribution Routes Using an Ant Colony Algorithm: A Case Study of Ningbo Milk Group

Jingxin Wang
article en

Abstract

Demand for fresh dairy products places substantial pressure on distribution networks to deliver refrigerated goods efficiently while controlling operating costs, product deterioration, and transport-related emissions. Because dairy products are temperature-sensitive and have limited shelf lives, inappropriate routing decisions can increase vehicle mileage, refrigeration energy consumption, delivery time, and the risk of quality loss. This study develops a cost-oriented vehicle-routing model for a single dairy distribution center and applies an ant colony optimization algorithm to the route-planning problem. The proposed formulation considers fixed vehicle expenses, transport costs, refrigeration during travel and unloading, product damage, and carbon-emission costs. A case study of Ningbo Milk Group in Ningbo, China, considers a single distribution center serving ten specified customer delivery points. The algorithm is evaluated in MATLAB through ten simulation trials and is compared with genetic algorithm and tabu search approaches using the reported case parameters. The ninth of the ten simulation trials produces the lowest reported modeled distribution cost of RMB~2,160, with a total route length of 83~km and three refrigerated delivery vehicles. These numerical findings suggest that ant colony optimization can serve as a useful route-planning heuristic for the specified case-study delivery network and its assumed operating conditions. However, wider operational benefits, emissions reductions, and generalizability require additional field validation, sensitivity analysis, and comparison across multiple demand scenarios.

Archives des sciences a multidisciplinary journalVol. 76(5)
Vehicle Routing Optimization Methods
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.

Laika access coming soon