标题: | 求解p-中心的程序及决定运筹系统之p-值的方法 A procedure for solving the p-center problem and determining the p value of a logistic system |
作者: | 石其伟 Chi-Wei Shih 刘复华 Fuh-Hwa F. Liu 工业工程与管理学系 |
关键字: | p-中心;运筹管理;服务水准;多目标;资料包络分析法;整数规划;p-center;Logistics Management;Service Level;Multiple Criteria;Data Envelopment Analysis;Integer Programming |
公开日期: | 2004 |
摘要: | 在运筹网络之中,固定设施选址是一重要决策问题,其提供运筹系统整体的类型、结构以及形式。选址决策包括了定义供应中心的数量、位址与容量。本篇论文提出求解p-中心问题的新程序。根据p-中心问题的解答所做出的系统设计是一个可供考量的选择。我们针对每一个选择计算出八项指标,包括了最短之最远距离、每项货物之平均运送距离及其变异系数、每顾客端之平均运送距离及其变异系数、总固定设置成本、以及取决于各中心容量之两项成本:变动建设成本与运输成本。我们评估具备这八项指标之所有可能选项。数个柏拉图有效率之选项将被选出。 Locating fixed facilities throughout the logistics network is an important decision problem that gives form, structure and shape to the entire logistics system. Location decisions involve determining the number, locations and capacities of the supply centers to be used. The paper presents a new procedure to solve the minimax problem or p-center problem. The system design according to the solutions of the p-center problem is an alternative under selection. We compute the eight parameters for each alternative such as the minimax distance, average and coefficient of variation of transportation distance per unit of goods, average and coefficient of variation of transportation distance per site, the total fixed setup cost for the centers, and the two total costs that depend on the capacity of the centers: variable construction cost and transportation cost. All the possible alternatives with the eight parameters are evaluated. Several Pareto-efficient alternatives would be selected. |
URI: | http://140.113.39.130/cdrfb3/record/nctu/#GT009233535 http://hdl.handle.net/11536/77107 |
显示于类别: | Thesis |
文件中的档案:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.