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

    Plastic Analysis of Two Dimensional Frames using Ant Colony Algorithms

    , M.Sc. Thesis Sharif University of Technology Pouraghajan, Marjan (Author) ; Jahanshahi, Mohsen (Supervisor)
    Abstract
    In previous decades, easy access to material and low cost human power allow the product process to be performed in a preferred way. The limit in amount of material, economy, and the efficiency of the model has not been influential like these days. Today, the effective use of material and consideration of an economic model have great importance. It is obvious that a process of designing implies optimizing which the range of its using is also continuing in many engineering sciences. Many optimization issues contain discrete nature. Many of searching spaces that we encounter in the real world applications are not necessarily continuous as a condition which has crucial importance for classic... 

    Optimizing a Flowshop Model with the Objective of Minimizing Total Weighted Tardiness while Considering due Dates on All Machines

    , M.Sc. Thesis Sharif University of Technology Nadimi, Fattane (Author) ; Ghassemi Tari, Farhad (Supervisor)
    Abstract
    Minimizing completion time of tasks in a flowshops has always attracted attention of researchers since it was introduced by Johnson, 1954. If all jobs are processed in the same order, the sequence is called a permutation sequence. Tardiness factor is one of important factors in permutation flowshop sequencing problem. Minimizing this factor brings about increase in service level of the shop and is helpful in meeting customer’s needs. Since, minimizing tardiness in PFSP in among NP-hard problems, computational efforts in this area has focused on heuristic approaches. However, the researches has always considered due dates only on the last machine. It means, always it has been assumed that due... 

    Evaluating the Benefit of Imperfection Advance Load Information in a Transportation Spot Market

    , M.Sc. Thesis Sharif University of Technology Mirbaygi Shahabad, Mohammad Jalal (Author) ; Shaderukh, Shahram (Supervisor) ; Najafi, Mehdi (Supervisor)
    Abstract
    This study examines how imperfect advance load information (IALI) can improve profits and vacancies for a trucking company. To evaluate the value of IALI, first, a deterministic mathematical model is created. Next, we propose a Markov decision programming approach that can use this IALI.Due to exponential size of the state space the problem cannot be solved to optimality it in polynomial time so we suggest a heuristic algorithm.After designing a comprehensive set of experiments, we use both models using a dynamic implementation mechanism to evaluate the benefits of using this information. Statistical analysis and literature show that, firstly, the use of IALI can significantly improve the... 

    Design and Dynamics Control of Six Degree of Freedom Microrobot

    , M.Sc. Thesis Sharif University of Technology Motekallem, Abolfazl (Author) ; Sayyaadi, Hassan (Supervisor)
    Abstract
    The field of microrobotics has seen tremendous advances in recent years. Potential high impact applications of untethered microrobots such as minimally invasive diagnosis and treatment inside the human body, biological studies or bioengineering, microfluidics, desktop micromanufacturing, and mobile sensor networks for environmental and health monitoring are reported. However, There are significant challenges in microrobotic technology, including energy resources, control systems, reliability and safety, design and manufacturing of micromotors and localization. In this work, overall size scale being micron scale is emphasized where mobile robots able to fit in spaces smaller than a millimeter... 

    A Hybrid Simulated Annealing Algorithm For Winner Determination problem In Combinatorial Auction

    , M.Sc. Thesis Sharif University of Technology Arab Momeni, Mojtaba (Author) ; Kianfar, Farhad (Supervisor)
    Abstract
    One of the most important issues that an organization faced with is resource management. The proper resource management has the great rule in organization cost reduction. One of the most efficient processes in resource allocation is auction and there is different auction with different mechanism and goals. In an auction there is a set of items and a set of bids, and the task of auctioneer is matching items with suitable bids. Each bid consist of desirable items and the bidder value of that items. In an auction process, after mechanism design of auction and auction implementation we must identify the winners of auction and this is a hard problem even in simple auction.
    In this study we... 

    Solving Location Problem for Vehicle Identification Sensors to Observe or Estimate Path Flows in Larg-Scale Networks

    , M.Sc. Thesis Sharif University of Technology Talebian Yazdi, Pegah (Author) ; Shafahi, Yousef (Supervisor)
    Abstract
    Origin-Destination (OD) demand is one of the important requirements in transportation planning. Estimating OD demand could be an expensive and time consuming procedure. These days using vehicle identification sensors for OD estimation has become very common because of its low cost and high accuracy. In this study, we focus on solving location problems of these sensors with the aim of observe and estimate path flows. These problems have only been solved for small-scale networks until recently due to being computationally expensive. These years two basic models have been introduced : one, without considering time of vehicle ID detection and one, with considering that information. In this... 

    Project Scheduling Subject to Nonrenewable Resource with Proscheduled Procurement

    , Ph.D. Dissertation Sharif University of Technology Shirzadeh Chaleshtari, Ali (Author) ; Shadrokh, Shahram (Supervisor)
    Abstract
    Among various types of resources defined in the project scheduling literature, the most studies have been conducted on the renewable and nonrenewable resource types. Definition of different resources in the project scheduling literature is based on the specification of the resources in the real projects. Yet there are some sort of nonrenewable resources in the real projects that are not exactly similar to the type defined in the project scheduling literature. The difference stems from this fact that in the project scheduling literature, it is supposed that the nonrenewable resources required for the execution of the project activities are available in full amount at the beginning of the... 

    A Heuristic Method for Solving VRP Problem with Customer Loyalty

    , M.Sc. Thesis Sharif University of Technology Rafiei Tabatabaei, Mohammad Javad (Author) ; Fazli, Mohammad Amin (Supervisor)
    Abstract
    This paper is concerned with the Vehicle Routing Problem (VRP) in a fleet with customer loyalty. In this work, we consider priority for customers according to their loyalty and try to declare an objective function which concerns customers' satisfaction along other normal VRP objectives like route optimization  

    Estimating the four parameters of the Burr III distribution using a hybrid method of variable neighborhood search and iterated local search algorithms

    , Article Applied Mathematics and Computation ; Volume 218, Issue 19 , 2012 , Pages 9664-9675 ; 00963003 (ISSN) Zoraghi, N ; Abbasi, B ; Niaki, S. T. A ; Abdi, M ; Sharif University of Technology
    2012
    Abstract
    The Burr III distribution properly approximates many familiar distributions such as Normal, Lognormal, Gamma, Weibull, and Exponential distributions. It plays an important role in reliability engineering, statistical quality control, and risk analysis models. The Burr III distribution has four parameters known as location, scale, and two shape parameters. The estimation process of these parameters is controversial. Although the maximum likelihood estimation (MLE) is understood as a straightforward method in parameters estimation, using MLE to estimate the Burr III parameters leads to maximize a complicated function with four unknown variables, where using a conventional optimization such as... 

    Solving Detour-Based Fuel Stations Location Problems

    , Article Computer-Aided Civil and Infrastructure Engineering ; Volume 31, Issue 2 , 2016 , Pages 132-144 ; 10939687 (ISSN) Zockaie, A ; Aashtiani, H. Z ; Ghamami, M ; Marco Nie, Y ; Sharif University of Technology
    Blackwell Publishing Inc 
    Abstract
    This article studies the problem of locating fuel stations to minimize the extra cost spent in refueling detours, which belongs to a class of discretionary service facility location problems. Unlike many studies of similar problems in the literature, the proposed model considers capacity constraints and compares different ways to incorporate them in the formulation. Note that ignoring the capacity constraint results in nonoptimal and unrealistic solutions. The proposed models are solved using both an off-the-shelf solver (CPLEX) and a specialized meta-heuristic method (Simulated Annealing) developed in this study. The solution methods are tested and compared in two case studies; a test... 

    Observer-Based impulsive controller design for treatment of hepatitis C disease

    , Article Industrial and Engineering Chemistry Research ; Volume 59, Issue 43 , 2020 , Pages 19370-19382 Zeinali, S ; Shahrokhi, M ; Ibeas, A ; Sharif University of Technology
    American Chemical Society  2020
    Abstract
    In this study, an impulsive state feedback controller has been proposed for the treatment of hepatitis-C-infected patients under Pegylated-Interferon (PEG-IFN-α2b) therapy. The Neumann model has been utilized as the representative of the hepatitis C virus (HCV) dynamics. In order to consider the drug efficacy variation between injections, the pharmacokinetics/pharmacodynamics (PK/PD) equations have been included in the model. The impulsive nature of the drug injection also has been considered in the disease dynamics. In the proposed treatment method, the drug dose limitation has been addressed as an input nonlinearity. The asymptotical stability of the control method under the impulsive... 

    Parallelization of the branch-and-bound algorithm in transportation discrete network design problem

    , Article Scientia Iranica ; Volume 23, Issue 2 , 2016 , Pages 407-419 ; 10263098 (ISSN) Zarrinmehr, A ; Shafahi, Y ; Sharif University of Technology
    Sharif University of Technology 
    Abstract
    Transportation Discrete Network Design Problem (TDNDP) aims at choosing a subset of proposed projects to minimize the users' total travel time with respect to a budget constraint. Because TDNDP is a hard combinatorial problem, recent research has widely addressed heuristic approaches and ignored the exact solution. This paper explores how application of parallel computation can affect the performance of an exact algorithm in TDNDP. First, we show that the Branch-and-Bound (B&B) algorithm, proposed by LeBlanc, is well adapted to a parallel design with synchronized Master-Slave (MS) paradigm. Then, we develop a parallel B&B algorithm and implement it with two search strategies of... 

    Heuristic algorithm for periodic clock optimisation in scheduling-based latency-insensitive design

    , Article IET Computers and Digital Techniques ; Volume 9, Issue 3 , May , 2015 , Pages 165-174 ; 17518601 (ISSN) Zare, M ; Hessabi, S ; Goudarzi, M ; Sharif University of Technology
    Institution of Engineering and Technology  2015
    Abstract
    Delay in communication wires causes design iterations in system-on-chip. Latency-insensitive design copes with this issue by encapsulating each core in a shell wrapper and inserting buffers in the wires to separate the design of core from that of communication wires. Scheduling-based latency-insensitive protocol is a methodology which employs shift registers for periodic clock gating of blocks instead of the shell wrappers. In many cases, the bit sequences inside the shift registers are too long and therefore consume a large area. This study presents a heuristic algorithm that optimises the bit sequences and produces them with shorter lengths compared with the existing method. The algorithm... 

    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... 

    Superpoly algebraic normal form monomial test on Trivium

    , Article IET Information Security ; Volume 7, Issue 3 , 2013 , Pages 230-238 ; 17518709 (ISSN) Vardasbi, A ; Salmasizadeh, M ; Mohajeri, J ; Sharif University of Technology
    2013
    Abstract
    Recently, AIDA/cube testers have been revealed to be useful in building distinguishers for several cryptography schemes. χ2 tests, on the other hand, are well known and extensively used for distinguishing purposes. In this study, the notion of multi-χ2 test and AIDA/cube testers are utilised to introduce the superpoly algebraic normal form monomial test through which the output of reduced round Trivium is distinguished from being random. The test successfully distinguishes the keystream of Trivium with 830 out of 1152 initialisation rounds with a complexity of 239 operations, which is the most effective distinguisher on reduced Trivium thus far. Applying algebraic IV differential attack... 

    Heuristic algorithms to solve a bi-criteria traveling salesman problem with fuzzy time window

    , Article 35th International Conference on Computers and Industrial Engineering, ICC and IE 2005, Istanbul, 19 June 2005 through 22 June 2005 ; 2005 , Pages 1899-1904 ; 9755612653 (ISBN); 9789755612652 (ISBN) Tavakkoli Moghaddam, R ; Rabbani, M ; Hakami, M ; Kazemi, M ; Sharif University of Technology
    2005
    Abstract
    This paper presents a mathematical programming to model a bi-criteria traveling salesman problem (TSP) with fuzzy time windows. The objective is to minimize the travel time and minimize the sum of salesman's waiting time during the service. A triangle fuzzy number is defined for the service time of each customer. The objective function is normalized in the interval between 0 and 1. To solve such a model, two heuristic methods based on genetic algorithms (GAs) and ant colony optimization (ACO) are developed. To validate and show the efficiency these methods, a number of test problems are generated at random. Finally, a comparison of the obtained results is presented  

    Prediction of chaos in electrostatically actuated arch micro-nano resonators: Analytical approach

    , Article Communications in Nonlinear Science and Numerical Simulation ; Volume 30, Issue 1-3 , 2016 , Pages 182-195 ; 10075704 (ISSN) Tajaddodianfar, F ; Nejat Pishkenari, H ; Hairi Yazdi, M. R ; Sharif University of Technology
    Elsevier  2016
    Abstract
    Chaotic vibrations of a bistable resonator comprised of doubly clamped shallow arch under simultaneous harmonic AC and static DC distributed electrostatic actuation are investigated. A single degree of freedom model obtained by application of the Galerkin decomposition method to the Euler-Bernoulli shallow arch equation is used for the studies. The bistable arch possessing an asymmetric double-well potential is vulnerable to homoclinic chaos at certain values of parameters. We have implemented the Melnikov's method to derive a necessary condition for the initiation of chaos in this type of resonators. Moreover, we have used a heuristic chaos prediction criterion, together with an analytical... 

    Improving the performance of heuristic searches with judicious initial point selection

    , Article Proceedings of The 5th IEEE International Symposium on Embedded Computing, SEC 2008, 6 October 2008 through 8 October 2008, Beijing ; 2008 , Pages 14-19 ; 9780769533483 (ISBN) Tahaee, A ; Jahangir, A. H ; Habibi Masouleh, H ; Sharif University of Technology
    2008
    Abstract
    In this paper we claim that local optimization can produce proper start point for genetic search. We completely test this claim on partitioning problem and on the performance of genetic search in a real problem that is finding aggregation tree in the sensor networks. The presented method (named Tendency algorithm) increases the performance of heuristic searches, and can be used in parallel with other tuning methods. The paper justifies the logic behind tendency algorithm by measuring the "entropy" of solution (in regard to optimal solution), and by numerous empirical tests. © 2008 IEEE  

    Hybrid immune-genetic algorithm method for benefit maximisation of distribution network operators and distributed generation owners in a deregulated environment

    , Article IET Generation, Transmission and Distribution ; Volume 5, Issue 9 , 2011 , Pages 961-972 ; 17518687 (ISSN) Soroudi, A ; Ehsan, M ; Caire, R ; Hadjsaid, N ; Sharif University of Technology
    Abstract
    In deregulated power systems, distribution network operators (DNO) are responsible for maintaining the proper operation and efficiency of distribution networks. This is achieved traditionally through specific investments in network components. The event of distributed generation (DG) has introduced new challenges to these distribution networks. The role of DG units must be correctly assessed to optimise the overall operating and investment cost for the whole system. However, the distributed generation owners (DGOs) have different objective functions which might be contrary to the objectives of DNO. This study presents a long-term dynamic multi-objective model for planning of distribution... 

    Efficient immune-GA method for DNOs in sizing and placement of distributed generation units

    , Article European Transactions on Electrical Power ; Volume 21, Issue 3 , 2011 , Pages 1361-1375 ; 1430144X (ISSN) Soroudi, A ; Ehsan, M ; Sharif University of Technology
    Abstract
    This paper proposes a hybrid heuristic optimization method based on genetic algorithm and immune systems to maximize the benefits of Distribution Network Operators (DNOs) accrued due to sizing and placement of Distributed Generation (DG) units in distribution networks. The effects of DG units in reducing the reinforcement costs and active power losses of distribution network have been investigated. In the presented method, the integration of DG units in distribution network is done considering both technical and economical aspects. The strength of the proposed method is evaluated by applying it on a small and a realistic large scale distribution network and the results are compared with...