检索结果-内蒙古大学图书馆

algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2008年第3-4期37卷 354-370页

作者： Jungwattanakit, Jitti Reodecha, Manop Chaovalitwongse, Paveena Werner, Frank Otto VonGuericke Univ Magdegurg Fac Math D-39016 Magdeburg Germany Chulalongkorn Univ Dept Ind Engn Fac Engn Bangkok 10330 Thailand

In textile industries, production facilities are established as multi-stage production flow shop facilities, where a production stage may be made up of parallel machines. This known as a flexible or hybrid flow shop environment. This paper considers the problem of scheduling n independent jobs in such an environment. In addition, we also consider the general case in which parallel machines at each stage may be unrelated. Each job is processed in ordered operations on a machine at each stage. Its release date and due date are given. The preemption of jobs is not permitted. We consider both sequence- and machine-dependent setup times. The problem is to determine a schedule that minimizes a convex combination of makespan and the number of tardy jobs. A 0-1 mixed integer program of the problem is formulated. Since this problem is NP-hard in the strong sense, we develop heuristic algorithms to solve it approximately. Firstly, several basic dispatching rules and well-known constructive heuristics for flow shop makespan scheduling problems are generalized to the problem under consideration. We sketch how, from a job sequence, a complete schedule for the flexible flow shop problem with unrelated parallel machines can be constructed. To improve the solutions, polynomial heuristic improvement methods based on shift moves of jobs are applied. Then, genetic algorithms are suggested. We discuss the components of these algorithms and test their parameters. The performance of the heuristics is compared relative to each other on a set of test problems with up to 50 jobs and 20 stages.

关键词： flexible flow shop scheduling mathematical programming constructive algorithms genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A cooperative constructive method for neural networks for pattern recognition

引用

PATTERN RECOGNITION 2007年第1期40卷 80-98页

作者： Garcia-Pedrajas, Nicolas Ortiz-Boyer, Domingo Univ Cordoba Dept Comp & Numer Anal Cordoba Spain

In this paper, we propose a new constructive method, based on cooperative coevolution, for designing automatically the structure of a neural network for classification. Our approach is based on a modular construction of the neural network by means of a cooperative evolutionary process. This process benefits from the advantages of coevolutionary computation as well as the advantages of constructive methods. The proposed methodology can be easily extended to work with almost any kind of classifier. The evaluation of each module that constitutes the network is made using a multiobjective method. So, each new module can be evaluated in a comprehensive way, considering different aspects, such as performance, complexity, or degree of cooperation with the previous modules of the network. In this way, the method has the advantage of considering not only the performance of the networks, but also other features. The method is tested on 40 classification problems from the UCI machine learning repository with very good performance. The method is thoroughly compared with two other constructive methods, cascade correlation and GMDH networks, and other classification methods, namely, SVM, C4.5, and k nearest-neighbours, and an ensemble of neural networks constructed using four different methods. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

关键词： constructive algorithms pattern classification evolutionary computation neural networks cooperative coevolution

来源：评论

学校读者我要写书评

暂无评论

Genetic and Bacterial Programming for B-Spline Neural Networks Design

引用

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2007年第2期11卷 220-231页

作者： Botzheim, Janos Cabrita, Cristiano Koczy, Laszlo T. Ruano, Antonio E. Budapest Univ Technol & Econ Dept Telecommun & Media Informat Magyar Tudosok Krt 2 H-1117 Budapest Hungary Univ Algarve Ctr Intelligent Syst P-8000 Faro Portugal Szechenyi Istvan Univ Inst Informat Technol & Elect Engn Gyor Hungary

The design phase of B-spline neural networks is a highly computationally complex task. Existent heuristics have been found to be highly dependent on the initial conditions employed. Increasing interest in biologically inspired learning algorithms for control techniques such as Artificial Neural Networks and Fuzzy Systems is in progress. In this paper, the Bacterial Programming approach is presented, which is based on the replication of the microbial evolution phenomenon. This technique produces an efficient topology search, obtaining additionally more consistent solutions.

关键词： constructive algorithms B-splines bacterial programming genetic programming

来源：评论

学校读者我要写书评

暂无评论

Effective algorithms for parametrizing linear control systems over Ore algebras

引用

APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING 2005年第5期16卷 319-376页

作者： Chyzak, F Quadrat, A Robertz, D INRIA Sophia Antipolis CAFE Project 2004 F-06902 Sophia Antipolis France INRIA Rocquencourt ALGO Project F-78153 Le Chesnay France Rhein Westfal TH Aachen Lehrstuhl Math B D-52056 Aachen Germany

In this paper, we study linear control systems over Ore algebras. Within this mathematical framework, we can simultaneously deal with different classes of linear control systems such as time-varying systems of ordinary differential equations (ODEs), differential time-delay systems, underdetermined systems of partial differential equations (PDEs), multidimensional discrete systems, multidimensional convolutional codes, etc. We give effective algorithms which check whether or not a linear control system over some Ore algebra is controllable, parametrizable, flat or pi-free.

关键词： linear systems over Ore algebras parametrization flatness constructive algorithms non-commutative Grobner bases module theory

来源：评论

学校读者我要写书评

暂无评论

B-spline and neuro-fuzzy models design with function and derivative equalities

B-spline and neuro-fuzzy models design with function and der...

引用

5th International Symposium on Intelligent Automation and Control/9th International Symposium on Manufacturing and Applications held at the 6th Biannual World Automation Congress

作者： Cabrita, C Ruano, A Univ Algarve Ctr Intelligent Syst Algarve Portugal

ISBN: (纸本)1889335223

The design of neuro-fuzzy models is still a complex problem, as it involves not only the determination of the model parameters, but also its structure. Of special importance is the incorporation of a priori information in the design process. In this paper two known desigm algorithms for B-spline models will be updated to account for function and derivatives equality restrictions, which am important when the neural model is used for performing single or multi-objective optimization on-line.

关键词： constructive algorithms B-Splines neuro-fuzzy systems genetic programming

来源：评论

学校读者我要写书评

暂无评论

Navigating mobile robots with a modular neural architecture

引用

NEURAL COMPUTING & APPLICATIONS 2003年第3-4期12卷 200-211页

作者： Silva, C Ribeiro, B Univ Coimbra Ctr Informat & Sistemas P-3030 Coimbra Portugal

Neural architectures have been proposed to navigate mobile robots within several environment definitions. In this paper a new neural modular constructive approach to navigate mobile robots in unknown environments is presented. The problem, in its basic form, consists of defining and executing a trajectory to a predefined goal while avoiding all obstacles, in an unknown environment. Some crucial issues arise when trying to solve this problem, such as an overflow of sensorial information and conflicting objectives. Most neural network (NN) approaches to this problem focus on a monolithic system, i.e., a system with only one neural network that receives and analyses all available information, resulting in conflicting training patterns, long training times and poor generalisation. The work presented in this article circumvents these problems by the use of a constructive modular NN. Navigation capabilities were proven with the NOMAD 200 mobile robot.

关键词： constructive algorithms mobile robot navigation modular neural networks sensor fusion

来源：评论

学校读者我要写书评

暂无评论

Learning long-term dependencies by the selective addition of time-delayed connections to recurrent neural networks

引用

NEUROCOMPUTING 2002年第1-4期48卷 251-266页

作者： Boné, R Crucianu, M de Beauville, JPA Ecole Ingn Informat Ind Lab Informat F-37200 Tours France

Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time-series modeling. Unfortunately, long-term dependencies are difficult to learn if gradient descent algorithms are employed. We support the view that it is easier for these algorithms to find good solutions if time-delayed connections are included in the recurrent networks. The algorithm we present here allows one to choose the right locations and delays for such connections. As we show on several univariate benchmarks and one multivariate real-world problem, this algorithm produces very good results while keeping the total number of connections in the recurrent network to a minimum. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： recurrent networks long-term dependencies constructive algorithms time-delayed connections

来源：评论

学校读者我要写书评

暂无评论

Application of adaptive constructive neural networks to image compression

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 2002年第5期13卷 1112-1126页

作者： Ma, LY Khorasani, K Concordia Univ Dept Elect & Comp Engn Montreal PQ H3G 1M8 Canada

The objective of this paper is the application of an adaptive constructive one-hidden-layer feedforward neural networks (OHL-FNNs) to image compression. Comparisons with fixed structure neural networks are performed to demonstrate and illustrate the training and the generalization capabilities of the proposed adaptive constructive networks. The influence of quantization effects as well as comparison with the baseline JPEG scheme are also investigated. It has been demonstrated through several experiments that very promising results are obtained as compared to presently available techniques in the literature.

关键词： feedforward neural networks (FNNs) constructive algorithms image compression generalization capability

来源：评论

学校读者我要写书评

暂无评论

SEPARATE: A machine learning method based on semi-global partitions

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS 2000年第3期11卷 710-720页

作者： Castro, JL Delgado, M Mantas, CJ Univ Granada Dept Comp Sci & Artificial Intelligence E-18071 Granada Spain

This article presents a machine learning method for solving classification and approximation problems. This method uses the divide-and-conquer algorithm design technique (taken from machine learning models based on a tree), with the aim of achieving design ease and good results on the training examples and allows semi-global actions on its computational elements (a feature taken from neural networks), with the aim of attaining good generalization and good behavior in the presence of noise in training examples. Finally, some results obtained after solving several problems with a particular implementation of SEPARATE are presented together with their analysis.

关键词： constructive algorithms divide-and-conquer neural networks

来源：评论

学校读者我要写书评

暂无评论

Application of cascade correlation networks for structures to chemistry

引用

APPLIED INTELLIGENCE 2000年第1-2期12卷 117-146页

作者： Bianucci, AM Micheli, A Sperduti, A Starita, A Dipartimento Sci Farmaceut I-56126 Pisa Italy Univ Pisa Dipartimento Informat I-56125 Pisa Italy

We present the application of Cascade Correlation for structures to QSPR (quantitative structure-property relationships) and QSAR (quantitative structure-activity relationships) analysis. Cascade Correlation for structures is a neural network model recently proposed for the processing of structured data. This allows the direct treatment of chemical compounds as labeled trees, which constitutes a novel approach to QSPR/QSAR. We report the results obtained for QSPR on Alkanes (predicting the boiling point) and QSAR of a class of Benzodiazepines. Our approach compares favorably versus the traditional QSAR treatment based on equations and it is competitive with 'ad hoc' MLPs for the QSPR problem.

关键词： Cascade Correlation networks constructive algorithms gradient descent QSPR QSAR

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：