Bjarne Berg UNC-Charlotte

Slides:



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

Diversity Maximization Under Matroid Constraints Date : 2013/11/06 Source : KDD’13 Authors : Zeinab Abbassi, Vahab S. Mirrokni, Mayur Thakur Advisor :
Traveling Salesperson Problem
University of Minnesota 1 Exploiting Page-Level Upper Bound (PLUB) for Multi-Type Nearest Neighbor (MTNN) Queries Xiaobin Ma Advisor: Shashi Shekhar Dec,
Multi-Objective Optimization NP-Hard Conflicting objectives – Flow shop with both minimum makespan and tardiness objective – TSP problem with minimum distance,
1 The use of Heuristics in the Design of GPS Networks Peter Dare and Hussain Saleh School of Surveying University of East London Longbridge Road Dagenham,
S. J. Shyu Chap. 1 Introduction 1 The Design and Analysis of Algorithms Chapter 1 Introduction S. J. Shyu.
Lab Order [Title – name and period] Objective: Pre Lab: Materials: Procedures: Data Table: Calculations: Graph: Conclusion:
The Min-Max Split Delivery Multi- Depot Vehicle Routing Problem with Minimum Delivery Amounts X. Wang, B. Golden, and E. Wasil INFORMS San Francisco November.
Two-Level Logic Synthesis -- Heuristic Method (ESPRESSO)
1 Greedy Randomized Adaptive Search and Variable Neighbourhood Search for the minimum labelling spanning tree problem Kuo-Hsien Chuang 2008/11/05.
On the Task Assignment Problem : Two New Efficient Heuristic Algorithms.
Coping with Variability in Dynamic Routing Problems Tom Van Woensel (TU/e) Christophe Lecluyse (UA), Herbert Peremans (UA), Laoucine Kerbache (HEC) and.
A model for combination of set covering and network connectivity in facility location Rana Afzali and Shaghayegh Parhizi.
A framework For Community Identification in Dynamic Social Networks Chayant, Tanya Berger-Wolf, David Kempe [KDD’07] Advisor : Dr. Koh Jia-Ling Advisor.
Miao Zhao, Ming Ma and Yuanyuan Yang
1 11 Subcarrier Allocation and Bit Loading Algorithms for OFDMA-Based Wireless Networks Gautam Kulkarni, Sachin Adlakha, Mani Srivastava UCLA IEEE Transactions.
June 21, 2007 Minimum Interference Channel Assignment in Multi-Radio Wireless Mesh Networks Anand Prabhu Subramanian, Himanshu Gupta.
GRASP: A Sampling Meta-Heuristic
MODELING AND ANALYSIS OF MANUFACTURING SYSTEMS Session 12 MACHINE SETUP AND OPERATION SEQUENCING E. Gutierrez-Miravete Spring 2001.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Introduction to Design and Manufacture Supply Chain Analysis (K. Khammuang & H. S. Gan) A scientific approach to decision making, which seeks to.
Deployment Strategy for Mobile Robots with Energy and Timing Constraints Yongguo Mei, Yung-Hsiang Lu, Y. Charlie Hu, and C.S. George Lee School of Electrical.
Agenda Introduction: Objectives and Purpose 2. Homework 3. Science Fair Problem Hypothesis Variables Independent Dependent Controlled 4.
OTHER LOCATION METHODS Dr. Ron Lembke. P-Median Problem Minimize average weighted distance to customers, when locating P facilities, where P>=1. Can consider.
Boolean Minimizer FC-Min: Coverage Finding Process Petr Fišer, Hana Kubátová Czech Technical University Department of Computer Science and Engineering.
For Wednesday No reading No homework There will be homework for Friday, as well the program being due – plan ahead.
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
Scheduling Optimization in Wireless MESH Networks with Power Control and Rate Adaptation SECON 2006 Antonio Capone and Giuliana Carello Keon Jang 2007.
ICS 252 Introduction to Computer Design Lecture 10 Winter 2004 Eli Bozorgzadeh Computer Science Department-UCI.
The Colorful Traveling Salesman Problem Yupei Xiong, Goldman, Sachs & Co. Bruce Golden, University of Maryland Edward Wasil, American University Presented.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition.
The Scientific Method. The Basic Steps l State the problem l Form a hypothesis l Test the hypothesis l Draw conclusions.
Arithmetic Test Pattern Generation: A Bit Level Formulation of the Optimization Problem S. Manich, L. García and J. Figueras.
1 Solving the Open Vehicle Routing Problem: New Heuristic and Test Problems Feiyue Li Bruce Golden Edward Wasil INFORMS San Francisco November 2005.
Title Authors Introduction Text, text, text, text, text, text Background Information Text, text, text, text, text, text Observations Text, text, text,
A Two-Phase Linear programming Approach for Redundancy Problems by Yi-Chih HSIEH Department of Industrial Management National Huwei Institute of Technology.
1 TCOM 5143 Lecture 10 Centralized Networks: Time Delay and Cost Tradeoffs.
Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.
Introductory material Jonathan Godfrey.
TITLE OF YOUR PROJECT. INTRODUCTION Type here about your science fair project Why you are interested in working on this idea. Why you think your project.
The Computerized Routing of Meter Readers over Street Networks: New Technologies Turn Old Problems into New Opportunities by Robert Shuttleworth, University.
Science Experiment by Name or Names Question: How does _____ affect _______?
ICS 252 Introduction to Computer Design Lecture 8- Heuristics for Two-level Logic Synthesis Winter 2005 Eli Bozorgzadeh Computer Science Department-UCI.
CS 721 Project Implementation of Hypergraph Edge Covering Algorithms By David Leung ( )
On the Ability of Graph Coloring Heuristics to Find Substructures in Social Networks David Chalupa By, Tejaswini Nallagatla.
Management Science 461 Lecture 4b – P-median problems September 30, 2008.
EE465: Introduction to Digital Image Processing
Introduction Intro Problem Materials Hypothesis Procedure Results
Local Container Truck Routing Problem with its Operational Flexibility Kyungsoo Jeong, Ph.D. Candidate University of California, Irvine Local container.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition Mjdah Al Shehri.
BACK SOLUTION:
ICS 252 Introduction to Computer Design
What Visualization can do for Data Clustering?
ISEN 601 Location Logistics
Pseudo-Boolean Optimization
Unit-4: Dynamic Programming
Unitary method.
ISEN 601 Location Logistics
Generating and Solving Very Large-Scale Vehicle Routing Problems
Algorithm Design Methods
ICS 252 Introduction to Computer Design
X y y = x2 - 3x Solutions of y = x2 - 3x y x –1 5 –2 –3 6 y = x2-3x.
ACM Symposium on Parallel Algorithms and
Chapter 1 Introduction.
Introduction Hamdy A. Taha, Operations Research: An introduction, 8th Edition Mjdah Al Shehri.
The Scientific Method.
NBA Scheduling May 2, 2019 Mitch Gaiser, Alex Carvalho,
Algorithms Lecture # 26 Dr. Sohail Aslam.
Algorithms Lecture # 25 Dr. Sohail Aslam.
Presentation transcript:

Bjarne Berg UNC-Charlotte A Minimum Expected Response Model - Formulation, Heuristic Solution and Application by Dr. Cem Saydam and Dr. Hari Rajagopalan Bjarne Berg UNC-Charlotte

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

Introduction As The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

The Models – MERLP-1 Variables: Conversly The

The Models – MERLP-1 Minimize: Subject to: The

The Models – MERLP-2 Variables: The

The Models – MERLP-2 Minimize: Subject to: The

Reactive Tabu Search procedure sdf The

Greedy Search Algorithm sdf The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

Solution Algorithm As The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

Application to Charlotte Mecklenburg County data As The

Application to Charlotte Mecklenburg County data As The

Application to Charlotte Mecklenburg County data As The

Average Distance Travelled As The

Application to Charlotte Mecklenburg County data As The

Application to Charlotte Mecklenburg County data As The

Application to Charlotte Mecklenburg County data As The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

Conclusions As The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

Some Observations As The

What We’ll Cover … Introduction The Models The Solution Algorithm Application to Charlotte Mecklenburg County data Conclusions Some Observations 7 Key Points to Take Home

7 Key Points to Take Home If

Your Turn!