检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘万正 赵蒙[1] 李士宁 LIU Wanzheng;ZHAO Meng;LI Shining(School of Economics and Management,Dalian University of Technology,Dalian 116024,China;Beijing Jingdong Century Trading Co.,Ltd.,Beijing 100176,China)
机构地区:[1]大连理工大学经济管理学院,辽宁大连116024 [2]北京京东世纪贸易有限公司,北京100176
出 处:《工程管理科技前沿》2024年第6期9-16,共8页Frontiers of Science and Technology of Engineering Management
基 金:国家社会科学基金重大资助项目(22&ZD151)。
摘 要:聚焦生鲜农产品“最先一公里”冷链运输环节中的分拣车和冷藏车协同作业优化难题,本文采用时空网络建模方法和拉格朗日松弛算法等,以多维复杂组合优化问题的降维分解为主要切入点,重点研究基于时空状态网络构造移动分拣车和冷藏车协同作业优化模型;设计基于拉格朗日松弛算法和贪心规则的求解方法,实现大规模高维网络的降维分解,提升算法效率;通过数值实验与CPLEX商用求解器进行对比,验证本文算法在求解较大规模问题时的性能,并通过敏感性分析研究了单位行驶成本对系统运行状态的影响。本文采用时空网络建模方法,为降低多阶段协同作业优化建模的复杂度提供新思路,为高效求解大规模多维网络优化问题提供新方法。The paper focuses on the cooperative operation optimization of sorting and refrigerated trucks in the“first-mile”cold chain transportation for fresh agricultural products.It employs methods such as space-time-state network modeling and lagrangian relaxation algorithm to address the challenges.The primary focus is on decomposing multidimensional complex combinatorial optimization problems,particularly emphasizing the construction of an optimization model for the cooperative operation optimization of moving sorting and refrigerated trucks based on space-time-state network.Additionally,it designs a solution method based on the lagrangian relaxation algorithm and greedy rules to achieve dimension reduction decomposition of large-scale high-dimensional networks,thereby enhancing algorithm efficiency.Comparative analyses with the CPLEX commercial solver through numerical experiments validate the algorithm’s performance in solving large-scale problems.Sensitivity analysis is conducted to study the impact of unit travel costs on system operation states.By employing space-time-state network modeling,the study provides new insights into reducing the complexity of multi-stage cooperative operation optimization modeling and offers novel methods for efficiently solving large-scale multidimensional network optimization problems.
关 键 词:生鲜农产品 最先一公里 协同优化 时空状态网络 拉格朗日松弛算法
分 类 号:F326.6[经济管理—产业经济] O224[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.90