Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Channel Assignment using Chaotic Simulated Annealing Enhanced Hopfield Neural.

Slides:



Advertisements
Similar presentations
Algorithm Design Methods (I) Fall 2003 CSE, POSTECH.
Advertisements

Algorithm Design Methods Spring 2007 CSE, POSTECH.
Locally Optimal Takagi-Sugeno Fuzzy Controllers Amir massoud Farahmand Mohammad javad Yazdanpanah Department of Electrical.
13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
Neural and Evolutionary Computing - Lecture 4 1 Random Search Algorithms. Simulated Annealing Motivation Simple Random Search Algorithms Simulated Annealing.
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
Simulated Annealing Student (PhD): Umut R. ERTÜRK Lecturer : Nazlı İkizler Cinbiş
Kuang-Hao Liu et al Presented by Xin Che 11/18/09.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
1 Approximate Solution to an Exam Timetabling Problem Adam White Dept of Computing Science University of Alberta Adam White Dept of Computing Science University.
1 Cross-Layer Design for Wireless Communication Networks Ness B. Shroff Center for Wireless Systems and Applications (CWSA) School of Electrical and Computer.
[1][1][1][1] Lecture 5-7: Cell Planning of Cellular Networks June 22 + July 6, Introduction to Algorithmic Wireless Communications David Amzallag.
Trading optimality for speed…
1 Cell Planning of 4G Cellular Networks David Amzallag Computer Science Department, Technion Joint work with Roee Engelberg (Technion), Seffi Naor (Microsoft.
© P. Pongcharoen ISA/1 Applying Designed Experiments to Optimise the Performance of Genetic Algorithms for Scheduling Capital Products P. Pongcharoen,
© J. Christopher Beck Lecture 22: Local Search for Sports Scheduling.
Ant Colony Optimization: an introduction
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
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.
Constrained Green Base Station Deployment with Resource Allocation in Wireless Networks 1 Zhongming Zheng, 1 Shibo He, 2 Lin X. Cai, and 1 Xuemin (Sherman)
Internet Engineering Czesław Smutnicki Discrete Mathematics – Location and Placement Problems in Information and Communication Systems.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
Hybrid Behavior Co-evolution and Structure Learning in Behavior-based Systems Amir massoud Farahmand (a,b,c) (
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
Rensselaer Polytechnic Institute Rajagopal Iyengar Combinatorial Approaches to QoS Scheduling in Multichannel Wireless Systems Rajagopal Iyengar Rensselaer.
Search Methods An Annotated Overview Edward Tsang.
Simultaneous Recurrent Neural Networks for Static Optimization Problems By: Amol Patwardhan Adviser: Dr. Gursel Serpen August, 1999 The University of.
Base Station Location and Service Assignment in W-CDMA Networks Joakim Kalvenes 1 Jeffery Kennington 2 Eli Olinick 2 Southern Methodist University 1 Edwin.
Sports Scheduling Written by Kelly Easton, George Nemhauser, Michael Trick Presented by Matthew Lai.
Optimization with Neural Networks Presented by: Mahmood Khademi Babak Bashiri Instructor: Dr. Bagheri Sharif University of Technology April 2007.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Artificial Intelligence for Games Online and local search
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm Kok-Hua Loh University of Maryland Bruce Golden University.
1 SYNTHESIS of PIPELINED SYSTEMS for the CONTEMPORANEOUS EXECUTION of PERIODIC and APERIODIC TASKS with HARD REAL-TIME CONSTRAINTS Paolo Palazzari Luca.
Adaptive Hopfield Network Gürsel Serpen Dr. Gürsel Serpen Associate Professor Electrical Engineering and Computer Science Department University of Toledo.
Ant Algorithm and its Applications for Solving Large Scale Optimization Problems on Parallel Computers Stefka Fidanova Institute for Information and Communication.
A local search algorithm with repair procedure for the Roadef 2010 challenge Lauri Ahlroth, André Schumacher, Henri Tokola
Managerial Economics Linear Programming Aalto University School of Science Department of Industrial Engineering and Management January 12 – 28, 2016 Dr.
CSCE350 Algorithms and Data Structure Lecture 21 Jianjun Hu Department of Computer Science and Engineering University of South Carolina
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Urban Planning Group Implementation of a Model of Dynamic Activity- Travel Rescheduling Decisions: An Agent-Based Micro-Simulation Framework Theo Arentze,
On the Ability of Graph Coloring Heuristics to Find Substructures in Social Networks David Chalupa By, Tejaswini Nallagatla.
Local search algorithms In many optimization problems, the path to the goal is irrelevant; the goal state itself is the solution State space = set of "complete"
Intelligent Numerical Computation1 MFA for constrained optimization  Mean field annealing  Overviews  Graph bisection problem  Traveling salesman problem.
Scientific Research Group in Egypt (SRGE)
Base Station Location and
Managerial Economics Linear Programming
Heuristic Optimization Methods
Goal We present a hybrid optimization approach for solving global optimization problems, in particular automated parameter estimation models. The hybrid.
Algorithm Design Methods
Opracowanie językowe dr inż. J. Jarnicki
Syed Hussain Ali, Member, IEEE Victor C. M. Leung, Fellow, IEEE
ME 521 Computer Aided Design 15-Optimization
Babak Sorkhpour, Prof. Roman Obermaisser, Ayman Murshed
Recurrent Neural Networks
Multi-Objective Optimization for Topology Control in Hybrid FSO/RF Networks Jaime Llorca December 8, 2004.
Exam 2 LZW not on syllabus. 73% / 75%.
Multi-Objective Optimization
“Hard” Optimization Problems
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’
EMIS 8373: Integer Programming
ZEIT4700 – S1, 2016 Mathematical Modeling and Optimization
Algorithm Design Methods
Algorithm Design Methods
CSC 380: Design and Analysis of Algorithms
CHANNEL ASSIGNMENT IN MOBILE NETWORKS USING NEURAL NETWORKS
Algorithm Design Methods
Presentation transcript:

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Channel Assignment using Chaotic Simulated Annealing Enhanced Hopfield Neural Network Amir massoud Farahmand (a,b) Mohammad Javad Yazdanpanah (b) a) Department of Computing Science, University of Alberta b) Department of Electrical and Computer Engineering, University of Tehran

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Your Big Company Suppose that you have a mobile communication company and want you to earn money as much as possible. You want to service to your costumers in a large geographical space, e.g. Vancouver. You need to assign a unique frequency channel to each costumer (e.g MHz to MHz). The problem is that you only have a limited frequency range (e.g. 869MHz - 894MHz for downlink in Canada).

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Cells and Interference Divide the region to smaller sub- regions (cells). You have the whole frequency range for each cell. The Problem of Interference

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Channel Assignment Problem Channel assignment problem is a common problem in cellular telecommunication. Resources: frequency channels and cells. Sources of Interference: –Interference between adjacent cells Dominant for frequency-close channels. –Interference between two frequency channels in the same cell. Goal: assign channels in order to maximize the utilization of the network while minimizing the interference. This problem is a instance of a combinatorial optimization problem. –NP-Hard! N=21 (Cells number)

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Example cells channels Demands Compatibility matrix (shows the severity of the interference)

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Example cells channels Demands Compatibility matrix (shows the severity of the interference)

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Combinatorial Optimization Problem

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Combinatorial Optimization Problem (Samples) Traveling Salesman Problem –VLSI Connection Optimization Job Scheduling –Postal Delivery –Car Sequencing Channel Assignment Problem

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network How to Solve a COP? Search all space?! –Infeasible for large problems. Approximately solve it –Different heuristics –Meta-heuristics Simulated Annealing Tabu Search Evolutionary Computation Methods Hopfield Neural Networks

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Hopfield N.N. for COP Lyapunov function Hopfield NN minimizes this Lyapunov function.

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Hopfield N.N. for COP Difficulties Infeasible solutions –Solutions that do not satisfy constraints Energy function is strictly decreasing –Local minima dilemma Solutions Hill-Climbing methods to escape from local minima –Simulated Annealing noise –Chaotic noise Forcing constraints –Force lying in constraint plane

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Example of Trapping in a Local Minimum

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Main Idea Inject chaotic noise to enhance the searching capability of the network –Decay the noise gradually –Reset the noise to its full power several times Force constraints explicitly

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network The Network Dynamics

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Hopfield N.N. Formulation of Channel Assignment Problem

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Experiments

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Experiments

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Experiments

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Conclusions Hopfield NN with chaotic injected noise and forcing constraints as external inputs can solve COP very well.

Channel Assignment using Chaotic Simulated Annealing Enhanced Neural Network Suggestions for Further Research Applying this method to other COP Investigating the effect of parameters to the quality of solutions –Is it robust to parameters method? Comparing with other chaotification methods Use network’s state information to change the amount of chaotic noise injected to the network adaptively (progress estimator) Hardware implementation