Background & Purpose Initialization techniques are always considered as “computational-resource-free” Not true under computational expensive environment.

Slides:



Advertisements
Similar presentations
Wen-Hsiao Peng Chun-Chi Chen
Advertisements

Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Deductive and inductive methods for program synthesis Jelena Sanko, Jaan Penjam Institute of Cybernetics October 29, 2005.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
U NIVERSITY OF D ELAWARE C OMPUTER & I NFORMATION S CIENCES D EPARTMENT Mitigating the Compiler Optimization Phase- Ordering Problem using Machine Learning.
Routing in WSNs through analogies with electrostatics December 2005 L. Tzevelekas I. Stavrakakis.
Efficient Bit Allocation and CTU level Rate Control for HEVC Picture Coding Symposium, 2013, IEEE Junjun Si, Siwei Ma, Wen Gao Insitute of Digital Media,
Developments on Shape Optimization at CIMNE October Advanced modelling techniques for aerospace SMEs.
DAN SHMIDT ITAY BITTAN Advanced Topics in Evolutionary Algorithms.
Department of Engineering, Control & Instrumentation Research Group 22 – Mar – 2006 Optimisation Based Clearance of Nonlinear Flight Control Laws Prathyush.
Two-Dimensional Channel Coding Scheme for MCTF- Based Scalable Video Coding IEEE TRANSACTIONS ON MULTIMEDIA,VOL. 9,NO. 1,JANUARY Yu Wang, Student.
Security-Driven Heuristics and A Fast Genetic Algorithm for Trusted Grid Job Scheduling Shanshan Song, Ricky Kwok, and Kai Hwang University of Southern.
Genetic Algorithms in Materials Processing N. Chakraborti Department of Metallurgical & Materials Engineering Indian Institute of Technology Kharagpur.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Genetically optimized face image CAPTCHA
Resource Allocation Problem Reporter: Wang Ching Yu Date: 2005/04/07.
UNIVERSITY OF JYVÄSKYLÄ Resource Discovery in Unstructured P2P Networks Distributed Systems Research Seminar on Mikko Vapa, research student.
1 Incentive-Based Scheduling for Market-Like Computational Grids Lijuan Xiao, Yanmin Zhu, Member, IEEE, Lionel M. Ni, Fellow, IEEE, and Zhiwei Xu, Senior.
Differential Evolution Hossein Talebi Hassan Nikoo 1.
1 PSO-based Motion Fuzzy Controller Design for Mobile Robots Master : Juing-Shian Chiou Student : Yu-Chia Hu( 胡育嘉 ) PPT : 100% 製作 International Journal.
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
© Janice Regan, CMPT 128, Feb CMPT 128: Introduction to Computing Science for Engineering Students Running Time Big O Notation.
Project Mentor – Prof. Alan Kaminsky
Introduction Due to the recent advances in smart grid as well as the increasing dissemination of smart meters, the electricity usage of every moment in.
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.
Grant Dick Department of Information Science, School of Business, University of Otago, Dunedin, NZ 21/11/2009Australasian.
Multimodal Optimization (Niching) A/Prof. Xiaodong Li School of Computer Science and IT, RMIT University Melbourne, Australia
Constrained Evolutionary Optimization Yong Wang Associate Professor, PhD School of Information Science and Engineering, Central South University
CS440 Computer Science Seminar Introduction to Evolutionary Computing.
COMPARISON BETWEEN SINGLE AND MULTI OBJECTIVE GENETIC ALGORITHM APPROACH FOR OPTIMAL STOCK PORTFOLIO SELECTION Authors:Cvörnjek Nejc Brezocnik Miran Jagric.
Chih-Ming Chen, Student Member, IEEE, Ying-ping Chen, Member, IEEE, Tzu-Ching Shen, and John K. Zao, Senior Member, IEEE Evolutionary Computation (CEC),
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
User Cooperation via Rateless Coding Mahyar Shirvanimoghaddam, Yonghui Li, and Branka Vucetic The University of Sydney, Australia IEEE GLOBECOM 2012 &
Effect of Modified Permutation Encoding Mutation in Genetic Algorithm Sandeep Bhowmik Archana Jha Sukriti Sinha Department of Computer Science & Engineering,
Christoph F. Eick: Using EC to Solve Transportation Problems Transportation Problems.
HPDC 2013 Taming Massive Distributed Datasets: Data Sampling Using Bitmap Indices Yu Su*, Gagan Agrawal*, Jonathan Woodring # Kary Myers #, Joanne Wendelberger.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
Optimal Component Analysis Optimal Linear Representations of Images for Object Recognition X. Liu, A. Srivastava, and Kyle Gallivan, “Optimal linear representations.
1 Effect of Spatial Locality on An Evolutionary Algorithm for Multimodal Optimization EvoNum 2010 Ka-Chun Wong, Kwong-Sak Leung, and Man-Hon Wong Department.
2/29/20121 Optimizing LCLS2 taper profile with genetic algorithms: preliminary results X. Huang, J. Wu, T. Raubenhaimer, Y. Jiao, S. Spampinati, A. Mandlekar,
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Optimization Problems
Particle Swarm Optimization Using the HP Prime Presented by Namir Shammas 1.
Typing Pattern Authentication Techniques 3 rd Quarter Luke Knepper.
1 Random Disambiguation Paths Al Aksakalli In Collaboration with Carey Priebe & Donniell Fishkind Department of Applied Mathematics and Statistics Johns.
Multiobjective Optimization for Locating Multiple Optimal Solutions of Nonlinear Equation Systems and Multimodal Optimization Problems Yong Wang School.
1 Planning Base Station and Relay Station Locations in IEEE j Multi-hop Relay Networks Yang Yu, Seán Murphy, Liam Murphy Department of Computer Science.
An Introduction to Simulated Annealing Kevin Cannons November 24, 2005.
Selection and Recombination Temi avanzati di Intelligenza Artificiale - Lecture 4 Prof. Vincenzo Cutello Department of Mathematics and Computer Science.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Advanced AI – Session 6 Genetic Algorithm By: H.Nematzadeh.
Constrained Optimization by the  Constrained Differential Evolution with an Archive and Gradient-Based Mutation Tetsuyuki TAKAHAMA ( Hiroshima City University.
1 A genetic algorithm with embedded constraints – An example on the design of robust D-stable IIR filters 潘欣泰 國立高雄大學 資工系.
On the Computation of All Global Minimizers Through Particle Swarm Optimization IEEE Transactions On Evolutionary Computation, Vol. 8, No.3, June 2004.
Optimizing Interconnection Complexity for Realizing Fixed Permutation in Data and Signal Processing Algorithms Ren Chen, Viktor K. Prasanna Ming Hsieh.
Swarm Intelligence By Nasser M..
Cost Effectively Deploying of Relay Stations (RS) in IEEE 802
Differential Evolution (DE) and its Variant Enhanced DE (EDE)
The 2st Chinese Workshop on Evolutionary Computation and Learning
Yong Wang Associate Professor, Ph.D.
USING MICROBIAL GENETIC ALGORITHM TO SOLVE CARD SPLITTING PROBLEM.
Differential Evolution
C.-S. Shieh, EC, KUAS, Taiwan
Who cares about implementation and precision?
Evolution strategies Can programs learn?
“Hard” Optimization Problems
Chen-Yu Lee, Jia-Fong Yeh, and Tsung-Che Chiang
Optimizing Energy Consumption in Wireless Sensor
Applications of Genetic Algorithms TJHSST Computer Systems Lab
Unconstraint Optimal Selection of Side Information for Histogram Shifting Based Reversible Data Hiding Source:  IEEE Access. March, doi: /ACCESS
Presentation transcript:

Background & Purpose Initialization techniques are always considered as “computational-resource-free” Not true under computational expensive environment where single FE costs a lot Optimally allocate the limited computational resources becomes important Optimal Computational Resource Allocation Problem (OCRAP): Under given amount of computational resources (R), objective function of the base problem (f), initialization technique (IniT) and optimization algorithm (OA), to find an resource allocation scheme (RA=IniR/(IniR+OptR)) where IniR and OptR are the resources consumed by IniT and OA so that either the optimal solution (y=y*) of the objective function (y=f(x)) is achieved with the least total resources (IniR+OptR<R) or the best suboptimal solution (y!=y*) is achieved when resources are used up (IniR+OptR=R). Computational resource is defined as number of FE used under computational expensive environment. Due to the extreme long time required by FE, other calculations are negligible. Problem Formulation: General version: Simulation version: Simulation results Notations & settings: M1: without considering IniR M2: IniR considered M3 = r_init/r_rand, the ratio between results from using IniT and using PRNG. M3<1 means IniT better M3>1 means PRNG better D=10,30 & 100; MaxFE(R)=50*D; No. of run=50 Comparison between IniR considered and not considered: Simulation cases Initialization techniques: Pseudo Random Number Generator (PRNG) Opposition-Based Learning (OBL) [1] Quasi-Opposition-Based Learning (QOBL) [2] Quadratic Interpolation (QI) [3] Optimization algorithms: Differential Evolution (DE) [4] Chemical Reaction Optimization (CRO) [5] Benchmark functions: CEC14 computational expensive problem set Metrics: Without IniR considered (traditional way) Considering IniR Solve the OCRAP Reference [1] S. Rahnamayan, H. Tizhoosh, and M. Salama, “Opposition-based differential evolution,” Evolutionary Computation, IEEE Transactions on, vol. 12, no. 1, pp. 64–79, Feb [2] S. Rahnamayan, H. Tizhoosh, and M. Salama, “Quasi-oppositional differential evolution,” in Evolutionary Computation, CEC IEEE Congress on, Sept 2007, pp. 2229–2236. [3] M. Pant, M. Ali, and V. Singh, “Differential evolution using quadratic interpolation for initializing the population,” in Advance Computing Conference, IACC IEEE International, March 2009, pp. 375–380. [4] R. Storn and K. Price, “Differential evolution-a simple and efficient adaptive scheme for global optimization over continuous spaces,” 1995 [5] A. Lam, V. Li, and J. Yu, “Real-coded chemical reaction optimization,” Evolutionary Computation, IEEE Transactions on, vol. 16, no. 3, pp. 339–353, June Some curves Using QI with DE to test different RA ratios Comparing QI, OBL under different RA Conclusion Formulate and solve the optimal computational resource allocation problem Define the computational resource under the expensive environment Conduct simulations analyze performances from different initialization techniques