Loading...
Search for: heuristic-methods
0.013 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... 

    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  

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

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

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

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

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

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

    Multicast-aware mapping algorithm for on-chip networks

    , Article Proceedings - 19th International Euromicro Conference on Parallel, Distributed, and Network-Based Processing, PDP 2011 ; 2011 , p. 455-462 ; ISBN: 9780769543284 Habibi, A ; Arjomand, M ; Sarbazi-Azad, H ; Sharif University of Technology
    Abstract
    Networks-on-Chip (NoCs for short) are known as the most scalable and reliable on-chip communication architectures for multi-core SoCs with tens to hundreds IP cores. Proper mapping the IP cores on NoC tiles (or assigning threads to cores in chip multiprocessors) can reduce end-to-end delay and energy consumption. While almost all previous works on mapping consider higher priority for the application's flows with higher required bandwidth, a mapping strategy, presented in this paper, is introduced that considers multicast communication flows in addition to the normal unicast flows. To this end, multicast and unicast traffic flows are first characterized in terms of some new metrics which are... 

    Identifying the tool-tissue force in robotic laparoscopic surgery using neuro-evolutionary fuzzy systems and a synchronous self-learning hyper level supervisor

    , Article Applied Soft Computing Journal ; Vol. 14, issue. PART A , January , 2014 , pp. 12-30 Mozaffari, A ; Behzadipour, S ; Kohani, M ; Sharif University of Technology
    Abstract
    In this paper, two different hybrid intelligent systems are applied to develop practical soft identifiers for modeling the tool-tissue force as well as the resulted maximum local stress in laparoscopic surgery. To conduct the system identification process, a 2D model of an in vivo porcine liver was built for different probing tasks. Based on the simulation, three different geometric features, i.e. maximum deformation angle, maximum deformation depth and width of displacement constraint of the reconstructed shape of the deformed body are extracted. Thereafter, two different fuzzy inference paradigms are proposed for the identification task. The first identifier is an adaptive co-evolutionary... 

    Multi-user opportunistic spectrum access with channel impairments

    , Article AEU - International Journal of Electronics and Communications ; Volume 67, Issue 11 , 2013 , Pages 955-966 ; 14348411 (ISSN) Majd, S. A ; Salehkaleybar, S ; Pakravan, M. R ; Sharif University of Technology
    2013
    Abstract
    In this paper, we study the impact of sensing error and channel fading on the decision process of a multiple secondary user network in a primary network whose channel occupancy states are modelled as a Bernoulli process. We present a randomized access strategy to maximize total secondary network throughput. The proposed method guarantees that the probability of collision between primary and secondary users in each channel is less than the predefined value of P c = ξ. To find the optimal access strategy, we formulate secondary network throughput as an optimization problem. Then, using the KKT method to find the solution, we break the original problem into multiple sub-problems. Then, we... 

    A heuristic complexity-based method for cost estimation of aerospace systems

    , Article Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering ; Volume 227, Issue 11 , 2013 , Pages 1685-1700 ; 09544100 (ISSN) Banazadeh, A ; Jafari, M. H ; Sharif University of Technology
    2013
    Abstract
    Cost estimation plays an essential role in the development of aerospace systems that are perhaps the most complex, time- and labor-consuming ones. Regarding this matter, it is unavoidable to take a systematic approach to build a realistic model through a deliberative, heuristical and easy-to-do process in the early stages of design. In the current study, complexity index theory is utilized to develop a heuristic complexity-based method to estimate various costs of aerospace systems. This method promises to be logically and practically more reliable and accurate than classical parametric methods. Logically, manipulating a group of parameters, instead of only one or two, reduces the... 

    Discrete kinematic synthesis of discretely actuated hyper-redundant manipulators

    , Article Robotica ; Volume 31, Issue 7 , 2013 , Pages 1073-1084 ; 02635747 (ISSN) Motahari, A ; Zohoor, H ; Korayem, M. H ; Sharif University of Technology
    2013
    Abstract
    Discrete kinematic synthesis of discretely actuated hyper-redundant manipulators is a new practical problem in robotics. The problem concerns with determining the type of each manipulator module from among several specific types, so that the manipulator could reach several specified target frames with the lowest error. This paper suggests using a breadth-first search method and a workspace mean frame to solve this problem. To reduce errors, two heuristic ideas are proposed: two-by-two searching method and iteration. The effectiveness of the proposed method is verified through several numerical problems  

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

    A multi-agent optimization formulation of earthquake disaster prevention and management

    , Article European Journal of Operational Research ; Volume 229, Issue 1 , 2013 , Pages 261-275 ; 03772217 (ISSN) Edrissi, A ; Poorzahedy, H ; Nassiri, H ; Nourinejad, M ; Sharif University of Technology
    2013
    Abstract
    Natural earthquake disasters are unprecedented incidents which take many lives as a consequence and cause major damages to lifeline infrastructures. Various agencies in a country are responsible for reducing such adverse impacts within specific budgets. These responsibilities range from before to after the incident, targeting one of the main phases of disaster management (mitigation, preparedness, and response). Use of OR in disaster management and coordination of its phases has been mostly ignored and highly recommended in former reviews. This paper presents a formulation to coordinate three main agencies and proposes a heuristic approach to solve the different introduced sub-problems. The... 

    A heuristic approach to the realization of the wide-band optical diode effect in photonic crystal waveguides

    , Article Journal of Optics (United Kingdom) ; Volume 15, Issue 7 , June , 2013 ; 20408978 (ISSN) Khavasi, A ; Rezaei, M ; Fard, A. P ; Mehrany, K ; Sharif University of Technology
    2013
    Abstract
    In this paper a highly efficient optical diode is demonstrated in photonic crystal waveguides with broken spatial symmetry. The structure is made of isotropic linear materials and does not need high power optical beams or strong magnetic fields. While the proposed structure shows almost complete light transmission (>99%) in one direction, it blocks light transmission in the opposite direction. This unidirectional transmission is retained within a wide range of frequencies (>4% of central frequency). In order to achieve an optical diode effect, the optical mode of the waveguide is manipulated by designing an ultra-compact mode converter and an efficient mode filter. The dimensions of the... 

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

    A new online random particles optimization algorithm for mobile robot path planning in dynamic environments

    , Article Mathematical Problems in Engineering ; Volume 2013 , 2013 ; 1024123X (ISSN) Mohajer, B ; Kiani, K ; Samiei, E ; Sharifi, M ; Sharif University of Technology
    2013
    Abstract
    A new algorithm named random particle optimization algorithm (RPOA) for local path planning problem of mobile robots in dynamic and unknown environments is proposed. The new algorithm inspired from bacterial foraging technique is based on particles which are randomly distributed around a robot. These particles search the optimal path toward the target position while avoiding the moving obstacles by getting help from the robot's sensors. The criterion of optimal path selection relies on the particles distance to target and Gaussian cost function assign to detected obstacles. Then, a high level decision making strategy will decide to select best mobile robot path among the proceeded particles,... 

    Using a classifier pool in accuracy based tracking of recurring concepts in data stream classification

    , Article Evolving Systems ; Volume 4, Issue 1 , 2013 , Pages 43-60 ; 18686478 (ISSN) Hosseini, M. J ; Ahmadi, Z ; Beigy, H ; Sharif University of Technology
    2013
    Abstract
    Data streams have some unique properties which make them applicable in precise modeling of many real data mining applications. The most challenging property of data streams is the occurrence of "concept drift". Recurring concepts is a type of concept drift which can be seen in most of real world problems. Detecting recurring concepts makes it possible to exploit previous knowledge obtained in the learning process. This leads to quick adaptation of the learner whenever a concept reappears. In this paper, we propose a learning algorithm called Pool and Accuracy based Stream Classification with some variations, which takes the advantage of maintaining a pool of classifiers to track recurring... 

    A swarm based method for solving transit network design problem

    , Article Australasian Transport Research Forum, ATRF 2013 - Proceedings ; 2013 Bagherian, M ; Massah, S ; Kermanshahi, S ; Sharif University of Technology
    Australasian Transport Research Forum  2013
    Abstract
    In this study, a Discrete Particle Swarm Optimization (DPSO) algorithm is assimilated to solve the Transit Network Design Problem (TNDP). First, A Mixed Integer Model is developed for the TNDP. The solution methodology utilized here is made of two major elements. A route generation module is firstly developed to generate all the feasible transit lines. Through the second part, a DPSO algorithm is utilized to select the optimal set of lines from the constructed ones. The objective function is to maximize coverage index while satisfying the operator cost upper level constraints. The efficacy and accuracy of the implemented algorithms is compared with ones obtained by an enumeration process as...