hierarchical
层次聚类算法

层次聚类算法层次聚类算法(Hierarchical Clustering Algorithm)是一类数据挖掘的重要方法,它的主要思想是,将最初的n个样本点当成n个单独的聚类,然后依据某一距离度量方式分别计算每两个聚类的距离,从而确定最近距离的两个聚类合并为一个,通过不断合并就可以使得初始点构成的n个聚类缩减成一个。
层次聚类算法可以用来分析数据、挖掘隐藏的知识,它主要包含以下几个步骤:一、算法准备1.计算原始数据集中每个样本之间的距离,通常有曼哈顿距离、欧氏距离等方式可以实现计算,这是层次聚类算法的核心步骤;2.设定阈值,用以控制聚类的数量,实现算法的有效性。
二、算法开始1.将每个样本作为一个单独的簇;2.计算每两个簇之间的距离(根据第一步计算出来的距离);3.将最相近的两个簇合并,更新聚类的数量和距离;4.若聚类的数量不等于预设的数量,则重复步骤2、3,否则结束迭代,给出聚类结果。
三、层次聚类的应用1.人脸识别:用层次聚类算法帮助计算机系统将相近的人脸归为一类;2.文本聚类:在虚拟空间中用层次聚类算法对文本进行聚类,例如聚类微博、聚类博客文章等;3.推荐系统:层次聚类可以在推荐系统中用来分析用户的兴趣点,从而提供更契合用户意愿的服务。
四、层次聚类的优点1.易于控制聚类的数量:用户可以通过设定阈值来控制想要的聚类数量;2.易于可视化:结果可以通过树状图等方式直观可视化;3.准确性较高:可以准确实现用户所关心的目标。
五、层次聚类的缺点1.数据资源要求高:层次聚类算法每次迭代中都需要计算所有数据样本之间的距离,对数据资源要求非常高;2.聚类结果影响大:层次聚类的结果受初始选择的聚类数量的影响很大,可能会出现收敛于局部最优点,不能达到全局最优点;3.高维数据聚类效果不佳:高维数据的距离计算比较复杂,容易导致聚类效果不理想。
总结:层次聚类算法是一类数据挖掘的重要方法,它的核心是将最初的n个样本点当成n 个单独的聚类,依据某一距离度量方式计算每两个聚类之间的距离,然后将最相近的两个聚类合并,不断迭代,最终输出聚类结果,主要应用于人脸识别、文本聚类和推荐系统等。
分层线性模型

分层线性模型(hierarchical linear model HLM)的原理及应用一、概念:分层线性模型(hierarchical linear model HLM)又名多层线性模型(Multilevel Linear Model MLM)、层次线性模型(Hierarch Linear Mode1)、多层分析(Multilevel Analysis/Model)。
相对于传统的两种统计方法:一般线性模型(general linear model GLM)和广义线性模型(generalized linear models GLMs),它们又有所不同,HLM中的线性模型指的是线性回归,不过它与一般的分层线性回归(Hierarchical Regression)又是不同的,具体的不同见下面数学模型部分。
HLM又被通俗的称为“回归的回归”。
Wikipedia:“一般线性回归和多重线性回归都是发生在单一层面,HLM相对于更适用于嵌套数据(nest data)。
”在理解HLM之前应了解有关回归分析和嵌套设计(分层设计)的基本知识。
二、模型:1、假设:由于个体行为不仅受个体自身特征的影响,也受到其所处环境(群体/层次)的影响。
相对于不同层次的数据,传统的线性模型在进行变异分解时,对群组效应分离不出,而增大模型的误差项。
而且不同群体的变异来源也可能分布不同,可能满足不了传统回归的方差齐性假设。
在模型应用方面,不同群体(层次)的数据,也不能应用同一模型。
鉴于传统方法的局限性,分层技术则解决了这些生态谬误(Ecological Fallacy)。
它包含了两个层面的假设:a、个体层面:这个与普通的回归分析相同,只考虑自变量X对因变量Y的影响。
b、群组层面:群组因素W分别对个体层面中回归系数和截距的影响。
2、数学模型:a、个体层面:Yij=Β0j+Β1jXij+eijb、群组层面:Β0j=γ00+γ01Wj+U0jΒ1j=γ10+γ11Wj+U1j涉及到多个群组层次的时候原理与之类似,可以把较低级层次的群组,如不同的乡镇层面与不同的县市层面,可以这样理解,乡镇即是一个个体,群组即是不同的县市。
多层线性模型与HLM软件应用概述

多层线性模型与HLM软件应用概述
多层线性模型(Hierarchical Linear Model, HLM)是一种多层次的
数据分析方法,可以用于处理分层结构的数据,如学生嵌套在班级中,班
级嵌套在学校中等。
HLM软件是用于实施多层线性模型分析的统计软件,
其中常用的有HLM7、HLM6和MLwiN等。
HLM软件是专门用于多层线性模型分析的工具,主要有以下几个常见
的应用:
1.教育研究:HLM软件可以用于教育研究中的学校和班级层次的分析。
例如,可以通过学生嵌套在班级和学校中,分析学校和班级对学生成绩的
影响,从而得出不同层次间的差异。
2.医学研究:HLM软件可以用于医学研究中的多层次数据分析。
例如,可以分析患者嵌套在医院和地区中,探究医院和地区对患者健康指标的影响。
3.组织行为研究:HLM软件可以应用于组织行为研究中的多层次数据
分析。
例如,可以分析员工嵌套在团队和组织中,探究团队和组织特征对
员工绩效的影响。
4.社会科学研究:HLM软件可以用于社会科学研究中的多层次数据分析,如家庭、社区和城市等不同层次的分析。
例如,可以分析个体嵌套在
家庭和社区中,研究家庭和社区对个体幸福感的影响。
总之,多层线性模型和HLM软件可以用于处理分层结构的数据,帮助
研究者深入分析不同层次间的差异。
在教育、医学、组织行为和社会科学
等领域具有广泛的应用前景,能够提供更准确和全面的研究结果。
hierarchy翻译

hierarchy翻译翻译:层级(指系统或组织中按等级高低或地位高低划分的结构)用法:hierarchy常用于描述组织结构、管理体系等方面,表示不同层次之间的关系。
可以用来表示组织管理、人事架构等。
双语例句:1. The company has a clear hierarchy with senior management at the top.该公司有明显的层级结构,高级管理层在顶端。
2. The school system has a hierarchy of administrators, teachers, and students.学校系统有管理员、教师和学生的等级层次3. The military has a strict hierarchy, with officers holding higher positions than enlisted personnel.军队有严格的等级制度,军官的职位比士兵高。
4. In this company, promotions are based on a clear hierarchy of achievements and seniority.在这家公司,升迁是基于成就和资历的层级制度。
5. The Catholic Church has a well-defined hierarchy with the Pope at the top.天主教会有一个明确的等级结构,教皇位于最高层。
6. The feudal system was characterized by a rigid hierarchy of lords and serfs.封建制度的特点是贵族和农奴的严格等级结构。
7. The organization has a hierarchical structure where every employee reports to a manager.该组织有一个层级结构,每个员工向经理汇报。
分层线性模型操作方法

分层线性模型操作方法分层线性模型(Hierarchical Linear Model,简称HLM)是一种用于分析多层数据结构的统计模型。
它将数据分类到不同的层次,并在每个层次上拟合线性模型,然后将这些层次之间的关系建模。
以下是分层线性模型的操作方法:1. 确定层次结构:首先需要确定数据的层次结构,即数据是如何分成不同层次的。
例如,研究可以有多个学校,每个学校有多个班级,每个班级有多个学生。
在这种情况下,学校可以被定义为第一层,班级为第二层,学生为第三层。
2. 数据准备:准备好所需的层次数据。
这意味着将每个层次的数据分为不同的变量或列。
例如,在上述例子中,可以为每个学生收集学校、班级和个人的信息,然后将其分为不同的列。
3. 建立模型:使用统计软件或编程语言,将分层线性模型拟合到数据中。
通常,HLM的建模过程包括选择固定效应和随机效应,指定相应的层次结构和层次间关系。
4. 检验模型:一旦建立了HLM模型,需要对其进行检验以评估其拟合优度。
这可以通过检查模型参数的统计显著性、模型拟合度量(如R方)以及残差分析来完成。
5. 解释和解读结果:在完成模型检验后,可以解释和解读结果以回答研究问题。
这可能涉及解释固定效应和随机效应之间的差异以及层次间关系的影响。
6. 进行推断和预测:最后,可以使用已建立的HLM模型进行推断和预测。
这可以通过根据模型参数和已知变量的值来预测响应变量的值,或者通过使用模型进行假设检验和置信区间构建来推断总体水平上的差异。
总的来说,分层线性模型的操作方法包括确定层次结构、准备数据、建立模型、检验模型、解释和解读结果,以及进行推断和预测。
分层线性模型

分层线性模型分层线性模型(hierarchical linear model HLM)的原理及应用一、概念:分层线性模型(hierarchical linear model HLM)又名多层线性模型(Multilevel Linear Model MLM)、层次线性模型(Hierarch Linear Mode1)、多层分析(Multilevel Analysis/Model)。
相对于传统的两种统计方法:一般线性模型(general linear model GLM)和广义线性模型(generalized linear models GLMs),它们又有所不同,HLM中的线性模型指的是线性回归,不过它与一般的分层线性回归(Hierarchical Regression)又是不同的,具体的不同见下面数学模型部分。
HLM又被通俗的称为“回归的回归”。
Wikipedia:“一般线性回归和多重线性回归都是发生在单一层面,HLM相对于更适用于嵌套数据(nest data)。
”在理解HLM之前应了解有关回归分析和嵌套设计(分层设计)的基本知识。
二、模型:1、假设:由于个体行为不仅受个体自身特征的影响,也受到其所处环境(群体/层次)的影响。
相对于不同层次的数据,传统的线性模型在进行变异分解时,对群组效应分离不出,而增大模型的误差项。
而且不同群体的变异来源也可能分布不同,可能满足不了传统回归的方差齐性假设。
在模型应用方面,不同群体(层次)的数据,也不能应用同一模型。
鉴于传统方法的局限性,分层技术则解决了这些生态谬误(Ecological Fallacy)。
它包含了两个层面的假设:a、个体层面:这个与普通的回归分析相同,只考虑自变量X对因变量Y的影响。
b、群组层面:群组因素W分别对个体层面中回归系数和截距的影响。
2、数学模型:a、个体层面:Yij=Β0j+Β1jXij+eijb、群组层面:Β0j=γ00+γ01Wj+U0jΒ1j=γ10+γ11Wj+U1j涉及到多个群组层次的时候原理与之类似,可以把较低级层次的群组,如不同的乡镇层面与不同的县市层面,可以这样理解,乡镇即是一个个体,群组即是不同的县市。
hierarchical text classification综述 -回复

hierarchical text classification综述-回复所提到的主题是"hierarchical text classification综述",下面将一步一步回答该主题并撰写一篇1500-2000字的文章。
文章标题:Hierarchical Text Classification综述:解析和探索文本分类的层次化实践引言:在信息时代,大量的文本数据被生成和储存。
文本分类是一种重要的技术,用于将文本分组到特定的类别中,从而有效地组织和管理这些海量数据。
然而,传统的文本分类方法只能将文本数据划分为单个层次的类别。
随着信息储量的不断增长和深度学习技术的快速发展,层次化文本分类变得越来越重要。
本文将对hierarchical text classification进行综述,探讨其基本原理、方法和应用,以及未来发展的前景。
一、基本原理1.1 文本分类的定义和目的文本分类是将给定的文本数据分配到预定义类别的任务。
它是一种监督学习任务,基于已标注的训练数据来预测未标注文本的类别。
文本分类的目的是根据文本的内容将其分类,以便更好地理解和组织信息。
1.2 层次化文本分类的概念层次化文本分类是将文本数据划分为多个层次的类别。
这种方法提供了更精细和结构化的组织方式,使得分类结果更具灵活性和可解释性。
例如,一个层次化分类体系可以包含多个级别,从大类到细分的子类,逐渐细化分类。
二、基本方法2.1 特征提取与表示传统方法通常使用统计特征(如词频、tf-idf)来表示文本。
而深度学习方法则采用词嵌入技术(如Word2Vec、FastText)来学习文本的语义表示。
这些方法都可以用于层次化文本分类,但需要注意不同层次之间的特征表示的一致性。
2.2 分类器选择与训练常用的分类器包括朴素贝叶斯、支持向量机(SVM)、决策树和深度神经网络等。
在层次化文本分类中,通常采用自顶向下的策略,先对高级类别进行分类,然后对子类别进行逐级细分。
hierarchical clustering method

hierarchical clustering method【最新版】目录1.层次聚类法概述2.层次聚类法的基本原理3.层次聚类法的应用领域4.层次聚类法的优缺点5.结论正文一、层次聚类法概述层次聚类法(Hierarchical Clustering Method)是一种常见的聚类分析方法,它基于数据之间的相似度,将数据划分为一系列具有层次结构的簇。
在层次聚类分析中,簇的划分不是一次性完成的,而是通过多次迭代,逐步合并相邻的簇,最终形成一个完整的层次结构。
二、层次聚类法的基本原理层次聚类法的基本原理是:从相似度最高的数据点开始,逐步合并相邻的数据点形成簇,同时将簇之间的相似度进行更新,直到所有的数据点都被划分到同一个簇中。
层次聚类法主要有两种实现方式:自下而上和自上而下。
1.自下而上层次聚类:从单个数据点开始,逐步合并相邻的数据点形成簇,直到所有的数据点都被划分到同一个簇中。
2.自上而下层次聚类:从包含所有数据点的簇开始,逐步划分簇,直到每个簇只包含一个数据点。
三、层次聚类法的应用领域层次聚类法在许多领域都有广泛的应用,例如数据挖掘、生物信息学、社交网络分析、市场营销等。
通过层次聚类法,可以挖掘数据内部的结构和规律,发现数据之间的相似性和差异性,为进一步的数据分析和应用提供支持。
四、层次聚类法的优缺点1.优点:(1)可以显示数据中的层次结构和关系;(2)对于不同形状和密度的簇具有一定的适应性;(3)计算复杂度较低,易于实现。
2.缺点:(1)需要预先设定聚类的个数,对聚类个数的选择较为敏感;(2)对于大规模数据集,计算复杂度较高;(3)可能受到噪声和离群点的影响。
五、结论层次聚类法是一种有效的聚类分析方法,可以挖掘数据内部的结构和规律,发现数据之间的相似性和差异性。
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
Development of a design methodology for warehousing systems:hierarchical frameworkMarc GoetschalckxLeon McGinnisGunter SharpDoug BodnerT. GovindarajKai HuangSchool of Industrial and Systems EngineeringGeorgia Institute of TechnologyAtlanta, GA 30332-0205AbstractWe will present a progress report on our effort to develop a science-based design methodology for warehousing systems. In particular, we will discuss the hierarchical structure of our design procedure. This includes the decisions and parameters used in the master model, the various sub-models, and the decision and data interaction between the various levels in the hierarchy. We will present several sub-models that are specific for a particular function or material handling equipment. Computational results of the application of the sub-model for modular storage drawers will also be shared.KeywordsWarehousing system, design methodology, modular storage drawers, bin shelving.1. IntroductionThe goal is the development of a systematic methodology to rapidly design warehousing systems. At the current time, most of warehousing design is either based on ad-hoc insight and experience of the warehouse designer or on detailed simulation of the equipment and material flows through the warehouse. However, the current business climate does not allow for the several weeks it takes to develop such a detailed simulation model. Third party logistics service providers (TPL) are routinely faced with a two-week cycle from the start of the project to the signing of a binding contract. With such tight deadlines, the highly detailed simulations by powerful contemporary simulation packages such as Witness, Arena, and AutoMod require too much time to develop, even with the built-in material handling constructs. There exists an urgent need for a design methodology that requires less detailed data, is less complex, and requires a shorter time-to-design. Typically the software programs that implement this type of design methodology are called rapid prototyping tools.The warehouse design has to satisfy a number of high-level objectives and constraints. Most high-level warehousing constraints are elastic, in other words, they can be violated with a certain penalty. We will develop a warehouse design formulation, whose overall structure is a multiperiod, multicommodity, capacitated network flow problem, where capacities are determined by binary configuration variables. There are costs associated both with the continuous flow and storage variables and the binary configuration variables. The formulation hence belongs to the class of mixed-integer linear programming problems. Such problems are known to be difficult to solve for large problem instances. While we realize that the data on which the design i s based is subject to a large degree of uncertainty and even the warehouse mission may change significantly over the lifetime of the warehouse, we assume at the current time that all data is deterministic and known with complete certainty.1.1 Science-Based Design MethodologyA scientific design methodology must satisfy certain necessary conditions. First it must be able to search over a large solution space that is not limited by the experience or intuition of the designer. In other words, it must be capable of generating “new” alternatives that were not known before the start of the design effort. A second requirement is that the result of the design effort must be repeatable. In other words, given an identical set of data, the same design should be g enerated. Given the large set of data and complex design calculations, the design procedure must also be programmable so that powerful computational tools can be developed to increase the designquality and reduce the design time.Due to the complexity of the design problem, a hierarchical design procedure appears to be a natural choice for a design framework. In any hierarchical design procedure, several questions must be addressed. The first decision determines at which level in the hierarchy different design decisions are made. The second decision determines how the decisions made in the different levels interact to generate a complete design specification. Often an iterative procedure is specified and for such procedures the convergence and optimality properties must be determined. Any design procedure must strike a balance between solution quality, solution resolution or level of detail, and solution time.Even though warehouse design is a very common activity during the configuration of logistics systems, there does not appear to exist a large literature focused on warehouse design. The warehouse design problem has been discussed by Frazelle (1996) and Ackerman (1999). An early review of models and design procedures by Ashayeri and Gelders (1985) advocate the combination of optimization and simulation design algorithms. Cormier and Gunn (1992) provide an early review of warehousing models, while Rouwenhorst et al (2000) and van den Berg and Zijm (1999) give a more recent reviews. Graves (1998) reports that there exist a large body of literature on the analysis and isolated design of warehousing components. Two hierarchical design procedures have been proposed by Gray et al. (1992) and Miller (2001). This manuscript is a progress report on a multi-year, multi-faculty effort in the Keck Virtual Factory Lab and some of the earlier results are presented several research proceedings such as Goetschalckx et al. (2001).2. Formulation Development – Warehouse System FormulationAn iterative hierarchical design procedure is proposed. At the top level the procedure iterates between a capacitated material flow model (CMF) and a warehouse block layout model (WBL). The CMF determines the major material flows through the warehouse and the technologies and equipment installed in the warehouse. The WBL determines the warehouse layout and thus the distances traveled by the various material flows. The CMF calls two types of sub models. The first type models all the activities inside a functional area and the second type models the transportation activities between various functional areas. Following is summary of the structure, constraints, and objectives of the formulation. A detailed formulation containing the mathematical equations is given in Goetschalckx and Huang (2001).2.1 Objective FunctionThe objective function is typically related to the economic performance of the warehousing system. The most common objective is the minimization of the sum of the time-discounted costs associated with operating t he warehouse. Both one-time investment costs, annual or major time-unit fixed costs, and variable costs can be included in the objective function.2.2 Functional AreasThe warehouse is modeled as a collection of components, also called departments or functional areas. These components are connected by a function flow network, which models the flow of materials from arrival at to departure from the warehousing system. The functional flow network is illustrated in Figure 1. The individual components are subject to constraints. The function flow network also requires conservation of flow constraints between the individual components. An example of a functional area would reserve storage.Material flow Function-to-space mapping2.3 Commodity flowsDifferent product or commodity flows arrive at the warehouse, pass through the functional areas of the warehouse, and finally depart the warehousing system. The number of commodity flows m odeled in the warehouse should be kept as small as possible to maintain control of the model size, data, and algorithm requirements, but it should belarge enough to capture the major activities in the warehouse. Pareto analysis may be used to group the l arge number of SKUs in a small number of commodities with similar characteristics, such as flow path, physical characteristics, and schedules. A different commodity flow is also defined for the three major unit load sizes being stored and handled in the w arehouse: pallet (also called unit load), case (also called box or carton), and item (also called piece).2.4 TechnologiesEach module or functional area that is implemented in the warehouse must use one or more technologies to execute its function. For example, the principal technologies for pallet-sized unit load storage are floor stacking, single deep rack, double deep rack, and deep lane storage. The main performance requirements for a pallet storage area are storage capacity and maximum input and output flows per time unit. The main resource requirements associated with a pallet storage area are floor space, cubic space, labor, material handling equipment acquisition and operating costs, and investment and operating capital. In the next paragraphs the variables and constraints to model these characteristics will be developed.The flow capacity of a technology has to be determined in advance. It is assumed that each technology is sufficiently configured before it is entered into the model so that the flow capacity, the storage capacity, and the cost coefficients can be determined. For example, an AS/RS system with four or fives aisles would be modeled as two different technologies, one with four aisles and one with five aisles, because of the significant impact of the number of aisles on the throughput capacity and cost of the AS/RS.2.5 ResourcesIf joint capacity restrictions exist that impact more than a single commodity, resources model these capacity restrictions. Typical resources are labor hours by labor grade, equipment hours by equipment type, space such as two-dimensional floor space and three-dimensional cubic space, and investment budget. By definition resources have a maximum availability during each time period.2.6 Generalized Conservation of FlowThere are three possible types of generalized conservation of flow constraints that must be enforced in order to yield a feasible warehouse design. The first type is the traditional balance of flow by commodity and time period of input and output flows in a functional area. The second type is the balance of flow across time periods, which incorporates the storage and inventory effects. The third type is the balance of flow among different commodities when commodities are transformed into another commodity. The prime example is a case picking functional area where all input flows are in pallets, but all output flows are in cartons or cases. The types are cumulative, in other words, type three constraints incorporate all effects of type one and type two. The goal is to keep the model as simple as possible, so if type one constraints suffice, type two and type three constraints will not be included in the model for that functional area.Type one constraints ensure balance of input and output flows and consistency with the throughput flow for a functional area. It should be noted that type one constraints do not incorporate any relationship between material flows in different time periods. Type two constraints incorporate in addition the initial and final inventory of the commodity in a functional area. Type two constraints model the relationships between material flows in different time periods.The conservation of flow constraints of type three model the transformation of one commodity into another commodity in a functional area. This type of conservation constraints is typically associated with manufacturing and supply chains, but it occurs also in warehousing. The prime example of such transformation operations are case picking operations, where the products enter the area on pallets and leave the functional area as individual cases. Here two different commodities are required to model the different physical characteristics of the material flows, even though all products in the warehouse may follow the same flow path and be otherwise identical.While each of the constraints or objective function components has a simple structure, the overall formulation represents a mixed-integer programming formulation. In addition, the costs and constraints associated with the various technologies may generate nonlinear models. It is very important to keep the number of commodities to a minimum to constrain the overall size of the formulation. The greatest challenge however is to determine and validate the data required to populate this formulation.Our next efforts will focus on constructing the formulation for a warehouse example out of the literature. This will be followed by computational experiment.3. Formulation Development – Small Parts Functional Area Formulation3.1 IntroductionIn this section we will describe the formulation developed for the storage of small parts. This type of functional area is present in repair parts warehouses and warehouse for small parts consumer and industrial products. There exist several alternative technologies for a small parts storage system, ranging from the low-investment bin shelving, through modular storage drawers, horizontal and vertical carousels, microload, and automated A-frame. To our knowledge, the only models for the design of such systems are given in a series of publications by the Material Handling Research Center in the late 1980’s and early 1990’s. Examples are Frazelle (1988, 1989), Frazelle and McGinnis (1989), Choe and Sharp (1992), Sharp et al (1991), Sharp and Yoon (1996), Herrera-Cuellar (1984), and Houmas (1986). The models presented there calculate the equipment cost, labor cost, and space requirements for technologies for small parts storage. The objective is minimize the aggregate sum of labor, equipment, and space costs, subject to technology constraints and a list of parts to be stored with a given maximum inventory per part. We will consider in this manuscript only two storage technologies: modular storage drawers and bin shelving.The formulations for the design of such small parts storage systems result in very large mixed-integer formulations. The integer variables correspond to the configuration and sizing of the technology. The orientation, assignment, and location of the parts can either be modeled with integer or continuous variables. These mixed-integer formulations cannot be solved to optimality in the framework of the iterative warehouse design algorithm because of their excessive computational requirements. There exist three possible approximations that can reduce the computational burden: 1) approximation of the comprehensiveness or completeness of the model by ignoring factors and cost categories, 2) approximation of modeling realism by aggregating individual parts or aggregating part and storage module dimensions, and 3) approximation of solution quality by accepting heuristic rather than optimal solutions. The extent of approximation in model and solution algorithm should be consistent. There exists very little benefit in spending additional computational resources to find an optimal solution to a very approximate formulation. It should be observed that each of the levels of the model completely answers all the design questions associated with its technology, albeit at different levels of detail. The models can thus be used independently or in parallel. The models can be used to validate each other and higher level models can be used to refine the parameter values for lower level models. Houmas (1986) d escribes a design procedure based on the sequential use of models, where each level answers a part of all the design questions and the models are used in a sequential manner.We developed three consistent models for the small parts storage systems design with increasing level of detail.3.2 Continuous Model (Level One)The continuous model computes the number of required shelving units or modular storage drawer units based on the aggregate cubic volume that has to be stored for all parts and the approximate net cubic volume that each shelving unit or drawer unit provides. The physical dimensions in the three axes for the parts and the storage units are ignored. The part storage inventory volume can be thought of as a deformable shape, such as water balloon, of the correct volume. Hence, this level of model is often called the fluid level or fluid model. The number of storage units is computed by rounding up the ratio of the total volume required divided by the volume capacity of each storage unit. The number of aisles is computed by rounding up the ratio of the total number of storage units and the number of units on both sides of an aisle. The area cost and equipment costs are computed directly in function of the number of storage units and footprint of the aisles. Labor cost is computed based on an average extraction time and replenishment time and then multiplied by the number of extractions (line items) and replenishments and the wages. This model does not include calculations of the number of drawers or shelves, only of drawer units and shelf units. The main advantage of this fluid model is that it can be solved extremely fast. Its level of accuracy may be sufficient to exclude a particular technology, e.g., bin shelving may be eliminated from further consideration because it requires too much space or modular drawer technology may be eliminated based on its investment cost. A more detailed description and development of the two fluid models for small parts storage based on bin shelving and modular drawer technologies are given in Goetschalckx et al. (2002).3.3 Vertical Dimension Model (Level Two)The vertical dimension model explicitly considers the vertical dimension of the individual parts, the number of layers of the parts stacked on top of each other in the storage drawer or shelf, and the vertical size of the modular drawers and the vertical distance between shelves in the shelving units. However, the other two dimensions of the part are still aggregated to yield a continuous area. Hence, the inventory of parts is considered to “fit” in a drawer if the sum of the areas of the parts in the drawer is less than or equal to the horizontal area of the drawer. The solution provides the assignment of individual parts to individual shelves, so that extraction times can include the vertical location of the parts in the shelving unit to model the “golden zone” for part extraction. The number of drawers or shelves iscomputed explicitly in the model. The aggregate cost calculations are performed i n a similar manner as for the continuous model, but the costs of drawers and shelves is included explicitly. The calculations in this model are much more realistic than in the continuous model, but the model can easily contain hundreds of thousands of variables and constraints. Since the technology sub-models have to be solved for repeatedly, heuristic solution methods are almost surely required. This level of model can be used to evaluate a limited number of alternative designs. A more detailed description of this level of model can be found in Goetschalckx and Huang (2001).3.3 Three-Dimensional Model (Level Three)The three dimensional model explicitly considers all three dimensions of the individual parts and the three dimensions of the storage drawer or shelf. The maximum number of layers can still be computed in advance for every combination of part and drawer or shelf. Computing the number of shelves thus involves solving a very large number of two-dimensional bin-packing problems. The number of constraints and variables is even larger than in the vertical dimension model, and the solution algorithms are much more demanding. This level of model can only be used to configure the final, selected technology for the small parts storage. It is the solution of this level of model than then can be used in digital simulation to verify the feasibility of the proposed warehouse design.4. Iterative Warehouse Design AlgorithmThe above formulation, encompassing both the system model and the various functional areas and technology sub-modes, are posed and solved before the layout of the warehouse is known, since at this time the required areas for the functional areas are unknown because their technologies have not yet been defined. This implies that the formulation cannot contain costs and resources used associated with inter-departmental moves and transportation. To determine the warehouse configuration and layout, we propose the following iterative algorithm.1. Solve the Capacitated Material Flow (CMF) f ormulation developed above. For each functional area thesolution determines the one or more technologies used, the required area for each functional area, and the material flows between the various functional areas.2. Based on the required areas for each f unctional department and the material flows solve the WarehouseBlock Layout (WBL) formulation. Traditional techniques for determining the block layout can be used. The resulting layout solution determines the location of each functional area and the dis tances between the various functional areas.3. Compute the required transportation resources and cost and add them to the objective function of CMF toobtain the overall cost of warehousing operations.4. If so desired, the cost parameters for the CMF formulation can be updated and CMF and WBL solvediteratively until both solutions converge.To solve the above formulation, the following technologies are currently used. All the data parameters and solution variables are stored in an object-oriented database. To solve the mixed-integer formulations, we use the MIP module of CPLEX, a commercial linear programming solver. A variety of custom heuristics for sizing and allocation of parts also has been developed and implemented. A custom program has been developed to extract the data from the database and populate the formulation and to extract the values of the decision variables of the solution and insert them back into the database. The current database is implemented in Microsoft Access.5. Future ResearchAt the current time, numerical experiments are being conducted to judge the required data parameters for the technology sub-models and the required running times for the various levels of solution algorithms. The iterative algorithms proposed in this manuscript may or may not converge to single design. Other decomposition schemes that have proven convergence are in their first stage of development.An obvious extension is to include more technology alternatives for the small parts storage and extraction processes. Models for more mechanized systems such as carousels, microloads, and A-frames have to be included to allow the system model to select the appropriate technology for this functional area.The data on which the design is based is subject to a large degree of uncertainty, because products and business conditions have to be forecasted. The warehouse mission itself may change significantly over the lifetime of the warehouse. The current formulation and solution procedure assume that all data is deterministic and known with complete certainty. An extension of the current formulation is to incorporate explicitly the uncertainty, which would result in a stochastic mixed-integer optimization problem.AcknowledgementsThis work has been funded jointly by the W. M. Keck Foundation, the Ford Motor Company and the National Science Foundation under grant no. DMI-0000051. The authors would like to acknowledge industry collaboratorsfrom The Progress Group, UPS Logistics Group, Americold Logistics, EXE Technologies, Manhattan Associates, Richard Muther & Associates, Sara Lee and William Carter Co.References1. Ackerman, K. B., (1999), “Designing Tomorrow's Warehouse: A Little Ahead of the Times,” Journal of BusinessLogistics, Vol. 20, No. 1, pp. 1-4.2. Ashayeri, J. and Gelders, L. F., (1985), “Warehouse Design European Journal of OperationalResearch, Vol. 21, pp. 285-294.3. Choe, K.-I. and Sharp, G. P., (1991), "Small Parts Order Picking: Design and Operation," MHRC TR-89-07, GeorgiaTech, August.4. Cormier, G. and E. Gunn, (1992), “A Review of Warehouse Models,” European Journal of OperationalResearch, Vol. 58, pp. 1-13.5. Frazelle E. H., (1988). "Small Parts Order Picking: Equipment and Strategy". Warehousing Education andResearch Council, Oak Brook, Illinois.6. Frazelle, E. H. (1989), “Small Parts Order Picking: Equipment and Strategy, ”Proceedings of the 10th InternationalConference on Automation in Warehousing, pp. 115-145.7. Frazelle, E. H. (1996), World-Class Warehousing, Atlanta, Georgia, Logistics Resources International, Inc.8. Frazelle, E. H. and McGinnis, L. F., (1989), "Small parts order picking: key component of assembly, AssemblyEngineering, Vol. 32, No. 7, 21-23.9. Goetschalckx, M., T. Govindaraj, D. A. Bodner, L. F. McGinnis, G. P. Sharp and K. Huang. (2001), "A Review andDevelopment of a Warehousing Design Methodology, Normative Model, and Solution Algorithms,"Proceedings of the 2001 Industrial Engineering Research Conference, Dallas, Texas, 2001.10. Goetschalckx, M. and K. Huang, (2001), “A Framework for Systematic Warehousing Design,” Virtual Factory LabResearch Report, Georgia Institute of Technology, Atlanta, Georgia.11. Goetschalckx, M., T. Govindaraj, D. A. Bodner, L. F. McGinnis, G. P. Sharp and K. Huang. (2001), “A systematicdesign procedure for small parts warehousing systems using modular drawer and bin shelving systems,”Proceedings of the Material Handling Research Colloquium (MHRC) 2002, Portland, Maine.12. Graves, R., (1998), "A Review of Material Handling Research Publications," Proceedings of the 5th InternationalColloquium on Material Handling Research, June 20-23, 1998, Phoenix, Arizona, Material Handling Institute, Charlotte, NC.13. Gray, A. E., Karkamar, U. S., and Seidmann, A., (1992), “Design and Operation of an Order-ConsolidationWarehouse: Models and Application,” European Journal of Operational Research, Vol. 58, No. 10, pp. 14-36. 14. Herrera-Cuellar, C., (1984), “Analysis of small parts storage in modular drawers and shelves”, UnpublishedMasters Thesis, Georgia Institute of Technology, Atlanta, Georgia.15. Houmas, C. G., (1986), “Comparing small parts storage systems,” Unpublished Masters Thesis, Georgia Instituteof Technology, Atlanta, Georgia.16. Miller, T. (2001), Hierarchical Operations and Supply Chain Planning, Springer-Verlag, London, Great Britain.17. Rouwenhorst, B. et. al., (2000), "Warehouse design and control: Framework and literature review", EuropeanJournal of Operational Research, Vol. 122, No. 3, pp. 515- 533.18. Sharp, G. P., Choe, K., and Yoon, C. S., (1991), "Small Parts Order Picking: Analysis Framework and SelectedResults," in Progress in Material Handling and Logistics, Vol. II, White, J. A. and Pence, I. (eds.), Springer Verlag.19. Sharp, G., and Yoon, C. S. (1996), "A Structured Procedure for Order Pick System Analysis and Design," IIETransactions, Vol. 28, pp. 379-389.20. van den Berg, J. and W. Zijm, (1999), “Models for warehouse management: classification and examples,”International Journal of Production Economics, Vol. 59, pp. 519-528.。