This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrel...This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.展开更多
Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index ...Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.展开更多
A high-level technology is revealed that can effectively convert any distributed system into a globally programmable machine capable of operating without central resources and self-recovering from indiscriminate damag...A high-level technology is revealed that can effectively convert any distributed system into a globally programmable machine capable of operating without central resources and self-recovering from indiscriminate damages. Integral mission scenarios in Distributed Scenario Language (DSL) can be injected from any point, runtime covering & grasping the whole system or its parts, setting operational infrastructures, and orienting local and global behavior in the way needed. Many operational scenarios can be simultaneously injected into this spatial machine from different points, cooperating or competing over the shared distributed knowledge as overlapping fields of solutions. Distributed DSL interpreter organization and benefits of using this technology for integrated air and missile defense are discussed along with programming examples in this and other fields.展开更多
A high-level control technology will be revealed that can dynamically establish overwhelming dominance over distributed networked systems with embedded electronic devices and any communications between them. It is bas...A high-level control technology will be revealed that can dynamically establish overwhelming dominance over distributed networked systems with embedded electronic devices and any communications between them. It is based on implanting of universal control modules (that may be concealed) into key system points which collectively interpret complex but compact mission scenarios in a special high-level Distributed Scenario language (DSL). Self-evolving and self-spreading in networks, matching them in a super-virus mode, DSL scenarios can analyze their structures and states and set up any behavior needed, including creation of benign or elimination of unwanted infrastructures. The scalable technology allows us to convert any distributed networked systems into a sort of integral spatial brain capable of analyzing and withstanding unpredictable situations in a variety of important domains.展开更多
To improve the evolutionary algorithm performance,especially in convergence speed and global optimization ability,a self-adaptive mechanism is designed both for the conventional genetic algorithm(CGA)and the quantum i...To improve the evolutionary algorithm performance,especially in convergence speed and global optimization ability,a self-adaptive mechanism is designed both for the conventional genetic algorithm(CGA)and the quantum inspired genetic algorithm(QIGA).For the self-adaptive mechanism,each individual was assigned with suitable evolutionary parameter according to its current evolutionary state.Therefore,each individual can evolve toward to the currently best solution.Moreover,to reduce the running time of the proposed self-adaptive mechanism-based QIGA(SAM-QIGA),a multi-universe parallel structure was employed in the paper.Simulation results show that the proposed SAM-QIGA have better performances both in convergence and global optimization ability.展开更多
The paper describes the use of invented,developed,and tested in different countries of the high-level spatial grasp model and technology capable of solving important problems in large social systems,which may be repre...The paper describes the use of invented,developed,and tested in different countries of the high-level spatial grasp model and technology capable of solving important problems in large social systems,which may be represented as dynamic,self-evolving and distributed social networks.The approach allows us to find important solutions on a holistic level by spatial navigation and parallel pattern matching of social networks with active self-propagating scenarios represented in a special recursive language.This approach effectively hides inside the distributed and networked language implementation traditional system management routines,often providing hundreds of times shorter and simpler high-level solution code.The paper highlights the demands to efficient simulation of social systems,briefs the technology used,and provides some programming examples for solutions of practical problems.展开更多
文摘This paper discusses design and comparison of Simulated Annealing Algorithm and Greedy Randomized Adaptive Search Procedure (GRASP) to minimize the makespan in scheduling n single operation independent jobs on m unrelated parallel machines. This problem of minimizing the makespan in single machine scheduling problem with uniform parallel machines is NP hard. Hence, heuristic development for such problem is highly inevitable. In this paper, two different Meta-heuristics to minimize the makespan of the assumed problem are designed and they are compared in terms of their solutions. In the first phase, the simulated annealing algorithm is presented and then GRASP (Greedy Randomized Adaptive Search procedure) is presented to minimize the makespan in the single machine scheduling problem with unrelated parallel machines. It is found that the simulated annealing algorithm performs better than GRASP.
基金Project(61273187)supported by the National Natural Science Foundation of ChinaProject(61321003)supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China
文摘Region partition(RP) is the key technique to the finite element parallel computing(FEPC),and its performance has a decisive influence on the entire process of analysis and computation.The performance evaluation index of RP method for the three-dimensional finite element model(FEM) has been given.By taking the electric field of aluminum reduction cell(ARC) as the research object,the performance of two classical RP methods,which are Al-NASRA and NGUYEN partition(ANP) algorithm and the multi-level partition(MLP) method,has been analyzed and compared.The comparison results indicate a sound performance of ANP algorithm,but to large-scale models,the computing time of ANP algorithm increases notably.This is because the ANP algorithm determines only one node based on the minimum weight and just adds the elements connected to the node into the sub-region during each iteration.To obtain the satisfied speed and the precision,an improved dynamic self-adaptive ANP(DSA-ANP) algorithm has been proposed.With consideration of model scale,complexity and sub-RP stage,the improved algorithm adaptively determines the number of nodes and selects those nodes with small enough weight,and then dynamically adds these connected elements.The proposed algorithm has been applied to the finite element analysis(FEA) of the electric field simulation of ARC.Compared with the traditional ANP algorithm,the computational efficiency of the proposed algorithm has been shortened approximately from 260 s to 13 s.This proves the superiority of the improved algorithm on computing time performance.
文摘A high-level technology is revealed that can effectively convert any distributed system into a globally programmable machine capable of operating without central resources and self-recovering from indiscriminate damages. Integral mission scenarios in Distributed Scenario Language (DSL) can be injected from any point, runtime covering & grasping the whole system or its parts, setting operational infrastructures, and orienting local and global behavior in the way needed. Many operational scenarios can be simultaneously injected into this spatial machine from different points, cooperating or competing over the shared distributed knowledge as overlapping fields of solutions. Distributed DSL interpreter organization and benefits of using this technology for integrated air and missile defense are discussed along with programming examples in this and other fields.
文摘A high-level control technology will be revealed that can dynamically establish overwhelming dominance over distributed networked systems with embedded electronic devices and any communications between them. It is based on implanting of universal control modules (that may be concealed) into key system points which collectively interpret complex but compact mission scenarios in a special high-level Distributed Scenario language (DSL). Self-evolving and self-spreading in networks, matching them in a super-virus mode, DSL scenarios can analyze their structures and states and set up any behavior needed, including creation of benign or elimination of unwanted infrastructures. The scalable technology allows us to convert any distributed networked systems into a sort of integral spatial brain capable of analyzing and withstanding unpredictable situations in a variety of important domains.
基金supported by the National Natural Science Foundation of China (61473179)the Natural Science Foundation of Shandong Province (ZR2016FM18 ZR2017LF004)+2 种基金the Project of Shandong Province Higher Education Science and Technology Program (J16LN20)the Youth Innovation Team Development Plan of Shandong Province Higher Enducation (2019KJN048)the International Cooperation Training Project of Shandong Province (2016)
文摘To improve the evolutionary algorithm performance,especially in convergence speed and global optimization ability,a self-adaptive mechanism is designed both for the conventional genetic algorithm(CGA)and the quantum inspired genetic algorithm(QIGA).For the self-adaptive mechanism,each individual was assigned with suitable evolutionary parameter according to its current evolutionary state.Therefore,each individual can evolve toward to the currently best solution.Moreover,to reduce the running time of the proposed self-adaptive mechanism-based QIGA(SAM-QIGA),a multi-universe parallel structure was employed in the paper.Simulation results show that the proposed SAM-QIGA have better performances both in convergence and global optimization ability.
文摘The paper describes the use of invented,developed,and tested in different countries of the high-level spatial grasp model and technology capable of solving important problems in large social systems,which may be represented as dynamic,self-evolving and distributed social networks.The approach allows us to find important solutions on a holistic level by spatial navigation and parallel pattern matching of social networks with active self-propagating scenarios represented in a special recursive language.This approach effectively hides inside the distributed and networked language implementation traditional system management routines,often providing hundreds of times shorter and simpler high-level solution code.The paper highlights the demands to efficient simulation of social systems,briefs the technology used,and provides some programming examples for solutions of practical problems.
