检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
出 处:《工业工程与管理》2007年第5期5-10,共6页Industrial Engineering and Management
基 金:国家自然科学基金资助项目(7047104270601011);教育部新世纪优秀人才支持计划项目(NCET-06-0653)
摘 要:假设存在一个有供应能力限制的供应商和一个需求量和收益都不确定的潜在需求市场集。选择进行服务的需求市场,然后根据风险分摊的效益原理,确定将哪些需求市场建立为配送中心,如何分配这些配送中心对其他被选择的需求市场进行服务。其目标为使损失的总收益、配送中心的建立成本、运输成本和库存成本之和最小。所以,构建了一个非线性的整数规划模型。由于该模型属于NP-Hard问题,因此提出了一种基于拉格朗日松弛和子梯度法的启发式算法,并通过算例对该算法进行了研究,得到的最优解的上下界相对误差最大不超过5%,大多数小于1%。Instead of the traditional model, given a single capacitated supplier and a set of markets, each specified by a stochastic demand and associated with expectation revenue. Decisions were made in two stages: first made a decision of what markets to select, where all other markets were rejected. Next in terms of risk-pooling benefits theory, determined which markets should serve as distribution centers and how to allocate the other selected markets to these distribution centers. The objective was to minimize the total losing revenue, inventory, transportation, and facility location costs. This problem could be formulated as a nonlinear integer-programming model. This model is NP-Hard, so a heuristic solution approach was presented, based on Lagrangian relaxation and the subgradient method. Finally, Numerical examples were given to illustrate the application of this algorithm, and show that the upper bounds of errors are all lower than 5%, and most even lower than 1% .
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.148.221.111