1,957 research outputs found

    Recent Advances in Graph Partitioning

    Full text link
    We survey recent trends in practical algorithms for balanced graph partitioning together with applications and future research directions

    Optimization of a Quantum Cascade Laser Operating in the Terahertz Frequency Range Using a Multiobjective Evolutionary Algorithm

    Get PDF
    A quantum cascade (QC) laser is a specific type of semiconductor laser that operates through principles of quantum mechanics. In less than a decade QC lasers are already able to outperform previously designed double heterostructure semiconductor lasers. Because there is a genuine lack of compact and coherent devices which can operate in the far-infrared region the motivation exists for designing a terahertz QC laser. A device operating at this frequency is expected to be more efficient and cost effective than currently existing devices. It has potential applications in the fields of spectroscopy, astronomy, medicine and free-space communication as well as applications to near-space radar and chemical/biological detection. The overarching goal of this research was to find QC laser parameter combinations which can be used to fabricate viable structures. To ensure operation in the THz region the device must conform to the extremely small energy level spacing range from ~10-15 meV. The time and expense of the design and production process is prohibitive, so an alternative to fabrication was necessary. To accomplish this goal a model of a QC laser, developed at Worchester Polytechnic Institute with sponsorship from the Air Force Research Laboratory Sensors Directorate, and the General Multiobjective Parallel Genetic Algorithm (GenMOP), developed at the Air Force Institute of Technology, were integrated to form a computer simulation which stochastically searches for feasible solutions

    Power transmission planning using heuristic optimisation techniques: Deterministic crowding genetic algorithms and Ant colony search methods

    Get PDF
    This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The goal of transmission planning in electric power systems is a robust network which is economical, reliable, and in harmony with its environment taking into account the inherent uncertainties. For reasons of practicality, transmission planners have normally taken an incremental approach and tended to evaluate a relatively small number of expansion alternatives over a relatively short time horizon. In this thesis, two new planning methodologies namely the Deterministic Crowding Genetic Algorithm and the Ant Colony System are applied to solve the long term transmission planning problem. Both optimisation techniques consider a 'green field' approach, and are not constrained by the existing network design. They both identify the optimal transmission network over an extended time horizon based only on the expected pattern of electricity demand and generation sources. Two computer codes have been developed. An initial comparative investigation of the application of Ant Colony Optimisation and a Genetic Algorithm to an artificial test problem has been undertaken. It was found that both approaches were comparable for the artificial test problem.EPRSC and National Grid Company pl

    Recent trends of the most used metaheuristic techniques for distribution network reconfiguration

    Get PDF
    Distribution network reconfiguration (DNR) continues to be a good option to reduce technical losses in a distribution power grid. However, this non-linear combinatorial problem is not easy to assess by exact methods when solving for large distribution networks, which requires large computational times. For solving this type of problem, some researchers prefer to use metaheuristic techniques due to convergence speed, near-optimal solutions, and simple programming. Some literature reviews specialize in topics concerning the optimization of power network reconfiguration and try to cover most techniques. Nevertheless, this does not allow detailing properly the use of each technique, which is important to identify the trend. The contributions of this paper are three-fold. First, it presents the objective functions and constraints used in DNR with the most used metaheuristics. Second, it reviews the most important techniques such as particle swarm optimization (PSO), genetic algorithm (GA), simulated annealing (SA), ant colony optimization (ACO), immune algorithms (IA), and tabu search (TS). Finally, this paper presents the trend of each technique from 2011 to 2016. This paper will be useful for researchers interested in knowing the advances of recent approaches in these metaheuristics applied to DNR in order to continue developing new best algorithms and improving solutions for the topi

    OPTIMAL DISTRIBUTION FEEDER RECONFIGURATION WITH DISTRIBUTED GENERATION USING INTELLIGENT TECHNIQUES

    Get PDF
    Feeder reconfiguration is performed by changing the open/close status of two types of switches: normally open tie switches and normally closed sectionalizing switches. A whole feeder or part of a feeder may be served from another feeder by closing a tie switch linking the two while an appropriate sectionalizing switch must be opened to maintain the radial structure of the system. Feeder reconfiguration is mainly aiming to reduce the system overall power losses and improve voltage profile. In this dissertation, several approaches have been proposed to reconfigure the radial distribution networks including the potential impact of integrating Distributed Energy Resources (DER) into the grid. These approaches provide a Fast-Genetic Algorithm “FGA” in which the size and convergence speed is improved compared to the conventional genetic algorithm. The size of the population matrix is also smaller because of the simple way of constructing the meshed network. Additionally, FGA deals with integer variable instead of a binary one, which makes FGA a unique method. The number of the mesh/loop is based on the number of tie switches in a particular network. The validity of the proposed FGA is investigated by comparing the obtained results with the one obtained from the most recent approaches. The second the approach is the implementation of the Differential Evolution (DE) algorithm. DE is a population-based method using three operators including crossover, mutation, and selection. It differs from GA in that genetic algorithms rely on crossover while DE relies on mutation. Mutation is based on the differences between randomly sampled pairs of solutions in the population. DE has three advantages: the ability to find the global optimal result regardless of the initial values, fast convergence, and requirement of a few control parameters. DE is a well-known and straightforward population-based probabilistic approach for comprehensive optimization. In distribution systems, if a utility company has the right to control the location and size of distributed generations, then the location and size of DGs may be determined based on some optimization methods. This research provides a promising approach to finding the optimal size and location of the planned DER units using the proposed DE algorithm. DGs location is obtained using the sensitivity of power losses with respect to real power injection at each bus. Then the most sensitive bus is selected for installing the DG unit. Because the integration of the DG adds positive real power injections, the optimal location is the one with the most negative sensitivity in order to get the largest power loss reduction. Finally, after the location is specified, the proposed Differential Evolution Algorithm (DEA) is used to obtain the optimal size of the DG unit. Only the feasible solutions that satisfy all the constraints are considered. The objective of installing DG units to the distribution network is to reduce the system losses and enhance the network voltage profile. Nowadays, these renewable DGs are required to equip with reactive power devices (such as static VAR compensators, capacitor banks, etc.), to provide reactive power as well as to control the voltage at their terminal bus. DGs have various technical benefits such as voltage profile improvement, relief in feeder loading, power loss minimization, stability improvement, and voltage deviation mitigation. The distributed generation may not achieve its full potential of benefits if placed at any random location in the system. It is necessary to investigate and determine the optimum location and size of the DG. Most distribution networks are radial in nature with limited short-circuit capacity. Therefore, there is a limit to which power can be injected into the distribution network without compromising the power quality and the system stability. This research is aiming to investigate this by applying DG technologies to the grid and keeping the system voltage within a defined boundary [0.95 - 1.05 p.u]. The requirements specified in IEEE Standard 1547 are considered. This research considers four objectives related to minimization of the system power loss, minimization of the deviations of the nodes voltage, minimization of branch current constraint violation, and minimization of feeder’s currents imbalance. The research formulates the problem as a multi-objective problem. The effectiveness of the proposed methods is demonstrated on different revised IEEE test systems including 16 and 33-bus radial distribution system

    The hardware implementation of an artificial neural network using stochastic pulse rate encoding principles

    Get PDF
    In this thesis the development of a hardware artificial neuron device and artificial neural network using stochastic pulse rate encoding principles is considered. After a review of neural network architectures and algorithmic approaches suitable for hardware implementation, a critical review of hardware techniques which have been considered in analogue and digital systems is presented. New results are presented demonstrating the potential of two learning schemes which adapt by the use of a single reinforcement signal. The techniques for computation using stochastic pulse rate encoding are presented and extended with new novel circuits relevant to the hardware implementation of an artificial neural network. The generation of random numbers is the key to the encoding of data into the stochastic pulse rate domain. The formation of random numbers and multiple random bit sequences from a single PRBS generator have been investigated. Two techniques, Simulated Annealing and Genetic Algorithms, have been applied successfully to the problem of optimising the configuration of a PRBS random number generator for the formation of multiple random bit sequences and hence random numbers. A complete hardware design for an artificial neuron using stochastic pulse rate encoded signals has been described, designed, simulated, fabricated and tested before configuration of the device into a network to perform simple test problems. The implementation has shown that the processing elements of the artificial neuron are small and simple, but that there can be a significant overhead for the encoding of information into the stochastic pulse rate domain. The stochastic artificial neuron has the capability of on-line weight adaption. The implementation of reinforcement schemes using the stochastic neuron as a basic element are discussed

    Scalable and deterministic timing-driven parallel placement for FPGAs

    Full text link

    Increased understanding of hybrid vehicle design through modeling, simulation, and optimization

    Get PDF
    2010 Fall.Includes bibliographical references.Vehicle design is constantly changing and improving due to the technologically driven nature of the automotive industry, particularly in the hybridization and electrification of vehicle drive trains. Through enhanced design vehicle level design constraints can result in the fulfillment of system level design objectives. These constraints may include improved vehicle fuel economy, all electric range, and component costs which can affect system objectives of increased national energy independence, reduced vehicle and societal emissions, and reduced life-cycle costs. In parallel, as computational power increases the ability to accurately represent systems through analytical models improves. This allows for systems engineering which is commonly quicker and less resource consuming than physical testing. As a systems engineering technique, optimization has shown to obtain superior solutions systematically, in opposition to trial-and-error designs of the past. Through the combination of vehicle models, computer numerical simulation, and optimization, overall vehicle systems design can greatly improve. This study defines a connection between the system level objectives for advanced vehicle design and the component- and vehicle-level design process using a multi-level design and simulation modeling environment. The methods and information pathways for vehicle system models are presented and applied to dynamic simulation. Differing vehicle architecture simulations are subjected to a selection of proven optimization algorithms and design objectives such that the performance of the algorithms and vehicle-specific design information and sensitivity is obtained. The necessity of global search optimization and aggregate objective functions are confirmed through exploration of the complex hybrid vehicle design space. Whether the chosen design space is limited to available components or expanded to academic areas, studies can be performed for numerous design objectives and constraints. The combination of design criteria into quantifiable objective functions allows for direct optimization comparison based on any number of design goals. Integrating well-defined objective functions into high performing global optimization search methods provides increased probability of obtaining solutions which represent the most germane designs. Additionally, key interactions between different components in the vehicular system can easily be identified such that ideal directions for gain relative to minimal cost can be achieved. Often times vehicular design processes require lower order representations or consist of time and resource consuming iterations. Through the formulation presented in this study, more details, objectives, and methods become available for comparing advanced vehicles across architectures. The main techniques used for setting up the models, simulations and optimizations are discussed along with results of test runs based on chosen vehicle objectives. Utility for the vehicular design efforts are presented through comparisons of available simulation and future areas of research are suggested
    • …
    corecore