检索结果-南通市图书馆

Classification-based self-adaptive differential evolution and its application in multi-lateral multi-issue negotiation

在线全文

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2012年第4期6卷 442-461页

作者： Xiaojun BI Jing XIAO School of Information and Communication Engineering Harbin Engineering UniversityHarbin 150001China School of Information Engineering Liaoning Provincial College of CommunicationsShenyang 110122China

Multi-lateral multi-issue negotiations are the most complex realistic negotiation problems. Automated ap- proaches have proven particularly promising for complex ne- gotiations and previous research indicates evolutionary com- putation could be useful for such complex systems. To im- prove the efficiency of realistic multi-lateral multi-issue ne- gotiations and avoid the requirement of complete informa- tion about negotiators, a novel negotiation model based on art improved evolutionary algorithm p-ADE is proposed. The new model includes a new multi-agent negotiation protocol and strategy which utilize p-ADE to improve the negotia- tion efficiency by generating more acceptable solutions with stronger suitability for all the participants. Where p-ADE is improved based on the well-known differential evolution （DE）, in which a new classification-based mutation strategy DE/rand-to-best/pbest as well as a dynamic self-adaptive pa- rameter setting strategy are proposed. Experimental results confirm the superiority of p-ADE over several state-of-the-art evolutionary optimizers. In addition, the p-ADE based multi- agent negotiation model shows good performance in solving realistic multi-lateral multi-issue negotiations.

关键词： differential evolution global optimum e-commerce agent multi-lateral multi-issue negotiation

Assembly Line Balancing Based on Double Chromosome Genetic Algorithm

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Transactions of Nanjing University of Aeronautics and Astronautics 2014年第6期31卷 622-628页

作者：刘俨后左敦稳张丹 College of Mechanical and Electrical Engineering Nanjing University of Aeronautics and Astronautics

Aiming at assembly line balancing problem,a double chromosome genetic algorithm(DCGA)is proposed to avoid trapping in local optimum,which is a disadvantage of standard genetic algorithm(SGA).In this algorithm,there are two chromosomes of each individual,and the better one,regarded as dominant chromosome,determines the *** chromosome keeps excellent gene segments to speed up the convergence,and recessive chromosome maintains population diversity to get better global search ability to avoid local optimal *** the amounts of chromosomes are equal,the population size of DCGA is half that of SGA,which significantly reduces evolutionary ***,the effectiveness is verified by experiments.

关键词： double chromosome genetic algorithm assembly line balancing mathematical model global optimum

Obtain the optimal of logistics delivery network with annealing algorithm

在线全文

学校读者我要写书评

暂无评论

Engineering Sciences 2013年第6期11卷 44-47页

作者： Duan Jingmin Chang Yuejun Li Zanxiang Cui Jianming Department of Architectural Engineering Sanmenxia Polytechnic Department of Bridge Engineering Southwest Jiaotong University Henan Construction Engineering Department Building School of Information Engineering Chang'an University

Simulated annealing(SA) algorithm is a heuristic algorithm,proposed one approximation algorithm of solving optimization combinatorial problems inspired by objects in the annealing process of heating crunch. The algorithm is superior to the traditional greedy algorithm,which avoids falling into local optimum and reaches global optimum. There are often some problems to find the shortest path,etc in the logistics and distribution network, and we need optimization for logistics and distribution path in order to achieve the shortest,best,most economical,and so on. The paper uses an example of SA algorithm validation to verify it,and the method is proved to be feasible.

关键词： SA algorithm global optimum logistics and distribution network

Optimal Design Methods Based on Creative Simplification and Clarification of Conflicting and Cooperative Relationships

在线全文

学校读者我要写书评

暂无评论

Optimal Design Methods Based on Creative Simplification and ...

A new hybrid genetic algorithm for optimization problems based on trust region techniques

The Fourth World Congress of Structural and Multidisciplinary Optimization

作者： Yoshimura M Satou T Department of Precision Engineering Graduate School of Engineering Kyoto University Kyoto JAPAN

This paper proposes a method for obtaining superior design solutions by first simplifying the overall design problem and design elements, and then reconstructing a fresh design system based on the simplified model. This process of simplification followed by reconstruction not only makes design optimization easier, but also increases the possibilities for discovering improved designs. After simplifying the problem, conflicting and cooperative relationships are clarified, and then the core relationships among the design characteristics are identified. Optimization methods are carried out on the reconstructed formulation, paying particular attention to the newly identified core relationships. An optimal design solution is selected from a set of obtained design alternatives that consider both the individual parts of the product as well as the design as a whole.

关键词： optimum Design global optimum global Sensitivities Simplification Conflicting Relationships

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

A new hybrid genetic algorithm for optimization problems bas...

The Modified Hybrid Adaptive Genetic Algorithm for 0-1 Knapsack Problem

The Sixth International Conference on Information and Management Sciences

作者： Ou yigui Department of Applied Mathematics Hainan University Haikou 570228 P.R.China

＜正＞Based on the trust region techniques and the conventional genetic approaches,this paper proposes a new hybrid genetic algorithm of global optimum for optimization *** examples demonstrate the efficiency and the ... 详细信息

关键词： hybrid algorithm genetic algorithm trust region methods global optimum

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

The Modified Hybrid Adaptive Genetic Algorithm for 0-1 Knaps...

RESEARCH ON OPTIMAL OPERATION OF WATER PRODUCING SYSTEM 

第24届中国控制与决策会议

作者： Yanqin Ma 1 1. School of Information and Engineering, Huanghe Science Technology College,Zhengzhou,450063

The paper solves the 0-1 knapsack problem with the modified adaptive genetic transform algorithm which combined with greedy transform algorithm. By means of mixing adaptive crossover and mutation with diversity-guided mutation and modifying adaptive crossover stratagies,an adaptive genetic algorithm with diversity-guided mutation was developed and repaired the infeasible solution with greedy transform *** algorithm will converge to the global optimum and do not lead to premature *** results show that the new algorithm has faster convergent speed,higher robustness and more reliable stability,and it is very effective for 0-1 knapsack problem.

关键词： Adaptive Genetic Algorithm Diversity-guided Mutation global optimum Greedy Transform Algo- rithm Premature Convergence

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Transactions of Tianjin University 1999年第2期5卷 113-116页

作者：张宏伟镡新陈春芳天津大学建筑工程学院

Basing on a viewpoint of all sided water producing system,a comprehensive analysis of the operation status and the relationship between each working unit in water producing system,including coagulation,sedimentation and filtration *** *** investigating the influence of backwashing consumption,the amount of sludge ejected from sedimentation tank and coagulant ratio upon the cost,the cost effective function of the system was ***,the solution was found out and the corresponding computer program was *** applied with real world data,it proved that this method significantly reduced the water producing cost.

关键词： water producing system optimal operation optimal coagulant dosage global optimum