有容量限制的仓库选址及调运问题研究  

Research on warehouse location and transportation problem with capacity limitation

作　　者：范昌胜[1] 徐锦华 陈新庄[2] 李斌[1] FAN Chang-sheng;XU Jin-hua;CHEN Xin-zhuang;LI Bin(School of Engineering and Architecture, Shaanxi Business and Vocational College, Xian 710119, P. R. C.;Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xian 710072, P. R. C.)

机构地区：[1]陕西工商职业学院工程与建筑学院,陕西西安710119 [2]西北工业大学理学院应用数学系,陕西西安710072

出　　处：《西南民族大学学报（自然科学版）》2019年第3期296-302,共7页Journal of Southwest Minzu University(Natural Science Edition)

基　　金：陕西省教育厅2017年专项科学研究计划课题(17JK0059);陕西省教育厅2017年重点科学研究计划(17JZ011)阶段成果

摘　　要：对有仓库容量限制,多工厂的三层供应关系的仓库选址问题进行了研究,给出了一种精确算法,这种算法是在求出工厂到仓库、仓库到销售点初始可行解的基础上,找出可降费的闭合回路进行调整,最后再通过减少仓库个数确定最优仓库个数和运输路线,这种算法易编程实现,具有计算速度高,存储空间少的优点.This paper studies the problem of warehouse location with three - tier supply relationship of warehouse capacity limitation and multi - factory, gives an accurate algorithm, which is to find the initial feasible solution from factory to warehouse, warehouse to point of sale, on this basis, finds out the closed loop that can be reduced, and finally determines the optimal number of warehouses and transportation routes by reducing the number of warehouses. This algorithm is easy to program and has the advantages of high calculation speed and less storage space.

关 键 词：仓库选址 容量限制 调运问题 最短路径 FLOYD算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]