摘要
传统物流行业中,货主需要向全国各个省市区发送货物,存在上千条线路。这就导致了货主每次招标时都要对这些线路的报价进行计算后选择2~3家承运商,靠手工Excel填写统计计算非常浪费时间。为了解决这个问题,设计并实现了基于LocalSearch的智能货运路线匹配系统,通过采用退火模拟和禁忌搜索等方式,能够在极短的时间内计算一个满足货主复杂招标要求的近似最优解,且计算结果要比手工计算优于20%以上,有助于节约人力成本,降低运费。
In the traditional transport industry, shippers need to send goods to various provinces and cities in the country,there are thousands of routes. As a result, the shippers have to calculate the quotation of these lines and select 2 or 3 carriers after each time they accept the bid for tender from all carriers. It is a waste of time to fill in the statistical calculation by manual in Excel. To solve this problem, this paper designs and implements an intelligent transport route matching system based on LocalSearch. By using annealing simulation, tabu search and other methods, it can calculate an approximate optimal solution without break the complex bidding requirements raised by the shippers in a very short time, and the calculation results are more than 20% better than the manual calculation results. Help to save labor costs, reduce freight.
作者
刘毓椿
LIU Yuchun(Shanghai Xianshuo Information Technology Co.,Ltd.,Shanghai 200120,China)
出处
《信息与电脑》
2023年第1期165-171,共7页
Information & Computer
关键词
局部搜索
退火模拟
JAVA
禁忌搜索
智能货运
local search
simulated annealing
Java
tabu search
intelligent transport
