供应链中分销中心布局问题的区间规划模型及解法  

An Interval Programming Model and Algorithm for Distribution Centers Layout Problems

作　　者：赵晓煜[1] 汪定伟[2] 

机构地区：[1]东北大学工商管理学院,辽宁沈阳110004 [2]东北大学信息科学与工程学院,辽宁沈阳110004

出　　处：《系统工程》2004年第8期28-32,共5页Systems Engineering

基　　金：国家自然科学基金资助项目(60084003)

摘　　要：分销中心布局问题是现代企业供应链管理中一类重要的决策问题,但对于问题中的有些参数很难给出精确值,因此,考虑采用不确定性规划描述此类问题。提出分销中心布局问题的区间规划模型,模型中用区间数来表示产品需求量和分厂生产能力等难于确定的参数。根据区间之间顺序关系的定义和区间不等式成立的度的定义,分别讨论区间规划的目标函数和约束条件的清晰化方法,将区间规划模型转化为等价的清晰双目标规划模型。提出该模型的一种求解方法,利用该方法能够求出问题的全部非劣解。Distribution centers layout is an important decision making problem in supply chain management of modern (enterprises,) but the precise values of some parameters are difficult to obtain, so it is reasonable to denote this type of (problem) by uncertain programming. An interval programming model for distribution centers layout is presented in this (paper,) in which both customers' demands for products and production capacity of branch plants are treated as interval (coefficients.) According to the definition of inequality relation between interval numbers, a method for converting objective (function) and constraints to their crisp equivalents is discussed, then the interval programming model is converted to equiva- lent crisp bi-objective programming model, and an algorithm is presented to obtain all pareto solutions of the model.

关 键 词：分销中心布局 区间规划 清晰化 双目标规划 非劣解 

分 类 号：F40[经济管理—产业经济]