检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:林峰[1] 贾涛[1,2] 李然[1] LIN Feng JIA Tao LI Ran(School of Management, Xi' an J iaotong University, Xi' an 710049, China The Key Lab of the Ministry of Education for Process Control& Efficiency Engineering,Xi'an 710049,China)
机构地区:[1]西安交通大学管理学院,陕西西安710049 [2]过程控制与效率工程教育部重点实验室,陕西西安710049
出 处:《系统工程》2016年第8期100-107,共8页Systems Engineering
基 金:国家自然科学基金资助项目(71271168;41371180)
摘 要:在一个生产商供应单一易腐产品给多个零售商的供应链中考虑了一体化库存路径决策问题,产品使用同质车辆配送且允许重复装货,而在运输过程和销售过程中产品具有不同的腐败速率。通过构建数学模型以最小化包括生产、配送、腐败、库存成本在内的供应链总成本。借助数学证明得到了两个命题以确定零售商订货和生产商生产的周期时间,并采用改进的C-W节约算法对问题进行了求解。最后通过数值算例和灵敏度分析说明了模型和算法的有效性。An integrated inventory routing problem (IRP) is considered in which one manufacturer distributes a single deteriorating item to a set of retailers using homogeneous vehicles, and the vehicle multi-tours policy is embedded in the process of routing scheduling. Also during the transportation and the retail stage, the item will have different deteriorating rates. A proper mathematical model is established to minimize the joint total cost per unit time of the supply chain, which including manufacturer's cost, deteriorating cost, distribution cost and retailers' cost. With mathematical analyseis, two propositions are derived to efficiently determine the cycle times for the manufacturer as well as the retailers, Then the improved C-W savings algorithm is developed to generate optimal solutions for the supply chain. Finally, computational experiments are conducted to illustrate the effectiveness of the proposed model and algorithm.
关 键 词:一体化供应链 易腐品 库存路径问题 改进的C-W节约算法 多程回路
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.147