Loading...
Search for: quadratic-assignment-problem
0.006 seconds

    A logit-based model for facility placement planning in supply chain management

    , Article International Journal of Logistics Systems and Management ; Volume 20, Issue 1 , 2015 , Pages 122-147 ; 17427967 (ISSN) Bagloee, S. A ; Shnaiderman, M ; Tavana, M ; Ceder, A ; Sharif University of Technology
    Inderscience Enterprises Ltd  2015
    Abstract
    The facility placement in supply chain management entails suppliers and consumers along with the terminals in between for distributing commodities. This study seeks to find the best terminal placement by taking into consideration the costs for both transportation and terminal construction. We call this a supplier-terminal-consumer (STC) problem and show that the STC is an NP-hard quadratic assignment problem. The NP-hard problems in real-size are proven to be intractable; hence, we develop a two-fold heuristic method for solving the STC problems. First, we identify the commodity flow by using a logit-based mathematical programming (Logit-MP) methodology based on the demand for the commodity... 

    Image Registration Using Graph-based Methods

    , M.Sc. Thesis Sharif University of Technology Taheri Dezaki, Fatemeh (Author) ; Fatemizadeh, Emadeddin (Supervisor)
    Abstract
    Nowadays, image registration is considered as one of usual issues in medical researches whose new findings are expanding outstandingly and it has reached a high level of maturity. Generally speaking, image registration is a task to reliably estimate the geometric transformation such that two images can be precisely aligned. With respect to different uses of image registration in medical applications, it has attracted the attention of many scholars and there has been made significant improvement in this realm. Image registration is still one of the active branches in medical image processing due to its wide applications and problems. Graphs, thanks to their geometric structures and intuitive... 

    Applications of Quadratic Programming in Bioinformatics Problems Specially Network Alignment

    , M.Sc. Thesis Sharif University of Technology Mohammadi Siahroodi, Elahe (Author) ; Foroughmand, Mohammad Hadi (Supervisor)
    Abstract
    One of the most important targets in bio-informatics is the analysis of biological networks. These networks are modeled by graphs. Comparing networks with mapping is a useful tool for analyzing. The mapping between the nodes of a network that preserves some topological and functional structures, is called network alignment. Network alignment has various applications in different fields; such as pattern recognition, social networks, biological networks, and etc. The alignment of the protein-protein interaction network is one of the substantial problems. There are many static algorithms for the alignment of PPI networks. Because of the developments of computer science in recent years,... 

    Hybridizations of genetic algorithms and neighborhood search metaheuristics for fuzzy bus terminal location problems

    , Article Applied Soft Computing Journal ; Volume 46 , 2016 , Pages 220-229 ; 15684946 (ISSN) Babaie Kafaki, S ; Ghanbari, R ; Mahdavi Amiri, N ; Sharif University of Technology
    Elsevier Ltd 
    Abstract
    We propose modified hybridizations of genetic algorithms with some neighborhood search based metaheuristics. In our hybrid algorithms, we consider gradually increasing probability for the application of the neighborhood search procedure on the best individuals as the number of iterations of the genetic algorithm increases. We implement the proposed hybrid algorithms and compare their performance with two other recently proposed hybrid algorithms which, in contrast, use the neighborhood search procedure on all the individuals of the population, two hybrid algorithms applying simulated annealing on the best individual in the papulation in every iteration and three non-hybrid metaheuristic... 

    Simultaneous Solution of the Project Material Procurement Scheduling Problem and Warehouse Allocation Using a Population-based Simulated Annealing Algorithm

    , M.Sc. Thesis Sharif University of Technology Moradi, Nima (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    One most important industry in developing countries is the construction industry and essential component of any construction project is the construction site. According to studies, proper construction site planning will increase productivity, reduce cost, time and risk of the project. Facility layout planning and warehouse location are the most important problems in the construction site. Project activity scheduling, ordering and delivery of material known as project logistics have been investigated by several researchers. In this thesis, two problems including material procurement scheduling and warehouse allocation are simultaneously considered, a hybrid problem, which due to its... 

    OPAIC: An optimization technique to improve energy consumption and performance in application specific network on chips

    , Article Measurement: Journal of the International Measurement Confederation ; Volume 74 , 2015 , Pages 208-220 ; 02632241 (ISSN) Taassori, M ; Taassori, M ; Niroomand, S ; Vizvári, B ; Uysal, S ; Hadi Vencheh, A ; Sharif University of Technology
    Elsevier  2015
    Abstract
    Abstract Network on Chip (NoC) is an appropriate and scalable solution for today's System on Chips (SoCs) with the high communication demands. Application specific NoCs is preferable since they can be customized to optimize all requirements of the specific applications. This paper presents an OPtimization technique for Application specifIC NoCs (OPAIC), which aims not only to decrease the energy consumption but also to improve the area of NoCs. OPAIC is composed of three stages to find the optimum NoC; in the first stage, it uses a linearized form of a Quadratic Assignment Problem (QAP) to map tasks on cores to minimize the energy. In the second stage, a Mixed Integer Linear Problem (MILP)...