Application of Heuristics and Meta-Heuristics Scheduling: Job Shop Scheduling Parallel Dedicated Machine (PDS1) Single machine minimize total tardiness.

Slides:



Advertisements
Similar presentations
Lect.3 Modeling in The Time Domain Basil Hamed
Advertisements

Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Acoustic design by simulated annealing algorithm
CHAPTER 8 A NNEALING- T YPE A LGORITHMS Organization of chapter in ISSO –Introduction to simulated annealing –Simulated annealing algorithm Basic algorithm.
Gizem ALAGÖZ. Simulation optimization has received considerable attention from both simulation researchers and practitioners. Both continuous and discrete.
Date:2011/06/08 吳昕澧 BOA: The Bayesian Optimization Algorithm.
Spring, 2013C.-S. Shieh, EC, KUAS, Taiwan1 Heuristic Optimization Methods Prologue Chin-Shiuh Shieh.
Ashish Gupta Under Guidance of Prof. B.N. Jain Department of Computer Science and Engineering Advanced Networking Laboratory.
1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.
Math443/543 Mathematical Modeling and Optimization
A Comparative Study Of Deterministic And Stochastic Optimization Methods For Integrated Design Of Processes Mario Francisco a, Silvana Revollar b, Pastora.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Ant Colony Optimization Optimisation Methods. Overview.
Planning operation start times for the manufacture of capital products with uncertain processing times and resource constraints D.P. Song, Dr. C.Hicks.
D Nagesh Kumar, IIScOptimization Methods: M1L4 1 Introduction and Basic Concepts Classical and Advanced Techniques for Optimization.
CURRENT TRENDS IN DETERMINISTIC SCHEDULING 1- Scheduling Theory 2- Search Algorithms 3- Scheduling Practice 1- Scheduling Theory 2- Search Algorithms 3-
Optimization Methods One-Dimensional Unconstrained Optimization
Quadratic Programming Model for Optimizing Demand-responsive Transit Timetables Huimin Niu Professor and Dean of Traffic and Transportation School Lanzhou.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
1 SOUTHERN TAIWAN UNIVERSITY ELECTRICAL ENGINEERING DEPARTMENT Gain Scheduler Middleware: A Methodology to Enable Existing Controllers for Networked Control.
Stochastic Approximation and Simulated Annealing Lecture 8 Leonidas Sakalauskas Institute of Mathematics and Informatics Vilnius, Lithuania EURO Working.
AN ITERATIVE METHOD FOR MODEL PARAMETER IDENTIFICATION 4. DIFFERENTIAL EQUATION MODELS E.Dimitrova, Chr. Boyadjiev E.Dimitrova, Chr. Boyadjiev BULGARIAN.
1 Hybrid methods for solving large-scale parameter estimation problems Carlos A. Quintero 1 Miguel Argáez 1 Hector Klie 2 Leticia Velázquez 1 Mary Wheeler.
A Framework for Distributed Model Predictive Control
Australian Journal of Basic and Applied Sciences, 5(11): , 2011 ISSN Monte Carlo Optimization to Solve a Two-Dimensional Inverse Heat.
1 Paper Review for ENGG6140 Memetic Algorithms By: Jin Zeng Shaun Wang School of Engineering University of Guelph Mar. 18, 2002.
Book Adaptive control -astrom and witten mark
CHAPTER 4 S TOCHASTIC A PPROXIMATION FOR R OOT F INDING IN N ONLINEAR M ODELS Organization of chapter in ISSO –Introduction and potpourri of examples Sample.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Department of Electrical Engineering, Southern Taiwan University Robotic Interaction Learning Lab 1 The optimization of the application of fuzzy ant colony.
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
1 Chapter 5 Advanced Search. 2 Chapter 5 Contents l Constraint satisfaction problems l Heuristic repair l The eight queens problem l Combinatorial optimization.
(Particle Swarm Optimisation)
INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY, P.P , MARCH An ANFIS-based Dispatching Rule For Complex Fuzzy Job Shop Scheduling.
Overview Particle filtering is a sequential Monte Carlo methodology in which the relevant probability distributions are iteratively estimated using the.
Sensorless Sliding-Mode Control of Induction Motors Using Operating Condition Dependent Models 教 授: 王明賢 學 生: 謝男暉 南台科大電機系.
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
Doshisha Univ., Kyoto, Japan CEC2003 Adaptive Temperature Schedule Determined by Genetic Algorithm for Parallel Simulated Annealing Doshisha University,
CHAPTER 5 S TOCHASTIC G RADIENT F ORM OF S TOCHASTIC A PROXIMATION Organization of chapter in ISSO –Stochastic gradient Core algorithm Basic principles.
Mathematical Models & Optimization?
1 Optical Packet Switching Techniques Walter Picco MS Thesis Defense December 2001 Fabio Neri, Marco Ajmone Marsan Telecommunication Networks Group
Resource Mapping and Scheduling for Heterogeneous Network Processor Systems Liang Yang, Tushar Gohad, Pavel Ghosh, Devesh Sinha, Arunabha Sen and Andrea.
Taguchi. Abstraction Optimisation of manufacturing processes is typically performed utilising mathematical process models or designed experiments. However,
O PTIMAL SERVICE TASK PARTITION AND DISTRIBUTION IN GRID SYSTEM WITH STAR TOPOLOGY G REGORY L EVITIN, Y UAN -S HUN D AI Adviser: Frank, Yeong-Sung Lin.
Vaida Bartkutė, Leonidas Sakalauskas
Local Search and Optimization Presented by Collin Kanaley.
Speed-Sensorless Estimation for Induction motors using Extended Kalman Filters 教 授: 龔應時 學 生: 楊政達 Murat Barut; Seta Bogosyan; Metin Gokasan; Industrial.
Local search algorithms In many optimization problems, the state space is the space of all possible complete solutions We have an objective function that.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
CONTENTS: 1.Abstract. 2.Objective. 3.Block diagram. 4.Methodology. 5.Advantages and Disadvantages. 6.Applications. 7.Conclusion.
Resource Allocation in Hospital Networks Based on Green Cognitive Radios 王冉茵
A study of simulated annealing variants Ana Pereira Polytechnic Institute of Braganca, Portugal Edite Fernandes University of Minho,
Discriminative Training and Machine Learning Approaches Machine Learning Lab, Dept. of CSIE, NCKU Chih-Pin Liao.
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
1 Tom Edgar’s Contribution to Model Reduction as an introduction to Global Sensitivity Analysis Procedure Accounting for Effect of Available Experimental.
Department of Electrical Engineering, Southern Taiwan University 1 Robotic Interaction Learning Lab The ant colony algorithm In short, domain is defined.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
Heuristic Optimization Methods
SOUTHERN TAIWAN UNIVERSITY ELECTRICAL ENGINEERING DEPARTMENT
C.-S. Shieh, EC, KUAS, Taiwan
Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs
metaheuristic methods and their applications
Xin-She Yang, Nature-Inspired Optimization Algorithms, Elsevier, 2014.
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
The use of Neural Networks to schedule flow-shop with dynamic job arrival ‘A Multi-Neural Network Learning for lot Sizing and Sequencing on a Flow-Shop’
Market-based Dynamic Task Allocation in Mobile Surveillance Systems
Dr. Arslan Ornek MATHEMATICAL MODELS
Presentation transcript:

Application of Heuristics and Meta-Heuristics Scheduling: Job Shop Scheduling Parallel Dedicated Machine (PDS1) Single machine minimize total tardiness Knapsack Problem Routing: Traveling Salesman Problem Vehicle Routing Problem

Application of Heuristics and Meta-Heuristics Mechanical Applications: Simulated Annealing PC Board Layout (Cagan) –Minimize footprint –Constrained by heat transfer Genetic Algorithms Robotic path planning (Sturges and Rubin)

Application of Heuristics and Meta-Heuristics Other Applications: Title: Submarine manoeuvring controllers’ optimisation using simulated annealing and genetic algorithms. Abstract: This paper is concerned with non-linear controller parameter optimisation for the diving and heading motions of a submarine model. The structure of the non-linear controllers used for these manoeuvres is derived from Sliding Mode control theory for decoupled single input, single output systems. The performance of these controllers depends on key design parameters. In this comparative study the values of these controller parameters are optimised using three different optimisation techniques. These are simulated annealing, segmented simulated annealing and genetic algorithms. The search properties of these algorithms are defined and compared in terms of simulated time domain results, convergence and saturation properties. These results are used to show the advantages and disadvantages of each optimisation technique.

Application of Heuristics and Meta-Heuristics Other Applications – Title: Sampling schedule design towards optimal drug monitoring for individualizing therapy. Abstract: We study the individualization of therapy by simultaneously taking into account the design of sampling schedule and optimal therapeutic drug monitoring. The sampling schedule design in this work is to determine the number of samples, the sampling times, the switching time from the loading to the maintenance period, and the drug dosages. A closed-loop control policy is employed to determine the sampling schedule, and an advanced stochastic global optimization algorithm, which integrates the stochastic approximation and simulated annealing techniques, is implemented to search the optimal sampling schedule. A simulated one-compartment model of intravenous theophylline therapy is used to illustrate our method. This method can be readily extended to multiple compartment systems and allow incorporating other criteria of drug control. While currently the method is mainly of theoretical interest, it offers a starting point for practical applications and thus is hopefully of great value for the clinically individualizing therapy in the future.

Application of Heuristics and Meta-Heuristics Other Applications – Title: Distribution Network Reconfiguration for Loss Reduction by Hybrid Differential Evolution. Abstract: This article introduces a hybrid differential evolution (HDE) method for dealing with optimal network reconfiguration aiming at power loss reduction. The network reconfiguration of distribution systems is to recognize beneficial load transfers so that the objective function composed of power losses is minimized and the prescribed voltage limits are satisfied. The proposed method determines the proper system topology that reduces the power loss according to a load pattern. Mathematically, the problem of this research is a nonlinear programming problem with integer variables. This article presents a new approach that employs the HDE algorithm with integer variables to solve the problem. One three-feeder distribution system from the literature and one practical distribution network of Taiwan Power Company are used to exemplify the performance of the proposed method. Two other methods, the genetic algorithm and the simulated annealing, are also employed to solve the problem. Numerical results show that the proposed method is better than the other two methods.

Application of Heuristics and Meta-Heuristics Other Applications – Title: A comparative study of markovian and variational image-matching techniques in application to mammograms. Abstract: In this paper, we focus our interest on the image-matching problem. This major problem in Image Processing has received a considerable attention in the last decade. However, contrarily to other image-processing problems such as image restoration, the image-matching problem have been mainly tackled using a single approach based on variational principles. In this paper, our motivation is to investigate the feasibility of another famous image-processing approach based on Markov random fields (MRF). For that, we propose a discrete and stochastic image-matching framework which is equivalent to an usual variational one and suitable for an MRF-based approach. In this framework, we describe multigrid implementations of two algorithms: an iterated conditional modes (ICM) and a simulated annealing. We apply these algorithms for the registration of mammograms and compare their performances to those of an usual variational algorithm. We come to the conclusion that MRF-based techniques are optimization techniques which are relevant for the mammogram application. We also point out some of their specific properties and mention interesting perspectives offered by the markovian approach.

Application of Heuristics and Meta-Heuristics Other Applications – Title: Optimization of Three-Phase Induction Motor Design Using Simulated Annealing Algorithm. Abstract: Three-phase induction motors are designed to meet various special requirements. Irrespective of these requirements, the basic conditions to be fulfilled are (1) The starting torque must be high, and (2) Operating efficiency and power factor must be as high as feasible. This article discusses the formulation of design optimization of three-phase induction motor as a nonlinear multivariable programming problem to meet the above requirements. Three different objective functions were considered. The simulated annealing algorithm was used to obtain an optimum design. The algorithm was implemented on three test motors and the results indicate that the method has yielded a global optimum. The proposed algorithm results are compared with the conventional design results to select a suitable optimal design of the induction motor. The performance of the motor is found to improve with application of this algorithm.

Application of Heuristics and Meta-Heuristics Other Applications – Title: A simulated annealing applied for optimizing a voice- multihop radio network. Abstract: In this paper, we use a variant of the simulated annealing algorithm for solving the optimization of admission control in a voice-multihop radio network problem. The performance measure we consider is the call blocking probabilities. This variant of the simulated annealing uses constant temperature. The standard clock simulation technique is used to get estimates of performance measures of several policies simultaneously. This results in decreasing the required simulation time. The simulation results indicate that this algorithm can locate an optimal or a near optimal solution quickly.

Application of Heuristics and Meta-Heuristics Believe it or not: Title: Structure, epitope mapping, and docking simulation of a gibberellin mimic peptide as a peptidyl mimotope for a hydrophobic ligand.

Application of Heuristics and Meta-Heuristics Let’s hear from Option C term project students