订单可分的协作计划模型及其进化算法-《计算机技术与发展》

文章信息/Info

Title:: Collaborative Planning Model Based on Divisible Order and Its Evolution Algorithm

Author(s):: BAO Rong; WANG Wei-ye; GU Han-jie; XU Yong-an; [1]School of Microelectronic,Xidian University[2]Information Engineering College,Yangzhou University

Keywords:: collaborative planning; supply chain optimization; order divisible; differential evolution

摘要:: 在传统协作规划中协作任务作为不可分订单在协作伙伴间进行协商协作,其协作模型和优化求解算法也是基于任务订单不可分的。为提高供应链的资源利用效率,进一步降低协作成本,建立订单可拆分的协作计划模型;设计了一种离散优化与连续优化相结合的差分进化算法,该算法具有优化能力强、陷入局部最优的概率小等特点,在实现了任务订单拆分后的任务协作的同时,扩大了供应链的协作优化的空间,使协作决策更加准确有效;最后,通过相应算例验证了模型和算法的有效性

Abstract:: In traditional collaborative planning,the collaborative task was collaborated between the collaborateurs as a nonseparable order,and its collaborative model and evolution algorithm are also based on the nonseparable order.In order to improve the resource utilization in the supply chain and reduce more collaborative cost,a collaborative planning model based on divisible partly orders is constructed.A differential evolution algorithm for the model,combining advantage of discrete optimization and continuous optimization,is put forward.The algorithm has a better optimization capability and small probability to fall into local optimum.The model can achieve the collaborative task after the order split and extend the space of the collaborative optimize in the supply chain,so the supply chain resources can be made full use and the decision can be made more accurate.Finally,the validity of the optimization model and algorithm are proved by an application