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

3rd International Conference on Frontiers of Manufacturing Science and Measuring Technology (ICFMM 2013)

作者： Zhong Xiaoping Jin Peng Northwestern Polytech Univ Sch Aeronaut Xian 710072 Peoples R China

ISBN: (纸本)9783037858462

In previous studies guide-based blending including inner and outer blending has been found to be an efficient way to deal with large composite optimization problem considering structural integrity. A new blending model named generalized blending based on genetic algorithm for composite optimization is presented. First, On the basis of region division, a length-control indicator is introduced to decide the covered regions of each ply for the generalized blending model. Also, the master-slave parallel genetic algorithm(GA) is adopted to decrease optimization time. Finally, the three blending models are used for a large composite wing optimization. The result shows that the three optimal designs are manufacturable and the generalized blending model has more design freedom in blending designs.

关键词： Composite structure Optimal design parallel genetic algorithm Blending

来源：评论

学校读者我要写书评

暂无评论

parallelly generating halo orbit and its transfer trajectory in the full ephemeris model

引用

ASTROPHYSICS AND SPACE SCIENCE 2019年第1期364卷 7-7页

作者： Wu, Tao Pan, Xiao Xu, Ming Qu, Qingyu Xia, Qianhui Liu, Shengli Beihang Univ Beijing 100191 Peoples R China Beijing Univ Civil Engn & Architecture Beijing 102616 Peoples R China DFH Satellite Co Ltd Beijing 100094 Peoples R China

This paper employs a parallelized genetic algorithm in generating long-term bounded halo orbit and optimizing transfer trajectory from earth to it in the full ephemeris model. While the conventional gradient methods are lacking in precision as well as time-consuming, the parallel genetic algorithm (PGA) offers an access to large-scale computing based on the advanced hardware capability. Abounded halo orbit without any stationkeeping maneuver in five periods is obtained inside a defined pipe region in the ephemeris model. Transfer trajectory from earth to the obtained halo orbit is also investigated in this paper. By optimizing insertion impulses in the backward propagation and midcourse in the forward propagation, a transfer trajectory from earth to halo with least fuel consumption is generated. Furthermore, launch window is investigated based on the periodic variation about inclination of the injection point on the parking orbit. Amapping method from spatial space to i- subspace is introduced for solving the time delay and position deviation problem. The numerical method employed in this paper is of high accuracy based on large-scale computing capability as well as efficient without any analytical initial guess, which makes it extensive in designing these unstable libration point orbits.

关键词： Full ephemeris model parallel genetic algorithm Halo orbit Transfer trajectory

来源：评论

学校读者我要写书评

暂无评论

RegKnock: identifying gene knockout strategies for microbial strain optimization based on regulatory and metabolic integrated network

RegKnock: identifying gene knockout strategies for microbial...

引用

第六届全国生物信息学与系统生物学学术大会暨国际生物信息学前沿研讨会

作者：徐自祥孙际宾中国科学院系统微生物工程重点实验室中科院天津工业生物技术研究所天津 300308

Background: Gene knockout has been used to improve the conversion ratio of strains for some chemical *** on mixed integer bilevel linear programming (MIBLP) and cell network models, there have been several algorithms ... 详细信息

关键词： Gene knockout Mixed integer bilevel linear programming parallel genetic algorithm Metabolic-regulatory integrated network Systems biology Synthetic biology

来源：评论

学校读者我要写书评

暂无评论

A Programming Model of Air Routing Problems with Hard Time Window

A Programming Model of Air Routing Problems with Hard Time W...

引用

第10届创新与管理国际学术会议（ICIM2013）

作者： Tang Zhifen Xiao Hanbin Chen Jianhua School of Logistics Engineering Wuhan University of Technology China Railway Science & Industry Group Co. Ltd.

Regarding the air routing problems of logistics express delivery industry, we considered increasing cost so as to completely meet the delivery time requirement, a programming model of air routing problems with hard time window, which was solved by parallel genetic algorithm, was presented,Meanwhile, the soft time window model was constructed to compare with the result of the hard window's, by building and applying satisfaction function. Numerical contrast analysis showed that the hard time window is of high cost as well as a greater satisfaction degree. This planning is more suitable for the character and requirement of the mid-market logistics.

关键词： Hard time window Soft time window Vehicle routing problem Desirability function, Mid-market logistics parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Customers'Purchasing Behavior Clustering Based on Improved genetic algorithm

Customers'Purchasing Behavior Clustering Based on Improved G...

引用

2011 International Conference on Management Science and Intelligent Control(ICMSIC 2011)

作者： Xiaoyun Wang Institute of Management Science and Information Engineering Hangzhou DianZi University Hangzhou,China Yamei Shen Institute of Management Science and Information Engineering Hangzhou DianZi University Hangzhou,China

In view of the purchasing behavior of online customers, we construct the customer-merchandise matrix which is aiming to measure the similarity among customers'purchasing *** a consequence of that simple genetic algorithm has some shortcomings,in this paper,we proposes an improved hybrid parallel genetic algorithms which combines the efficiency and local search ability of k-means algorithm and the global optimization ability of parallel genetic algorithm,also we improve the genetic *** will enhance the efficiency of the algorithm by genetic variability in the populations and intermarriage evolution among ***,we use it to cluster the purchasing behavior of *** results show that the proposed method for customer behavior clustering provides higher efficiency and accuracy.

关键词： parallel genetic algorithm purchasing behavior Kmeans clustering

来源：评论

学校读者我要写书评

暂无评论

A Method for Composite Wing Box Optimization with Manufacturing Constraints

A Method for Composite Wing Box Optimization with Manufactur...

引用

2015 International Conference on Power Electronics and Energy Engineering（PEEE 2015）

作者： X.P.Zhong P.Jin Q.Han School of Aeronautics Northwestern Polytechnical University

ISBN: (纸本)9781510807648

An optimization strategy is presented for composite wing box structure using genetic algorithm with manufacturing ***,on the basis of region division and key region defined,both fiber orientation angle and covered length of each ply are treated as design variables to optimize laminate thickness and stacking sequence simultaneously while maintaining laminate ply ***,a parallel genetic algorithm(GA) is adopted to accelerate optimization ***,a composite wing box is used to demonstrate the effectiveness of the proposed *** result shows that the optimization method can obtain optimum design with light weight which satisfies manufacturing constraints for large composite wing structure.

关键词： composite wing box manufacturing constraints ply continuity parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

User Interest Model-based Image Retrieval Technique

User Interest Model-based Image Retrieval Technique

引用

2007 IEEE International Conference on Automation and Lofistics

作者： Jianhua Li Mingsheng Liu Yan Cheng Department of Computer and Information Engineering Shijiazhuang railway institute shijiazhuang Heb Handan college handan Hebei China Department of Automotive Engineering Hebei jiaotong vocational and technical college shijiazhuang

ISBN: (纸本)9781424415304;1424415306

The Content-Based Image retrieval (CBIR) system establishes the feature space by comprehending the content of an image and executing retrieval by measuring the similarity of images. With the development of CBIR, however, there are two problems. One is that since different researchers use different feature spaces, or use the same feature space but different description, then the measure is different, it is *** for retrieval to be universal, especially in WEB. Another is that currently CBIR tools designed for satisfying the needs of all users, special needs of individual user are not considered. Aimed at above problems, we establish the multi-feature spaces, by features of color layout descriptor and homogeneous texture descriptor, which considering both color and texture by human sense, and adjusting the weight of every feature space by applying PGA (parallel genetic algorithm) for matching the user interest. The result of experiment shows that the system is robust in general format by using MPEG-7, and can match the user *** as well.

关键词： Content-based Image Retrieval User interest MPEG-7 parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Continuous Dynamic Berth Allocation Strategy basing on Quay-crane Scheduling

Continuous Dynamic Berth Allocation Strategy basing on Quay-...

引用

2011 4th IEEE International Conference on Computer Science and Information Technology(ICCSIT 2011)

作者： Jinlong Chen Mechanical Engineering of Logistics Engineering College, Shanghai Maritime University Shanghai, China Ziqi Xu Logistics Engineering College Shanghai Maritime University Shanghai, China

For berth allocation problem of container terminal, this paper put the wharf line of terminal be continuous and consider the operation time of quay-crane for loading and unloading, formulating berth allocation model basing on the quay-crane scheduling. The objective of model is to minimize the total time of ships at the terminal and the amount of quaycranes' movements. Afterwards, to resolve the proposed model, a hybrid parallel genetic algorithm which combined parallel genetic algorithm and heuristic algorithm was employed. Eventually, for an example of a specific container terminal, the proposed model and algorithm was applied to make decisions on the berth allocation problem. Then comparing the scheduling scheme generated by the proposed approach and the actual scheme to demonstrate the availability and practicality of the model and algorithm.

关键词： bertht quay-crane continuous wharf line heuristic algorithm parallel genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Reduction Technique for Instance-based Learning Using Distributed genetic algorithms

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2011年第3期4卷 47-60页

作者： Al-Ramadin, Tahseen A. Al Hussein Bin Talal Univ Maan 71111 Jordan

This work addresses the problem of instance reduction using a distributed implementation of genetic algorithms. Different existing parallel and distributed models for parallelizing genetic algorithms are investigated and applied here to solve the problem of instance reduction. a new parallel model is proposed and implemented we called Global Control parallel genetic algorithm. The results showed enormous reduction in time of 90% over the other models. The resulted dataset showed an acceptable accuracy results on average over all datasets. The model achieved a better reduction in dataset size of 90.22% compared to the other models that didn't get better that 87.91%. Thus, the proposed distributed system model for instance reduction showed better performance over all model in reducing the time and even reducing the training dataset size while maintaining the same level of accuracy of the original sequential genetic algorithm.

关键词： Instance-based parallel genetic algorithm instance reduction training set

来源：评论

学校读者我要写书评

暂无评论

parallel Strength Pareto Multi-objective Evolutionary algorithm

Parallel Strength Pareto Multi-objective Evolutionary Algori...

引用

The Fourth International Conference on parallel and Distributed Computing, Applications and Technologies

作者： Shengwu Xiong Feng Li School of Computer Science and Technology Wuhan University of Technology

ISBN: (纸本)0780378407

A parallel Strength Pareto Multi-objective Evolutionary algorithm(PSPMEA)is *** is a parallel computing model designed for solving Pareto-based multi-objective optimization problems by using an evolutionary *** this procedure,both global parallelization and island parallel evolutionary algorithm models are *** subpopulation evolves separately with different crossover and mutation probability, but they exchange individuals in the elitist *** benchmark problems numerical experiment results demonstrate that the proposed method can rapidly converge to the Pareto optimal front and spread widely along the front.

关键词： parallel genetic algorithm evolutionary computation multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：