Construction project management consists of planning, scheduling, and controlling. Planning is important because it's set down the target of project to achieve successfulness. Successfulness of a project consists ...
详细信息
Two-dimensional large-signal and noise simulations are used to study the terahertz (THz) performance of Gallium Nitride (GaN) avalanche transit time source (ATT) source. A comprehensive model of parasitic series resis...
详细信息
Manufacturing industries engaged in making of instant noodles in Medan city have problems in production planning. The process studied is the manufacture of GCGEP, GCst and G-1000GSP products. The constraints faced by ...
详细信息
Dynamic economic dispatch with optimal transmission switching is proposed for wind integrated power systems to improve wind power consumption and reduce system operating costs. Firstly, an optimal model for wind power...
详细信息
ISBN:
(数字)9781728196596
ISBN:
(纸本)9781728196602
Dynamic economic dispatch with optimal transmission switching is proposed for wind integrated power systems to improve wind power consumption and reduce system operating costs. Firstly, an optimal model for wind power systems is introduced based on the DC power flow equation. Furthermore, in order to solve the mixed integer programming problem for large-scale power systems, a pre-screening descending dimension algorithm is proposed, which pre-screens the total transmission lines to establish the candidate breakable line set, in where the selected lines can reduce the generation and wind curtailment cost. Meanwhile, a solution strategy for the dynamic economic dispatch model is proposed. The original integrated model is solved in two stages: line pre-screening and optimal dispatch. And big-M reduction is used to further improve solution efficiency. Consequently, the effectiveness and feasibility of the proposed model and acceleration algorithm are proved in the improved IEEE24 and IEEE118 system, respectively.
The current state of the art in subgraph isomorphism solving involves using degree as a value-ordering heuristic to direct backtracking search. Such a search makes a heavy commitment to the first branching choice, whi...
详细信息
ISBN:
(数字)9783030192129
ISBN:
(纸本)9783030192129;9783030192112
The current state of the art in subgraph isomorphism solving involves using degree as a value-ordering heuristic to direct backtracking search. Such a search makes a heavy commitment to the first branching choice, which is often incorrect. To mitigate this, we introduce and evaluate a new approach, which we call "solution-biased search". By combining a slightly-random value-ordering heuristic, rapid restarts, and nogood recording, we design an algorithm which instead uses degree to direct the proportion of search effort spent in different subproblems. This increases performance by two orders of magnitude on satisfiable instances, whilst not affecting performance on unsatisfiable instances. This algorithm can also be parallelised in a very simple but effective way: across both satisfiable and unsatisfiable instances, we get a further speedup of over thirty from thirty-six cores, and over one hundred from ten distributed-memory hosts. Finally, we show that solution-biased search is also suitable for optimisation problems, by using it to improve two maximum common induced subgraph algorithms.
The rapid development of technology has made the game as one of the popular entertainment media ranging from children to adults. Endless Runner games can be interpreted into two things, namely player characters that c...
详细信息
Multi-objective artificial bee colony (MOABC) is a meta-heuristic which belongs to the field of swarm intelligence techniques. The basic idea is to imitate the intelligent foraging behavior of honeybee swarms in order...
详细信息
ISBN:
(数字)9781728149790
ISBN:
(纸本)9781728149806
Multi-objective artificial bee colony (MOABC) is a meta-heuristic which belongs to the field of swarm intelligence techniques. The basic idea is to imitate the intelligent foraging behavior of honeybee swarms in order to solve multi-objective optimization problems. In this study, we present a novel version of the MOABC algorithm whose performances are evaluated through a benchmark of five multi-objective test functions. The simulation based technique is used to generate the non-dominated set of points of the Pareto fronts. A Comparison with the Multi-Objective Particle Swarm Optimization (MOPSO) algorithm is shown. The Generational Distance (GD) and Spacing (Sp) are used as performance metrics.
This paper presents a study and an adaptation of a new nature-inspired multi-objective metaheuristic algorithm, entitled the multi-objective Dragonfly Algorithm (MODA), to the optimal design of analog circuits. First,...
详细信息
ISBN:
(数字)9781728149790
ISBN:
(纸本)9781728149806
This paper presents a study and an adaptation of a new nature-inspired multi-objective metaheuristic algorithm, entitled the multi-objective Dragonfly Algorithm (MODA), to the optimal design of analog circuits. First, the MODA algorithm is tested, validated and compared to another metaheuristic algorithm thru test functions without/with constraints. Performance metrics are used to show the convergence accuracy to the Pareto solutions with highly uniform distribution. In the second part, the algorithm is used to optimize the performance of an analog circuit, namely a second-generation current conveyor. Comparison between MODA performances and those obtained using the MOPSO metaheuristic is provided to show potentialities of the proposed algorithm. Spice Simulations demonstrate the merits of the MODA algorithm in analog circuit design sizing.
In this work, we address the hard clustering problem. We present a new clustering algorithm based on evolutionary computation searching a best partition with respect to a given quality measure. We present 32 partition...
详细信息
ISBN:
(纸本)9783030336073;9783030336066
In this work, we address the hard clustering problem. We present a new clustering algorithm based on evolutionary computation searching a best partition with respect to a given quality measure. We present 32 partition transformation that are used as mutation operators. The algorithm is a (1 + 1) evolutionary strategy that selects a random mutation on each step from a subset of preselected mutation operators. Such selection is performed with a classifier trained to predict usefulness of each mutation for a given dataset. Comparison with state-of-the-art approach for automated clustering algorithm and hyperparameter selection shows the superiority of the proposed algorithm.
Raw Materials are one of the important things in manufacture. The availability of these items is very important for the production process to take place. The researcher will research an electricity company. The electr...
详细信息
暂无评论