Intelligent Tools for Techno- Economic Modelling and Network Design Tim Glover Chris Voudouris Anthony Conway Edward Tsang Ali Rais Shaghaghi Michael Kampouridis.

Slides:



Advertisements
Similar presentations
Greening Backbone Networks Shutting Off Cables in Bundled Links Will Fisher, Martin Suchara, and Jennifer Rexford Princeton University.
Advertisements

Load Management System with Intermittent Power on the Grid Ruth Kemsley CEng MIMechE MIEE Econnect Ventures Ltd.
Grow fast with Location Intelligence Know. Connect. Grow.
Heuristic Search techniques
Get Started in e-Business. Aim This presentation is prepared to support and give a general overview of the ‘How to Get Started in e-Business’ Guide and.
G5BAIM Artificial Intelligence Methods
July 6th1 “Laying the foundations for Growth” “Connecting Nottingham” NextGen Roadshow - Nottingham.
NetWORKS Strategy Manugistics NetWORKS Strategy 6.2.
Alexei A. Gaivoronski IIASA, Workshop on Coping with Uncertainty, Stochastic optimization and modeling of network risk and uncertainty:
SBSE Course 3. EA applications to SE Analysis Design Implementation Testing Reference: Evolutionary Computing in Search-Based Software Engineering Leo.
Traffic Engineering With Traditional IP Routing Protocols
1 Optimisation Although Constraint Logic Programming is somehow focussed in constraint satisfaction (closer to a “logical” view), constraint optimisation.
Placement of Integration Points in Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Chapter 5: Supply Chain Performance Measurement and Financial Analysis
Linear-Programming Applications
Enterprise Content Management (ECM) Simulator for Return on Investment (ROI)
Universität Dortmund  P. Marwedel, Univ. Dortmund, Informatik 12, 2003 Hardware/software partitioning  Functionality to be implemented in software.
Business Name (Logo) Team Name Names of Team Members Adopted for Created by.
Metaheuristics The idea: search the solution space directly. No math models, only a set of algorithmic steps, iterative method. Find a feasible solution.
Heuristic Search Heuristic - a “rule of thumb” used to help guide search often, something learned experientially and recalled when needed Heuristic Function.
Internet Traffic Policies and Routing Vic Grout Centre for Applied Internet Research (CAIR) University of Wales NEWI Plas Coch Campus, Mold Road Wrexham,
SYSTEM ANALYSIS AND DESIGN
Copyright R. Weber Search in Problem Solving Search in Problem Solving INFO 629 Dr. R. Weber.
Katanosh Morovat.   This concept is a formal approach for identifying the rules that encapsulate the structure, constraint, and control of the operation.
Advanced Excel for Finance Professionals A self study material from South Asian Management Technologies Foundation.
Modeling and simulation of systems Simulation optimization and example of its usage in flexible production system control.
Logistics and Systems Rabby Q. Lavilles. Supply chain is a system of organizations, people, technology, activities, information and resources involved.
An Introduction to SAS® ENTERPRISE GUIDE. Corporate Strength & Stability Reliability in a High-Risk Economy Largest Privately held software company in.
Shambhavi Srinivasa Carey Williamson Zongpeng Li Department of Computer Science University of Calgary Barrier Counting in Mixed Wireless Sensor Networks.
Search Methods An Annotated Overview Edward Tsang.
GRASP: A Sampling Meta-Heuristic
WHAT S BUSINESS PLAN  Definition: A written document describing the nature of the business, the sales and marketing strategy, and the financial background,
Sports Scheduling Written by Kelly Easton, George Nemhauser, Michael Trick Presented by Matthew Lai.
Mobile Agent Migration Problem Yingyue Xu. Energy efficiency requirement of sensor networks Mobile agent computing paradigm Data fusion, distributed processing.
Exact and heuristics algorithms
Engineering an Optimal Wind Farm Stjepan Mahulja EWEM Rotor Design : Aerodynamics s132545, th September 2015 SUPERVISORS: Gunner Chr. Larsen.
QPE A Graphical Editor for Modeling using Queueing Petri Nets Christofer Dutz.
Optimization Problems
Hub Location–Allocation in Intermodal Logistic Networks Hüseyin Utku KIYMAZ.
KNOWLEDGE MANAGEMENT UNIT II KNOWLEDGE MANAGEMENT AND TECHNOLOGY 1.
Marketing Plan.
1 Welcome John Mellis BT Laboratories Blown Fibre as a Reduced Cost Network Planning Solution.
Living With Your New IP PBX David M. Laurenson, VP Information Technology and CIO A. Finkl & Sons A.Finkl & Sons founded in 1879 HQ in Chicago World’s.
Managing ITS Assets using GIS in Silicon-Valley City of San Jose, CA Kenneth Salvail, P.E. ITE District 6 Annual Meeting July 2007, Portland Oregon.
Slide 1 Software Construction Software Construction Lecture 3.
INTELLIGENT TEST SCHEDULING TE-MPE Technical Meeting Michael Galetzka.
1 Project Selection. 2 I. Project Selection: Non-Numeric Models Sacred Cow Operating Necessity Competitive Necessity Product Line Extension Comparative.
Road Investment Decision Framework
Introduction to genetic algorithm
Optimization Problems
Lecture 7: Constrained Conditional Models
TIM 58 Continuing Ch 2: Project Management
Network Innovation Allowance Project: South East Smart Grid
دراسة جدوى مشروعات تفريخ الأسماك (دورة تدريبيـــــــــــــــة)
Closed Loop Wind Farm Control
Counter-activations Compromise proposal for counter-activations in the mFRR- and aFRR-Platforms.
Computer Fundamentals
Optimization Problems
Huanyuan(Wayne) Sheng
Infra program Project outline Jouko Kankainen
Algorithms for Budget-Constrained Survivable Topology Design
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’
Solving the Minimum Labeling Spanning Tree Problem
Md. Tanveer Anwar University of Arkansas
Yupei Xiong Bruce Golden Edward Wasil INFORMS Annual Meeting
Fast Min-Register Retiming Through Binary Max-Flow
Area Coverage Problem Optimization by (local) Search
Topology Optimization through Computer Aided Software
Presentation transcript:

Intelligent Tools for Techno- Economic Modelling and Network Design Tim Glover Chris Voudouris Anthony Conway Edward Tsang Ali Rais Shaghaghi Michael Kampouridis

Network Deployment Given a new country/city Where should phone/Internet cover be provided?

Deployment Plan Example Year 1 Year 2 Year 3 No deployment

Cost vs Revenue Cost Hard optimization problem Very technical Profitability depend on it! Revenue Based on business model Commercial confidential

Cost: Fibre Trenching (Graph Problem) The network may include fibres between exchanges, roads in a town, or conduit in a building. The task is to minimise: Trenching; and costs for fibre optic network deployment.

Confidential Material Tim Glover(BT) Ali Rais Shaghaghi(Essex) Michael Kampouridis (Essex) Edward Tsang (Essex)

Intelligent Tools for Fibre Access Network Design Tim Glover(BT) Ali Rais Shaghaghi(Essex) Edward Tsang(Essex)

BT NetDesign is a software platform for assisting with physical network design. It is written as a Rich Client Platform Eclipse application. The main components are an extensible data model describing networks as nodes and links a graphical editor for viewing and editing networks a problem solving package for representing and solving network design problems Fibre Access Network Design using the BT NetDesign platform

For example, the network may consist of fibres between exchanges, roads in a town, or conduit in a building. The problem is to minimise trenching and costs for fibre optic network deployment. 1.Fibre Trenching(Graph Problem)

Guided Local Search is a Metaheuristic search method. Using solution features to improve the local search algorithm Considerable improvement in solver algorithm in regards to execution time and optimised solution when compared to the existing BT NetDesign algorithms (Simulated Annealing) Integration to the current BT NetDesign platform Guided local Search for Graph Problem

In general, an access fibre network consists of a set of Customers, a set of Distribution Points (DPs) and a set of Pick–Up Points (exchanges, or PUPs). These points are located in a network of roads, and possibly open spaces. The problem is to construct a tree of fibres that connects each customer to a PUP, either directly, or via one or more DPs, that minimises the total cost. 2.Access Fibre Network Design

Different DPs are available of different capacities (eg 44, 88). Different customer types may require different numbers of connections Different cables are available that bundle together different numbers of fibres Different roads may have different costs associated with digging trenches Digging a trench across a road costs more than digging along a pavement. There is a maximum reach between customers and DPs, and between DPs and PUPs Some considerations affecting cost

Tightly constrained problem In some cases finding a single feasible solution could take months Conventional search methods were unable to solve the problem Use of advanced CS methods to have fast and optimised solutions In Cases of extremely tightly constrained problems the CS solver would ensure that at least one solution is found Intelligence for solving constraint satisfaction network design problem

Benefit of joint work to date

This work has mainly focused on introducing novel intelligent problem solving algorithms to the BT NetDesign platform. They have contributed mainly into two areas Graph Problem Access Fibre Network Design Concluding Remarks

Intelligent Tools for Techno- Economic Modelling and Network Design Tim Glover (BT) Michael Kampouridis (Essex) Ali Rais Shaghaghi (Essex) Edward Tsang (Essex)

Techno-economic modelling for FTTx Produce a model which Analyses the technological requirements of the deployment of an FTTx investment e.g. number of workers, trenching length, cable length Analyses the economical requirements of the above deployment e.g annual cost, annual revenue, cash flow Purpose of model: to advice on the viability and profitability of the investment

Model inputs Area population Social category Competition Budget Rental tariffs and number of customers PAYG tariffs and number of customers Study period

Model outputs Annual revenue Annual cost Cash flow Net Present Value Internal Rate of Return

Need for intelligence While a techno-economic model can evaluate different deployment plans, the number of such plans can be very large e.g. if we plan to roll-out to 50 cities within the next 5 years, the number of different deployment plans is 5 50 Computationally expensive to evaluate all available deployment plans Question: “What is the deployment plan that offers the highest profit”?

Adding intelligence Use different heuristics to locate the optimal deployment plan Simple Hill Climbing Steepest Ascent Hill Climbing Genetic Algorithms

Heat Map-Deployment Plan for London Improvement of up to 18% in the NPV- equivalent to millions of pounds savings

Graphs

Conclusion Use of intelligent methods for finding optimal deployment plans for FTTx deployment Results show that thanks to the methods used, there has been an increase in the profitability of the investment Presented a techno-economic tool for evaluation of such investment