摘要
为解决具有复杂超网络特点的流线优化问题,求解以供需匹配度最大化为目标,以能力和资源限制为约束条件的流线网络优化模型,利用向量概念,对流线网络优化模型的目标函数和约束条件进行了简化和修正,将其转换为变分不等式形式,给出了基于投影算法的求解步骤,并以某市物流节点布局规划为例进行分析.案例研究表明:利用投影算法得到的区域物流网络供需匹配度为0.999 7,高于经验比较法得到的供需匹配度0.947 6,更接近实际物流需求;并验证了基于变分不等式的流线优化模型存在唯一解.
A simplified variational inequality model and its projection algorithm were proposed to optimize stream line networks that are complex hypernetworks.In the model,the objective is the matching degree between supply and demand,and the constraints are capacities and resources,and the model is converted to a variational inequality form.A case study on a logistics nodes allocation plan was presented.The result shows that the matching degree（0.999 7） by the projection algorithm is greater than that（0.947 6） by experience comparative method.It was proved that the proposed model has a unique solution.
出处
《西南交通大学学报》
EI
CSCD
北大核心
2011年第3期481-487,共7页
Journal of Southwest Jiaotong University
基金
四川省社会科学基金重点项目(SC09A002)
中央高校基本科研业务费科技创新项目(SWJTU09ZT20)
关键词
物流
流线网络
匹配度
优化
变分不等式
投影算法
logistics
stream line network
matching degree
optimization
variational inequality
projection algorithm
