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

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

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

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

    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  

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

    An efficient heuristic method for joint optimization of train scheduling and stop planning on double-track railway systems

    , Article INFOR ; Volume 58, Issue 4 , 2020 , Pages 652-679 Boroun, M ; Ramezani, S ; Farahani, N. V ; Hassannayebi, E ; Abolmaali, S ; Shakibayifar, M ; Sharif University of Technology
    University of Toronto Press  2020
    Abstract
    In this study, a new mathematical programming approach for solving the joint timetabling and train stop planning problem in a railway line with double-track segments is proposed. This research aims to design an optimized train timetable subject to the station- capacity and time-dependent dwell time constraints. The objective function is to maximize the railway infrastructure capacity by minimizing the schedule makespan. The problem is formulated as a particular case of blocking permutation flexible flow shop scheduling model with dynamic time window constraints. Due to the combinatorial nature of the problem, heuristic algorithm and bound tightening methods are proposed that generate... 

    On the efficiency of artificial neural networks for plastic analysis of planar frames in comparison with genetic algorithms and ant colony systems

    , Article Neural Computing and Applications ; 2016 , Pages 1-19 ; 09410643 (ISSN) Jahanshahi, M ; Maleki, E ; Ghiami, A ; Sharif University of Technology
    Springer-Verlag London Ltd 
    Abstract
    The investigation of plastic behavior and determining the collapse load factors are the important ingredients of every kinematical method that is employed for plastic analysis and design of frames. The determination of collapse load factors depends on many effective parameters such as the length of bays, height of stories, types of loads and plastic moments of individual members. As the number of bays and stories increases, the parameters that have to be considered make the analysis a complex and tedious task. In such a situation, the role of algorithms that can help to compute an approximate collapse load factor in a reasonable time span becomes more and more crucial. Due to their... 

    A heuristic scheduling method for the pipe-spool fabrication process

    , Article Journal of Ambient Intelligence and Humanized Computing ; Volume 9, Issue 6 , 2018 , Pages 1901-1918 ; 18685137 (ISSN) Safarzadeh, S ; Shadrokh, S ; Salehian, A ; Sharif University of Technology
    Springer Verlag  2018
    Abstract
    The pipe-spool fabrication process is a critical operational section in the piping projects that usually used to accelerate and discipline the installation process, especially, when we have a particular deadline for the project. For this reason, the fast and optimal scheduling of the fabrication activities with considering the real conditions and using manual or traditional methods is a significant problem for the decision-makers. In this paper, we use a novel linear programming model to schedule the spool fabrication activities based on the flexible job shop scheduling problem (FJSP). Because FJSP is a challengeable NP-hard problem, we solve the proposed mathematical model with a heuristic... 

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

    Optimizing a multi-item economic order quantity problem with imperfect items, inspection errors, and backorders

    , Article Soft Computing ; Volume 23, Issue 22 , 2019 , Pages 11671-11698 ; 14327643 (ISSN) Khalilpourazari, S ; Pasandideh, S. H. R ; Akhavan Niaki, S. T ; Sharif University of Technology
    Springer Verlag  2019
    Abstract
    This paper proposes a multi-item economic order quantity model with imperfect items in supply deliveries. The inspection process to classify the items is not perfect and involves two types of error: Type-I and Type-II. To cope with the uncertainty involved in real-world applications and to bring the problem closer to reality, operational constraints are assumed stochastic. The aim is to determine the optimal order and back order sizes of the items in order to achieve maximum total profit. As the proposed mathematical model is a constrained nonlinear programming, three different solution methods including an exact method named the interior-point and two novel meta-heuristics named grey wolf... 

    Planning by guided hill-climbing

    , Article 6th Mexican International Conference on Artificial Intelligence, MICAI 2007, Aguascalientes, 4 November 2007 through 10 November 2007 ; Volume 4827 LNAI , 2007 , Pages 1067-1077 ; 03029743 (ISSN); 9783540766308 (ISBN) Akramifar, S. A ; Ghassem Sani, G ; Sharif University of Technology
    Springer Verlag  2007
    Abstract
    This paper describes a novel approach will be called guided hill climbing to improve the efficiency of hill climbing in the planning domains. Unlike simple hill climbing, which evaluates the successor states without any particular order, guided hill climbing evaluates states according to an order recommended by an auxiliary guiding heuristic function. Guiding heuristic function is a self-adaptive and cost effective function based on the main heuristic function of hill climbing. To improve the performance of the method in various domains, we defined several heuristic functions and created a mechanism to choose appropriate functions for each particular domain. We applied the guiding method to... 

    An improved fruit fly optimization algorithm to solve the homogeneous fuzzy series–parallel redundancy allocation problem under discount strategies

    , Article Soft Computing ; Volume 20, Issue 6 , 2016 , Pages 2281-2307 ; 14327643 (ISSN) Mousavi, S. M ; Alikar, N ; Akhavan Niaki, S. T ; Sharif University of Technology
    Springer Verlag 
    Abstract
    In this paper, a mathematical formulation is first derived for a homogenous fuzzy series–parallel redundancy allocation problem, where both the system and its subsystems can only take two states of complete perfect and complete failure. Identical redundant components are included in order to achieve desirable system reliability. The components of each subsystem characterized by their cost, weight, and reliability, are purchased from the market under all-unit discount and incremental quantity discount strategies. The goal is to find the optimum combination of the number of components for each subsystem that maximizes the system reliability under total fuzzy cost and weight constraints. An... 

    An economic-statistical design of simple linear profiles with multiple assignable causes using a combination of MOPSO and RSM

    , Article Soft Computing ; Volume 25, Issue 16 , 2021 , Pages 11087-11100 ; 14327643 (ISSN) Ershadi, M. J ; Ershadi, M. M ; Haghighi Naeini, S ; Akhavan Niaki, S. T ; Sharif University of Technology
    Springer Science and Business Media Deutschland GmbH  2021
    Abstract
    An economic-statistical design with multiple assignable causes following exponential distribution is presented in this paper for linear profiles. For this purpose, a tri-objective optimization model is proposed to minimize the cost with desired statistical performances. Average Run Length (ARL) as the primary statistical measure is employed for the appraisal of the designed linear profiles. The first objective to be minimized is a cost function that models the implementation cost in different states. The second objective is to maximize ARL or the in-control average run-length of the monitoring scheme. The third objective to be minimized is ARL 1 or the out-of-control average run-length of... 

    TSRN: A tabu search-based routing protocol for named data networking

    , Article Wireless Personal Communications ; Volume 101, Issue 3 , 2018 , Pages 1411-1428 ; 09296212 (ISSN) Shariat, Z ; Movaghar, A ; Hosseinzadeh, M ; Sharif University of Technology
    Springer New York LLC  2018
    Abstract
    Information-centric network (ICN) has become a basic research topic with regard to the future architecture of the Internet. Storage and routing data is an important feature of ICN, as it improves network performance and content distribution. One of the challenges in this type of network is the routing problem. The objective of this paper is to propose a routing algorithm in the named data network. Owing to the impressive results presented by the enhanced heuristic methods, tabu search has been selected to develop the proposed algorithm. This work has been carried out in five major steps, Creating the initial solution, The mechanisms of generating a neighborhood, Evaluating the neighbor... 

    Designing a MapReduce performance model in distributed heterogeneous platforms based on benchmarking approach

    , Article Journal of Supercomputing ; Volume 76, Issue 9 , 2020 , Pages 7177-7203 Gandomi, A ; Movaghar, A ; Reshadi, M ; Khademzadeh, A ; Sharif University of Technology
    Springer  2020
    Abstract
    MapReduce framework is an effective method for big data parallel processing. Enhancing the performance of MapReduce clusters, along with reducing their job execution time, is a fundamental challenge to this approach. In fact, one is faced with two challenges here: how to maximize the execution overlap between jobs and how to create an optimum job scheduling. Accordingly, one of the most critical challenges to achieving these goals is developing a precise model to estimate the job execution time due to the large number and high volume of the submitted jobs, limited consumable resources, and the need for proper Hadoop configuration. This paper presents a model based on MapReduce phases for... 

    A new supply chain distribution network design for two classes of customers using transfer recurrent neural network

    , Article International Journal of System Assurance Engineering and Management ; Volume 13, Issue 5 , 2022 , Pages 2604-2618 ; 09756809 (ISSN) Najjartabar Bisheh, M ; Nasiri, G. R ; Esmaeili, E ; Davoudpour, H ; Chang, S. I ; Sharif University of Technology
    Springer  2022
    Abstract
    Supply chain management integrates planning and controlling of materials, information, and finances in a process which begins from suppliers and ends with customers. Optimal planning decisions made in such a distribution network usually include transportation, facilities location, and inventory. This study presents a new approach for considering customers’ differentiation in an integrated location-allocation and inventory control model using transfer recurrent neural network (RNN). In this study, a location and allocation problem is integrated with inventory control decisions considering two classes of strategic and non-strategic customers. For the first time, a novel transfer RNN is applied... 

    A genetic algorithm for resource investment problems, enhanced by the revised Akpan method

    , Article Scientia Iranica ; Volume 12, Issue 1 , 2005 , Pages 90-98 ; 10263098 (ISSN) Shadrokh, S ; Kianfar, F ; Sharif University of Technology
    Sharif University of Technology  2005
    Abstract
    In this paper, a genetic algorithm for solving a class of project scheduling problems, called Resource Investment Problems, is presented. Tardiness of the project is permitted with a defined penalty. The decision variables are the level of resources and the start times of the activities. The objective is to minimize the sum of resources and delay penalty costs, subject to the activities' precedence relations and some other constraints. A revised form of the Akpan heuristic method for this problem is used to find better chromosomes. Elements of the algorithm, such as chromosome structure, unfitness function, crossover, mutation, immigration and local search operations, are explained. The...