Approaches to the Cutting Stock Problem

In this paper, we survey various approaches to the cutting stock problem; available computational experience is discussed. The intention is to synthesize the considerable work that has been done on this problem. The different approaches studied will include column generation, zero-one programming, combinatorial heuristics, and subgradient optimization. Applications to related combinatorial optimization problems are mentioned.     

Geometric Approaches to Solve the Chebyshev Traveling Salesman Problem

Several heuristic procedures based on geometric concepts have been developed for the Chebyshev (or too) Traveling Salesman Problem (CTSP),which has numerous applications in materials handling and information storage-retrieval. The following study is concerned with evaluating the performance of geometric approaches as a function of the shape of the service region and the number of points to be sequenced. A new approach, the band insertion heuristic, is also introduced and compared with existing procedures. Trade-offs in tour quality and solution effort are the primary focus of the study, which is empirical in nature; however, the results generally apply to a wide range of configurations.     

热电材料:古老的课题,新的研究方法

本文简述了热电材料发展的历史,并对目前热电新材料的研究及制备方法作了概述。指出热电材料的研究将会成为我国材料研究领域的下一个热点。     

再论运输问题的多重最优解

在对运输问题研究成果综述的基础之上,归纳出了多重最优解、有限多重最优解、无限多重最优解、狭义多重最优解以及广义多重最优解等概念.讨论了运输问题多重最优解的进一步分类及判定问题,得到了有限多重最优解和无限多重最优解的判定定理.指正了有关文献中关于多重最优解个数下限的计算公式,给出了有限多狭义多重最优解个数下限的计算公式.最后,举例验证了结论的正确性.     

模糊理想解法在多准则群决策中的应用

将模糊数学理论引入到不确定环境下的多准则群决策问题中,利用模糊理想解法进行方案排序.用三角模糊数来描述模糊准则权重和模糊准则属性值,给出了使用模糊理想解法进行群决策问题求解的一般步骤;通过供应商选择这一实例验证了本方法的有效性.     

Branch-and-Bound and Heuristic Approaches to a Sequencing Problem with Team-Size Requirements

This paper is concerned with sequencing a finite number of jobs when there is a fixed number of identical machines and each job requires several machines working simultaneously for a given length of time. Performance criteria are minimizing average completion time and minimizing the maximum completion time. Optimal solutions for small problems were computed by branch-and-bound. Heuristic sequencing rules were applied to the same problems and a set of larger problems. Sequencing jobs by giving preference to large machine-hour requirements and then reversing the schedule gave fairly good performance on both measures, although other methods work better against the average completion time criteria.     

Sequencing Three-Stage Flexible Flowshops with Identical Machines to Minimize Makespan

We study the problem of sequencing n jobs on a three-stage flowshop with multiple identical machines at each stage (a flexible flowshop). The objective is to minimize the makespan. Since the problem is strongly NP-complete. we develop and compare several heuristic procedures of time complexity 0(nlogn). We were successful in deriving the worst case performance bound of one procedure. We have also developed several lower bounds that serve as datum for comparison; the lower bound used in the evaluation is always the best among them. Extensive experiments were conducted to evaluate the performance of the proposed procedures, and preferences are concluded based on their average performance.     

A Numerical Approach to the Problem of Multiple Scattering of Electromagnetic Radiation

An iterative method is presented for evaluating the multiple scattering of electromagnetic radiation applicable to a discrete distribution of scatterers. The approach saves computational time by using a two-point function representing the nth-order scattering to evaluate the (n+ 1)th-order field. In order to achieve this, the intermediate results of each iteration are stored and retrieved as required.     

三阶三点边值问题无穷多个正解的存在性

本文借助于Krasnosel'skii锥拉伸与锥压缩不动点定理研究了非线性三阶三点边值问题无穷多个的存在性问题。     

同时最优化时间表长与总完工时间的双代理单机序列分批排序问题（英）

本文研究在一台序列分批处理机上同时最优化$A$代理的时间表长和$B$代理的总完工时间的双代理排序问题．在序列分批的背景下,工件被分批加工（但不同代理的工件不能在同一批中加工,且每个代理都希望最小化仅依赖于各自工件完工时间的费用函数）且一批的加工时间等于这一批中所有工件的加工时间和．而且在一个新批开始加工前,机器有一个常数的安装时间．此外,根据批容量,序列分批模型又被分成有界模型和无界模型．在本文中,我们对所研究问题的有界模型和无界模型分别给出了一个多项式时间算法．     

菱镁砼构件若干问题的探讨

应用菱镁砼构件作机电产品的包装材料,与木材相比,具有重大的经济效益、社会效益和生态效益;但如果菱镁砼构件质量不好,会收到适得其反的作用。本文重点介绍锯末、卤水对菱镁砼质量的影响,及对菱镁砼构件几种结构设计的探讨。     

Capacitated Multiple Item Ordering Problem with Quantity Discounts

Purchasing managers face a complex problem when determining order quantities for multiple items in the presence of quantity discounts and resource limitations. In this paper, the problem is formulated as a mathematical programming model. An efficient solution algorithm is developed utilizing the Lagrangian relaxation approach. Extensive computational experiments are performed and the results are presented.     

Approaches to design

There has been a tendency to accept the systems approach as a universal method of tackling complex problems. It is argued that there are some situations in which other approaches may be more useful guides during a search of the solution space.     

Minimizing Makespan on Mixed Mass Production Lines of Two and Three Machines

１ＩｎｔｒｏｄｕｃｔｉｏｎＯｎｍｉｘｅｄｍａｓｓｐｒｏｄｕｃｔｉｏｎｌｉｎｅｓｔｈｅｒｅｉｓａｋｉｎｄｏｆｃａｓｅｔｈａｔｊｏｂｉｃａｎｂｅｐｒｏｃｅｓｓｅｄｏｎｍａｃｈｉｎｅｋ＋１ｗｈｅｎａｐａｒｔｏｆｔｈｅｐｒｏｃｅｓｏｆｊｏｂｉｆｉｎｉｓｈｅｓ...     

基于混合模拟退火算法的多阶段库存路径问题研究

研究单个集散点与多个客户之间的运输问题,综合考虑物流系统的库存成本、运输成本以及卡车的租用成本等因素,以实现总费用的最小化,并将其抽象成多阶段库存路径问题。以每个时间阶段各个客户的订购量为研究对象,采用混合模拟退火算法进行求解,算法中加入了C-W节约算法产生初始解,通过多路径的插入与交换操作来对初始可行解进行改进。数值实验证明了库存路径问题得到的解要优于一般的车辆路径问题得到的解,本文还对库存路径问题中的单位货物库存成本专门进行了分析研究,以确定其取值范围对物流系统总费用的影响。     

多重网格--特征有限元方法计算地下水溶质运移问题

本文用多重网格特征有限元方法求解溶质运移问题,有效的克服了通常数值方法中数值弥散、计算速度慢、计算量大等缺点。     

Approaches for Discrete Alternative Multiple Criteria Problems for Different Types of Criteria

In this paper we address two classes of sdiscrete alternative multiple criteria decision making problems: problems in which ordinal and cardinal criteria are simultaneously involved and problems in which only cardinal criteria are involved. We suggest variations of our previously developed ordinal criteria approach [5] and we test the approaches on randomly generated problems. Our evaluation criteria are: the capability of the approach to find a highly preferred alternative and the amount of information required of a decision maker.     

Exploring the Approaches to Data Flow Computing

Architectures based on the data flow computing model provide an alternative to the conventional Von-Neumann architecture that are widely used for general purpose computing. Processors based on the data flow architecture employ fine-grain data-driven parallelism. These architectures have the potential to exploit the inherent parallelism in compute intensive applications like signal processing, image and video processing and so on and can thus achieve faster throughputs and higher power efficiency. In this paper, several data flow computing architectures are explored, and their main architectural features are studied. Furthermore, a classification of the processors is presented based on whether they employ either the data flow execution model exclusively or in combination with the control flow model and are accordingly grouped as exclusive data flow or hybrid architectures. The hybrid category is further subdivided as conjoint or accelerator-style architectures depending on how they deploy and separate the data flow and control flow execution model within their execution blocks. Lastly, a brief comparison and discussion of their advantages and drawbacks is also considered. From this study we conclude that although the data flow architectures are seen to have matured significantly, issues like data-structure handling and lack of efficient placement and scheduling algorithms have prevented these from becoming commercially viable.     

包装创新设计方法探析

产品的生命在于创新，任何产品都需要不断地改进，注入新的因素，才能获得新的生命力。产品包装也无例外，本文就产品包装的改进及创新设计方法进行分析探索。