检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]重庆交通大学管理学院,重庆400074 [2]山东师范大学,山东济南250014
出 处:《重庆交通大学学报(自然科学版)》2009年第3期619-622,共4页Journal of Chongqing Jiaotong University(Natural Science)
基 金:重庆市教委自然科学基金项目(KJ070410)
摘 要:以烟草物流配送区域划分为背景,将烟草物流配送区域划分为若干个配送单元。依据配送单元的需求量、配送成本、配送中心及中转站的固定成本和变动成本,其中变动成本包括配送中心通过大车配送到中转站的费用和配送中心及中转站通过小车配送到户的费用,建立了物流配送区域划分规划的运筹学模型,应用遗传算法设计了编码方式和选择、交叉、变异算子进行计算机仿真求解模型,获得烟草配送区域划分的优化布局方案,说明相应的实际问题。On the background of the cigarette logistics distribution region partition, cigarette logistics distribution region is divided into several distribution units. Based on the distribution requirements of the units, deliver cost, the fixed cost and variable costs of the distribution center and the transfer station, the operation research model of logistics distribution area partition planning has been built. The variable costs include distribution costs of cart transferring from distribution center to transfer station and distribution costs of cart from transfer station to customers. Genetic algorithms are applied to design the encoding scheme, selection, crossover and mutation operator as well as to establish computer simulation models to find the solution, which obtains the optimal allocation schema of the cigarette distribution region partition and solves the corresponding problems.
关 键 词:烟草配送区域 遗传算法 配送成本 运筹学模型 仿真
分 类 号:U491.1[交通运输工程—交通运输规划与管理] F224.3[交通运输工程—道路与铁道工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28