检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:周炳海[1] 宗师 ZHOU Bing-hai;ZONG Shi(School of Mechanical Engineering,Tongji University,Shanghai 201804,China)
机构地区:[1]同济大学机械与能源工程学院,上海201804
出 处:《控制理论与应用》2020年第3期505-512,共8页Control Theory & Applications
基 金:国家自然科学基金项目(71471135)资助.
摘 要:为了提高冷链物流的运输效率,解决越库在冷链物流中的应用问题,提出了基于拉格朗日松弛算法的冷链物流的越库调度方法.首先进行了问题域的描述并做出了具体假设,基于问题域以最小化卡车等待时间和越库内部运输成本为目标,建立越库调度的整数规划数学模型.然后,提出了针对越库调度模型的拉格朗日松弛算法,松弛复杂约束后根据决策变量将松弛问题分解为若干子问题,采用次梯度算法求解松弛模型.最后,对各种不同规模的越库模型进行仿真实验,并与传统的贪婪算法进行对比,结果表明,所提出的调度算法适用于问题的求解,并可以在较短时间内获得良好的近优解.In order to effectively improve the efficiency of cold-chain logistics and solve the scheduling problems in cold-chain logistics, a scheduling method based on a Lagrangian relaxation algorithm is proposed. First of all, a cross-dock scheduling problem in cold-chain logistics is presented and a few assumptions of the problem are depicted in detail in the paper. Then an integer mathematical programming model is constructed with objectives of minimizing total truck waiting time and inner cross-dock transportation cost. On that basis, a Lagrangian relaxation algorithm aiming at cross-docking scheduling is developed, which decomposes the relaxed problem into several sub-problems, and a Subgradient algorithm is introduced to solve these sub-problems. Finally, simulation experiments of different problem scales are carried out to analyze the proposed algorithm and compared with a Greedy algorithm. Results indicate that the two proposed algorithms are fit to solving the problem and could obtain satisfactory near-optimal solutions within the reasonable time.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179