检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海对外贸易学院国际经贸学院,上海201620
出 处:《上海师范大学学报(自然科学版)》2008年第6期570-576,共7页Journal of Shanghai Normal University(Natural Sciences)
基 金:上海市教委重点课程(5Z1206)
摘 要:配送中心选址是物流管理中的一个重要研究问题,受到广泛重视.一般选址问题所涉及的模型都是静态的,即沿一条路径行进时所需的成本(或时间)是与出发时间无关的常数.但在实际生活中,沿一条路径行进时所需的成本(或时间)是会随出发时间的变化而变化.讨论这类时变环境下的选址模型,给出模型的数学描述并提出一个求解的算法.Locating a distribution center is an important problem in logistics, which has been studied widely. Most of the models discussed in literature are static, that is, the cost (or the time) to transship some goods along a path is a constant. In our real lives, however, such kinds of costs are functions of the departure time. In this paper, we address the problem of how to locate a logistics distribution center in a time-varying circumstance. The problem is formulated mathematically and an algorithm is proposed to find the optimal solution of the problem.
分 类 号:O221.7[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117