Loading...
Search for: harmony-search-algorithms
0.006 seconds
Total 25 records

    Hybrid Approach for Spectrum Allocation in Cognitive Radio Networks

    , M.Sc. Thesis Sharif University of Technology Khosravi, Ehsan (Author) ; Hemmatyar, Ali Mohammad Afshin (Supervisor) ; Movaghar, Ali (Co-Advisor)
    Abstract
    In recent years, demand for frequency spectrum has increased rapidly. Cognitive radio technology, as a tool for better access to the frequency spectrum, opportunistically uses the bandwidth of a licensed frequency band to solve the problem of congestion in unlicensed frequency bands. The spectrum allocation is one of the first steps in the implementation of cognitive radio networks. Many studies have been done to solve the problem of optimal spectrum allocation in such networks. One of the most commonly used methods to solve the optimization problem is using meta-heuristic algorithms. Harmony search and artificial bee colony algorithms are two of the most successful methods for this purpose.... 

    Data Stream Classification by Considering Concept Drift Using Evolutionary Algorithms

    , M.Sc. Thesis Sharif University of Technology Karimi, Zohre (Author) ; Abolhassani, Hassan (Supervisor)
    Abstract
    Today many applications produce data stream that grow continuously over time. Classification is an important task in mining this data. One of the major challenges in classification of data streams is that the underlying concept of data may change over time; this needs updating the classification model. Many of traditional classification algorithms are adapted for classifying data streams. Evolutionary algorithms are stochastic methods that have been successfully applied to a wide range of optimization problems. Harmony search is a new evolutionary algorithm that convergence to global optimum and can be applied to discrete and continuous data. The evolutionary nature of classifying data... 

    Approximation Approaches for Ontology Alignment

    , M.Sc. Thesis Sharif University of Technology Ghasempour, Rouhollah (Author) ; Abolhassani, Hassan (Supervisor)
    Abstract
    Ontology alignment is a process for selection of a good mapping between entities of two (or more) ontologies. It can be viewed as a two phase process of: 1) Find the similarity of each pair of entities from two ontologies, and 2) Extraction of an optimal or near optimal mapping. Many researches had been down in the first phase, but researches in the second phase are little. Mapping extraction approaches applied in ontology alignment use similarity matrix to extract mapping, and ontologies have not any role in mapping extraction phase. One of the most important components in ontology is its structure which can help us in alignment extraction.
    In this thesis, an approach was proposed that... 

    Usage-based Nonlinear Pricing on Traffic Zones

    , M.Sc. Thesis Sharif University of Technology Mousavi Chashmi, Kianoush (Author) ; Zokaei Ashtiani, Hedayat (Supervisor)
    Abstract
    Nowadays, the necessity of management tools for controlling the ever increasing congestions in transportation networks has been increased. Pricing is one of these tools for mitigating congestions in transportation networks. In this regard, different pricing models have been developed for transportation networks. By considering the advancement in technologies and possibility of recording the vehicles’ traveled distance in the tolling areas, the amount of toll each user pays could be a nonlinear function of the distance traveled inside tolling areas. As a result, the generalized travel cost of each path may not be link-wise additive; therefore, the resulting shortest path problem cannot be... 

    Optimization of Well Placement and Number of Wells in one of Iranian oil reservoirs using Streamline Simulation

    , M.Sc. Thesis Sharif University of Technology Afshari, Saeed (Author) ; Pishvaie, Mahmoud Reza (Supervisor) ; Amin Shahidy, Babak (Supervisor)
    Abstract
    Determining the optimized number and best locations for new wells is a challenging problem due to the nonlinearly correlation and uncertainty associated with engineering, geological and economical variables affecting reservoir performance. The proposed location and configuration for new producers and injectors is usually nontrivial because of the complexity of the fluid flow in highly heterogeneous reservoirs. It depends on reservoir and fluid properties, well and surface equipment specifications and economic criteria. Various approaches have been proposed for this problem. Among those, direct optimization using the numerical simulator as the evaluation function is the most common... 

    Designing an Automated and Smart Electric Power Distribution System

    , M.Sc. Thesis Sharif University of Technology Ameli, Amir (Author) ; Vakilian, Mehdi (Supervisor)
    Abstract
    Feeder reconfiguration is one of the most prominent tasks for loss reduction, reliability improvement and also congestion alleviation in distribution networks. Besides improving abovementioned operational issues, during a long period of time, proper switching in appropriate times can causes a lot of economic savings. Furthermore, it can be intensified when capacitors are implemented and controlled in the network. To reach this purpose, most of the previous literature focuses merely on the power grid reconfiguration. Few of these researches have considered this problem as a dynamic one and studied that in a period of time, e.g. one day, considering fixed level of loads despite the others that... 

    Optimal Locating and Sizing of Distributed Resources for Transmission Congestion Managemet

    , M.Sc. Thesis Sharif University of Technology Afkousi-Paqaleh, Mohammad (Author) ; Abbaspour-Tehrani Fard, Ali (Supervisor) ; Rashidinejad, Masoud (Supervisor)
    Abstract
    This thesis presents a variety of methods have been proposed for optimal locating and sizing of Distributed Resource (DR) in restructured power system to reduce congestion and enhance security. Initially three different methodologies, based upon LMP and congestion rent, are presented that form priority list of candidate buses to reduce solution space. For taking into account security, The N−1 contingency criterion is performed and then a priority list of the worst contingencies from congestion rent point of view is organized. Based upon both normal condition and selected contingencies of the network a priority list of buses for optimal placement and for each level of power output of DR is... 

    Study and Proposal for an Improved Method of Semi-Supervised Clustering

    , M.Sc. Thesis Sharif University of Technology Abdollahi Alibeik, Mohammad (Author) ; Mahdavi Amiri, Nezameddin (Supervisor) ; Abolhassani, Hassan (Supervisor)
    Abstract
    Nowadays, clustering is one of the most common data mining tasks used for data categorization upon their similarities and analysis of these data groups in both industry and academia is of interest. Clustering does not need any supervision. The theme of this thesis is using some prior knowledge to improve clustering algorithms. The prior knowledge is in the form of some constraints determined by supervision to allowing preventing some combination data to be in one cluster or allocate some data in the same cluster. Here, prior knowledge in the form of constraints is used to modify a heuristic optimization algorithm (harmony search) and a novel "semi-supervised harmony clustering" is proposed.... 

    Resource Allocation in Multi-project Scheduling with Resource Transfer Time and Cost

    , M.Sc. Thesis Sharif University of Technology Panahi, Yousef (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    The project scheduling problem is one of the classic problems in project management that includes a range of optimization problems. One of the limitations we face in project scheduling problem is the resource constraint limitation. In many studies in the literature review, problems are based on the false assumption that a resource can be transferred between activities of a project or different projects without spending time and cost. The resource availability method in many fundamental researches in the context of resource constrained project scheduling problem (RCPSP) is considered as resource investment problems (RIP); while in many real world projects resources are rented for projects and... 

    Multi Commodity Three Layer Cross-docking Network Design Problem

    , M.Sc. Thesis Sharif University of Technology Shakib, Narges (Author) ; Akbari Jokar, Mohammad Reza (Supervisor)
    Abstract
    This thesis studies a multi-commodity, multi-period three layer cross-docking network design problem. It is based on a case study in the automotive industry to optimize the flow of auto-parts from automakers to the production sites. The use of cross-docks as a facility for the aggregation point in the supply chain, allows the rapid separation of goods to be sent to demand nodes. The problem is studied in two phases; the strategic phase for the location-allocation of cross-docks and the tactical phase for the routing of heterogeneous road transportation fleet. A mixed-integer programming formulation is presented for each phase to define the problem. Genetic and harmony search meta-heuristic... 

    A multi-objective harmony search algorithm to optimize multi-server location-allocation problem in congested systems

    , Article Computers and Industrial Engineering ; Vol. 72, Issue. 1 , 2014 , pp. 187-197 ; ISSN: 03608352 Hajipour, V ; Rahmati, SH. A ; Pasandideh, S. H. R ; Niaki, S. T. A ; Sharif University of Technology
    Abstract
    A novel bi-objective multi-server location-allocation (LA) model is developed in this paper, in which the facilities are modeled as an M/M/m queuing system. Further, capacity and budget limitations are provided to make the LA problem more realistic. The two objective functions include (1) minimizing aggregate waiting times and (2) minimizing the maximum idle time of all facilities. Since the proposed model is NP-hard, a meta-heuristic algorithm called multi-objective harmony search algorithm (MOHA) is developed to solve it. In this algorithm, a new presentation scheme that satisfies most of the model constraints is proposed. Since there is no benchmark available in the literature to validate... 

    Application of social harmony search algorithm on composite web service selection based on quality attributes

    , Article Proceedings - 2012 6th International Conference on Genetic and Evolutionary Computing, ICGEC 2012 ; 2012 , Pages 526-529 ; 9780769547633 (ISBN) Esfahani, P. M ; Habibi, J ; Varaee, T ; Sharif University of Technology
    2012
    Abstract
    The harmony search algorithm is one of the latest meta-heuristic algorithms. It benefits from a number of distinguishing features such as a simple concept, few parameters and easy implementation. Combination of web services for inter-enterprise interactions and creation of a composite service which meets users requirements are novel subjects for researches on service oriented systems and process of selecting the best quality based combination is a debatable challenge at this field. In this study an efficient service selection mechanism based on the social harmony search algorithm is proposed to help clients select services with considering the quality attributes. In order to demonstrate the... 

    Multi-product multi-chance-constraint stochastic inventory control problem with dynamic demand and partial back-ordering: A harmony search algorithm

    , Article Journal of Manufacturing Systems ; Volume 31, Issue 2 , 2012 , Pages 204-213 ; 02786125 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Seyedjavadi, S. M. H ; Sharif University of Technology
    Abstract
    In this paper, a multiproduct inventory control problem is considered in which the periods between two replenishments of the products are assumed independent random variables, and increasing and decreasing functions are assumed to model the dynamic demands of each product. Furthermore, the quantities of the orders are assumed integer-type, space and budget are constraints, the service-level is a chance-constraint, and that the partial back-ordering policy is taken into account for the shortages. The costs of the problem are holding, purchasing, and shortage. We show the model of this problem is an integer nonlinear programming type and to solve it, a harmony search approach is used. At the... 

    Reconfiguration and capacitor placement in radial distribution systems for loss reduction and reliability enhancement

    , Article 2011 16th International Conference on Intelligent System Applications to Power Systems, ISAP 2011 ; 2011 Rezaei, P ; Vakilian, M ; Hajipour, E ; Sharif University of Technology
    2011
    Abstract
    This paper applies different approaches to solve network reconfiguration and capacitor placement/setting problem. First, reconfiguration and capacitor placement is solved for power loss minimization. Second, medium and long-term planning perspective is considered for the problem which takes into account reliability cost in addition to energy losses cost. A heuristic algorithm is used in this study for reliability evaluation considering protection schemes and isolation points in the distribution network. The problems are solved by Harmony Search Algorithm, and it is shown that its performance is much more satisfactory than several other metaheuristic algorithms to solve reconfiguration and... 

    Constraint multiproduct joint-replenishment inventory control problem using uncertain programming

    , Article Applied Soft Computing Journal ; Volume 11, Issue 8 , December , 2011 , Pages 5143-5154 ; 15684946 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Nikousokhan, R ; Sharif University of Technology
    Abstract
    An uncertain economic order quantity (UEOQ) model with payment in advance is developed to purchase high-price raw materials. A joint policy of replenishments and pre-payments is employed to supply the materials. The rate of demand is considered LR-fuzzy variables, lead-time is taken to be constant, and it is assumed that shortage does not occur in the cycles. The cycle is divided into three parts; the first part is the time between the previous replenishment-time to the next order-time (t0), the second part is the period between t0 to a payment-time (tk), and the third part is the period between tk to the next replenishment-time. At the start of the second part (t0), α% of the purchasing... 

    Application of an improved harmony search algorithm in well placement optimization using streamline simulation

    , Article Journal of Petroleum Science and Engineering ; Volume 78, Issue 3-4 , 2011 , Pages 664-678 ; 09204105 (ISSN) Afshari, S ; Aminshahidy, B ; Pishvaie, M. R ; Sharif University of Technology
    2011
    Abstract
    Optimal well placement is a crucial step in efficient reservoir development process which significantly affects the productivity and economical benefits of an oil reservoir. However, it is a complex and challenging problem due to the different engineering, geological and economical variables involved. This leads to a very large number of potential scenarios that must be evaluated using numerical reservoir simulations. The key points in such an optimization process are using a fast function evaluation tool and development of an efficient and robust optimization algorithm that can find good solutions with a minimum required number of function evaluations. This study presents an approach that... 

    PAPR reduction of OFDM signals using harmony search algorithm

    , Article 2011 18th International Conference on Telecommunications, ICT 2011, 8 May 2011 through 11 May 2011, Ayia Napa ; 2011 , Pages 90-94 ; 9781457700248 (ISBN) Kermani, E. M ; Salehinejad, H ; Talebi, S ; Sharif University of Technology
    2011
    Abstract
    Orthogonal frequency division multiplexing (OFDM) is one of the widely used multiplexing techniques in wireless communications and especially cognitive radio networks. One of the key challenges of this technique is its high peak to average power ratio (PAPR) of the transmitted signal. This paper, introduces a new approach to PAPR reduction of OFDM signals using harmony search algorithm (HSA) based on the partial transmit sequence (PTS) method. The simulation results demonstrate that the proposed algorithm has better PAPR reduction performance as an accurate and low complexity approach for OFDM systems  

    Multiple-buyer multiple-vendor multi-product multi-constraint supply chain problem with stochastic demand and variable lead-time: A harmony search algorithm

    , Article Applied Mathematics and Computation ; Volume 217, Issue 22 , July , 2011 , Pages 9234-9253 ; 00963003 (ISSN) Taleizadeh, A. A ; Niaki, S. T. A ; Barzinpour, F ; Sharif University of Technology
    2011
    Abstract
    In this paper, a multi-buyer multi-vendor supply chain problem is considered in which there are several products, each buyer has limited capacity to purchase products, and each vendor has warehouse limitation to store products. In this chain, the demand of each product is stochastic and follows a uniform distribution. The lead-time of receiving products from a vendor to a buyer is assumed to vary linearly with respect to the order quantity of the buyer and the production rate of the vendor. For each product, a fraction of the shortage is backordered and the rest are lost. The ordered product quantities are placed in multiple of pre-defined packets and there are service rate constraints for... 

    Transmission constrained energy and reserve dispatch by harmony search algorithm

    , Article 2009 IEEE Power and Energy Society General Meeting, PES '09, 26 July 2009 through 30 July 2009, Calgary, AB ; 2009 ; 9781424442416 (ISBN) Afkousi Paqaleh, M ; Hosseini, S. H ; Sharif University of Technology
    IEEE  2009
    Abstract
    Spinning reserve (SR) is one of the most important ancillary services which are needed for satisfying reliability requirements, including the desired level of security in power systems. By definition, spinning reserve is the unloaded section of synchronized generation that is able to respond immediately to serve load. This paper proposes a hybrid DCOPF and harmony search (HS) optimization method as a novel heuristic approach to the joint dispatch of energy and reserve considering the bottling of reserve due to transmission limits. The effectiveness of the proposed method is examined by applying it to the IEEE 30-bus test system. The results obtained using the proposed method are presented... 

    A dynamic method for feeder reconfiguration and capacitor switching in smart distribution systems

    , Article International Journal of Electrical Power and Energy Systems ; Volume 85 , 2017 , Pages 200-211 ; 01420615 (ISSN) Ameli, A ; Ahmadifar, A ; Shariatkhah, M. H ; Vakilian, M ; Haghifam, M. R ; Sharif University of Technology
    Elsevier Ltd  2017
    Abstract
    In distribution systems, feeder reconfiguration (FR) can lead to loss reduction, reliability improvement and some other economic savings. These advantages can be intensified by proper control and switching of Capacitor Banks (CBs). In this paper, using Ant Colony Optimization (ACO) technique, a novel method is proposed for simultaneous dynamic scheduling of FR and CB switching in the presence of DG units having uncertain and variant generations over time. This method is applicable to both smart and classic distribution systems. While for the latter, state estimation method should be used to estimate the loads at different buses by employing a limited number of measurements. The objective of...