Loading...
Search for: heuristic-methods
0.013 seconds
Total 150 records

    Optimal distribution transformer sizing in a harmonic involved load environment via dynamic programming technique

    , Article Energy ; Volume 120 , 2017 , Pages 92-105 ; 03605442 (ISSN) Hajipour, E ; Mohiti, M ; Farzin, N ; Vakilian, M ; Sharif University of Technology
    Abstract
    Installation of a significant number of distributed generators (DGs), besides the application of non-sinusoidal loads such as; Plug-in Hybrid Electric Vehicles (PHEVs), in the emerging smart distribution networks and the industrial plants have posed a major challenge to the existing methods of optimal transformer sizing (OTS). The harmonic currents generated in these new environments not only substantially increase the transformer load losses, but also cause abnormal winding temperature rise and hence transformer excessive loss of life. Therefore, the harmonic contents of the loads currents should be accounted in choosing the appropriate size of distribution transformers. To address this... 

    Multidisciplinary design of a guided flying vehicle using simplex nondominated sorting genetic algorithm II

    , Article Structural and Multidisciplinary Optimization ; Volume 57, Issue 2 , February , 2018 , Pages 705-720 ; 1615147X (ISSN) Zandavi, S. M ; Pourtakdoust, S. H ; Sharif University of Technology
    Springer Verlag  2018
    Abstract
    This paper presents design of a typical Guided Flying Vehicle (GFV) using the multidisciplinary design optimization (MDO). The main objectives of this multi-disciplinary design are maximizing the payload’s weight as well as minimizing the miss distance. The main disciplines considered for this design include aerodynamics, dynamic, guidance, control, structure, weight and balance. This design of GFV is applied to three and six Degree of Freedom (DOF) to show comparison of simulation results. The hybrid scheme of optimization algorithm is based on Nelder-Mead Simplex optimization algorithm and Nondominated Sorting Genetic Algorithm II (NSGA II), called Simplex-NSGA II. This scheme is... 

    Energy-efficient fast configuration of flexible transponders and grooming switches in OFDM-based elastic optical networks

    , Article Journal of Optical Communications and Networking ; Volume 10, Issue 2 , 2018 , Pages 90-103 ; 19430620 (ISSN) Hadi, M ; Pakravan, M. R ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2018
    Abstract
    We investigate the problem of energy-efficient resource allocation constrained to quality of service and physical requirements in orthogonal frequency division multiplexing (OFDM)-based elastic optical networks and propose a fast two-stage algorithm to solve it. The first stage of the proposed algorithm deals with routing, traffic grooming, and traffic ordering and mainly aims at minimization of the number of deployed optical amplifiers and transponders. We provide an integer linear program for routing and traffic grooming and propose a heuristic procedure, which yields its near-optimum solution in a shorter runtime. In the second stage, we optimize transponder parameters to minimize total... 

    An efficient algorithm for bandwidth-delay constrained least cost multicast routing

    , Article 2008 IEEE Canadian Conference on Electrical and Computer Engineering, CCECE 2008, Niagara Falls, ON, 4 May 2008 through 7 May 2008 ; 2008 , Pages 1641-1645 ; 08407789 (ISSN) ; 9781424416431 (ISBN) Forsati, R ; Mahdavi, M ; Torghy Haghighat, A ; Ghariniyat, A ; Sharif University of Technology
    2008
    Abstract
    The advent of various real-time multimedia applications in high-speed networks creates a need for quality of service (QoS) based multicast routing. Two important QoS constraints are the bandwidth constraint and the end-to-end delay constraint. The QoS based multicast routing problem is a known NP-complete problem that depends on (1) bounded end-to-end delay and link bandwidth along the paths from the source to each destination, and (2) minimum cost of the multicast tree. In this paper we describe a new representation, called node parent index (NPI) representation, for representing trees and describe harmony operations accord to this representation. The presented algorithm is based on the... 

    A heuristic method for finding the optimal number of clusters with application In medical data

    , Article 30th Annual International Conference of the IEEE Engineering in Medicine and Biology Society, EMBS'08, Vancouver, BC, 20 August 2008 through 25 August 2008 ; 2008 , Pages 4684-4687 ; 9781424418152 (ISBN) Bayati, H ; Davoudi, H ; Fatemizadeh, E ; Sharif University of Technology
    IEEE Computer Society  2008
    Abstract
    In this paper, a heuristic method for determining the optimal number of clusters is proposed. Four clustering algorithms, namely K-means, Growing Neural Gas, Simulated Annealing based technique, and Fuzzy C-means in conjunction with three well known cluster validity indices, namely Davies-Bouldin index, Calinski-Harabasz index, Maulik-Bandyopadhyay index, in addition to the proposed index are used. Our simulations evaluate capability of mentioned indices in some artificial and medical datasets. © 2008 IEEE  

    Finding aggregation tree with genetic algorithm for network correlated data gathering

    , Article 2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008, Cap Esterel, 25 August 2008 through 31 August 2008 ; 2008 , Pages 429-434 ; 9780769533308 (ISBN) Habibi Masouleh, H ; Tahaee, S. A ; Jahangir, A. H ; Sharif University of Technology
    2008
    Abstract
    The critical issue in designing correlated data networks like Wireless Sensor Networks is to minimize the total cost of data transmission in the network, and decrease the amount of data flow. The problem of finding optimal aggregation tree for correlated data gathering in single sink network is considered as an NP-Complete problem and hence heuristic methods are usually applied to solve it[1]. In this paper, we apply genetic algorithm (GA) to solve the problem. In our method, we improve the performance of genetic search by selecting proper initial population. This initial population is determined in two ways, by using Prime's algorithm, and shortest path tree. The main issue is to regard... 

    Solving haplotype reconstruction problem in MEC model with hybrid information fusion

    , Article EMS 2008, European Modelling Symposium, 2nd UKSim European Symposium on Computer Modelling and Simulation, Liverpool, 8 September 2008 through 10 September 2008 ; 2008 , Pages 214-218 ; 9780769533254 (ISBN) Asgarian, E ; Moeinzadeh, M. H ; Habibi, J ; Sharifian-R, S ; Rasooli-V, A ; Najafi-A, A ; Sharif University of Technology
    2008
    Abstract
    Single Nucleotide Polymorphisms (SNPs), a single DNA base varying from one individual to another, are believed to be the most frequent form responsible for genetic differences. Genotype is the conflated information of a pair of haplotypes on homologous chromosomes. Although haplotypes have more information for disease associating than individual SNPs and genotype, it is substantially more difficult to determine haplotypes through experiments. Hence, computational methods which can reduce the cost of determining haplotypes become attractive alternatives. MEC, as a standard model for haplotype reconstruction, is fed by fragments as input to infer the best pair of haplotypes with minimum error... 

    Efficient genetic based topological mapping using analytical models for on-chip networks

    , Article Journal of Computer and System Sciences ; Volume 79, Issue 4 , 2013 , Pages 492-513 ; 00220000 (ISSN) Arjomand, M ; Amiri, S. H ; Sarbazi Azad, H ; Sharif University of Technology
    2013
    Abstract
    Network-on-Chips are now the popular communication medium to support inter-IP communications in complex on-chip systems with tens to hundreds IP cores. Higher scalability (compared to the traditional shared bus and point-to-point interconnects), throughput, and reliability are among the most important advantages of NoCs. Moreover, NoCs can well match current CAD methodologies mainly relying on modular and reusable structures with regularity of structural pattern. However, since NoCs are resource-limited, determining how to distribute application load over limited on-chip resources (e.g. switches, buffers, virtual channels, and wires) in order to improve the metrics of interest and satisfy... 

    Development of a method for analysis of Iranian damask rose oil: combination of gas chromatography-mass spectrometry with Chemometric techniques

    , Article Analytica Chimica Acta ; Volume 623, Issue 1 , 8 August , 2008 , Pages 11-21 ; 00032670 (ISSN) Jalali Heravi, M ; Parastar, H ; Sereshti, H ; Sharif University of Technology
    2008
    Abstract
    Gas chromatography-mass spectrometry (GC-MS) combined with Chemometric resolution techniques were proposed as a method for the analysis of volatile components of Iranian damask rose oil. The essential oil of damask rose was extracted using hydrodistillation method and analyzed with GC-MS in optimized conditions. A total of 70 components were identified using similarity searches between mass spectra and MS database. This number was extended to 95 components with concentrations higher than 0.01% accounting for 94.75% of the total relative content using Chemometric techniques. For the first time in this work, an approach based upon subspace comparison is used for determination of the chemical... 

    Towards obtaining more information from gas chromatography-mass spectrometric data of essential oils: An overview of mean field independent component analysis

    , Article Journal of Chromatography A ; Volume 1217, Issue 29 , 2010 , Pages 4850-4861 ; 00219673 (ISSN) Jalali Heravi, M ; Parastar, H ; Sereshti, H ; Sharif University of Technology
    2010
    Abstract
    Mean field independent component analysis (MF-ICA) along with other chemometric techniques was proposed for obtaining more information from multi-component gas chromatographic-mass spectrometric (GC-MS) signals of essential oils (mandarin and lemon as examples). Using these techniques, some fundamental problems during the GC-MS analysis of essential oils such as varying baseline, presence of different types of noise and co-elution have been solved. The parameters affecting MF-ICA algorithm were screened using a 25 factorial design. The optimum conditions for MF-ICA algorithm were followed by deconvolution of complex GC-MS peak clusters. The number of independent components (ICs) (chemical...