Vehicle route problem in cold chain logistics

Nowadays, the logistic system is becoming very important part for all businesses. To understand the problems about in with Vehicle routing problem with load in each node to help in planning the route that increases the efficiency and shorted of transportation, this study is presenting a vehicle routing problem in cold chain logistic. We conduct our computational experiments to minimize total transportation distance. Therefore, this paper will adapt from existing method computing a linear programing to reduce logistics enterprises’ operation costs by determine the reasonable vehicle route planning. Using Saving algorithm to construct the route of customer visit to avoid the limitation of commercial solver in large problem and using optimization model to optimal set of routes. The solution also confirms by multiple testing.

如今，物流系统已成为各类企业的核心组成部分。为深入理解带节点载荷的车辆路径问题（Vehicle Routing Problem, VRP），以辅助规划可提升运输效率、缩短运输距离的路线，本研究聚焦冷链物流场景下的车辆路径问题。本研究以最小化总运输距离为目标开展计算实验。为此，本文将适配现有线性规划（Linear Programming）方法，通过制定合理的车辆路径规划方案，降低物流企业的运营成本。研究采用节约算法（Savings Algorithm）构建客户访问路径，以规避商用求解器在大规模问题中的局限性，并结合优化模型生成最优路径集合。所得解亦通过多组测试完成验证。