OUTLINE. A model for the Container Stowage and Routing Problem. Container Stowage and Routing Problem. Container Stowage and Routing Problem
|
|
- Garry Hines
- 5 years ago
- Views:
Transcription
1 OUTLIN mode for the ontaner Stowage and Routng Probem INS ombra na Moura, 3 Pauo Trunfante Martns ntóno ndrade-amos 3 Vctor Lobo The ontaner Stowage and Routng Probem (SRP; Mxed Integer Programmng Mode for the SRP; Test robems and resuts; oncusons and Future wor. Portuguese Nava cadem 3 eartment of conomcs, Management and Industra ngneerng, Unverst of vero ontaner Stowage and Routng Probem ontaner Stowage and Routng Probem Proosed robem ogstc mode for a feet of contanershs wth routes defned dnamca deendng on cargo arrva at orts and dever deadnes What route for each sh? haenges addressed: ontanersh characterstcs and oeraton costs ontanershs routes What contaners to carr? ontaners carred n each ourne ontaner characterstcs and deadnes How to stow the contaners? 7 das das Harbour fee erthng 9 das 8 das Factes Pot uraton T 5 das 8 das 0 das 3 4 SRP - ata SRP - ata set of orts defned b: Geograhca coordnates Fxed tarffs Vstng costs Su and demand (set of contaners set of vesses characterzed b: mensons Stabt characterstcs Veoct Oeraton costs Fue consumton Sots ostonng set of contaners n each ort: Standard contaners Weght Orgen and destnaton ort eadne ost and tme of a movement 5 tered from Wson and Roach (999 6
2 SRP ecsons SRP ontaner Loadng ecsons ecsons to be made Route cost? ontanersh utzaton cost? t each ort Stowage an.3 Movement cost? What contaners shoud be carred b each vesse? What sots shoud be occued? Severa movements are erformed -> the stowage an s norma rearranged Stowage an. Stowage an. Stowage an. Stowage an. Stowage an.3 Obectve Unoaded contaners -> destnaton s reached ontaner shftng -> the access to other contaners that must be unoaded s boced Re-handes -> contaners re-ostonng to mrove the overa stowage (stabt and access Load new contaners to dever 7 8 SRP Routng ecsons MIP Mode for the SRP Ports data Whch orts shoud be vsted b contanershs Vstng sequence f 4 d 3 G( P, P{,..., } {(, :, P, } 7 das das d Length of arc (, n mes 9 das 8 das 5 das 8 das 0 das u Vstng cost n uros b tme unt (hours of ort b vesse that deends of: Port utzaton Port taxes 9 0 MIP Mode for the SRP Vesses data MIP Mode for the SRP ontaners data { } V,..., Set of vesses L Vesse s characterstcs,, T,,, GT, Q, s _ fue ve tc c s Vesse s trave veoct (assumed constant ost trave oeraton (er unt dstance, n uros that deends of, the cost of the fue/mes ost of the vesse utzaton Tme at whch vesse arrves at ort contaners have standard dmensons n TU s { α,..., α } { } α,..., α n Set of contaners n each ort, to dever n severa destnatons Set of contaners to ort t Servce tme of vesse n ort q α d α ontaner s weght ever deadne of a contaner
3 MIP Mode for the SRP Loadng data ecson varabes m α T ost of a movement (oad or unoad of a contaner α n a vesse n ort Matrx of sots aced n vesse x, f vesse vsts ort mmedate after servng ort 0 otherwse For the sae of smct each sot corresonds to a set of contaners - to be shed from ort to ort. The transortaton matrx s caed feasbe f n each ort the tota caact requred to stow the contaners destned for subsequent orts s no more than the caact of the sh z x, f vesse s used 0 otherwse tered from Wson and Roach ( ecson varabes Obectve functon α (x, δ α, f contaners of ort are transorted b vesse 0 otherwse Mn W v ( dtc x xu route cost v W c ( cost of vesse utzaton γ α ( x,, f oad oeratons of contaners α were erformed n vesse and sot (x, 0 otherwse W v 3 ( γ α x z x z m (,, β α (,, α cost of contaner movements β α ( x,, f unoad oeratons of contaners α were erformed n vesse and sot (x, 0 otherwse W, W and W 3 must be tuned for each acaton 5 6 onstrants reated to routes, onstrants reated to contaners ostonng and oadng x x s d α α qαδ α α Q P α x x 0 α δ α α α s t d ve s M ( x, P x δ α P α 7 das das 9 das 8 das 7 5 das 8 das 0 das 8
4 onstrants reated to contaners ostonng and oadng MIP Mode for the SRP decson varabes Shfts oeratons: α α x γ α ( x, α P T β α x z x x z x (,, β α (,, P T α α α α x δ α β α ( x, α P T Shfted contaner γ α γ ( x, ( x, z α 0 α T When a shft s erformed the contaner s oaded n a dfferent sot; x β α(x, γ α(x, 9 0 Test Probems Test Probems Ports ontaners/demands #{ α,..., α} 700 Probem : α 00 ; α 00; α 00; α 00; α 00 Probem : 8 q α #{ α,..., α} 400 α 400 ; α 00; α 400; α 00; α 00 X Inta ort: 8 d α 0 Oeraton cost and ort fees HVY Inta ort: ontanershs Port tarfs (sh reated costs ontaners reated costs Voage costs Shs Length eam raught Seed (nots N.º TU Gross tonnage Fue (t/h ot charges SQRT(GT ; berthng 03 ; sace 0,668 * GT 0,0357 * GT * (das- ; tugs and towng ; ort tarff / TU - 9,733 ; contaner embaraton 35 ; contaner dsembaraton 35 ; contaner shft 35 ; fue /t; crew reated 00 / da; X HVY Resuts GLPK - GNU Lnear Programmng sover The mode was tested on a ore uo Mean runnng tme to acheve an otma souton 7 mn Probem Traveed Sh Route Tota tme mes h X h HVY Probem Obectve functon oncusons omex features refect dstrbuton short sea shng robems reat; Mathematca rogrammng mode: Forma descrton of the robem; He to understand the underng rncas and the robem comext. Usng a smfed scenaro t was concuded that t s ossbe to: Turn the martme transort more fexbe wth cost reductons; Manage a feet consderng the cargo deadnes and reducng tme duraton when necessar; Sh X HVY Route Traveed Tme mes nterva h 63 6 h Obectve functon nass of rea scenaros wth rea data (coaboraton requred. 3 4
5 Future Wor Insert n the mode other constrants: Stabt It s cruca n contanersh s oadng; LIFO In order to reduce: ontaner shftng; ontaner re-handes; Imrove the Genetc agorthm mementaton for route seecton and cargo dstrbuton that has aread been done. 5
SOLVING CAPACITATED VEHICLE ROUTING PROBLEMS WITH TIME WINDOWS BY GOAL PROGRAMMING APPROACH
Proceedngs of IICMA 2013 Research Topc, pp. xx-xx. SOLVIG CAPACITATED VEHICLE ROUTIG PROBLEMS WITH TIME WIDOWS BY GOAL PROGRAMMIG APPROACH ATMII DHORURI 1, EMIUGROHO RATA SARI 2, AD DWI LESTARI 3 1Department
More informationExample: Suppose we want to build a classifier that recognizes WebPages of graduate students.
Exampe: Suppose we want to bud a cassfer that recognzes WebPages of graduate students. How can we fnd tranng data? We can browse the web and coect a sampe of WebPages of graduate students of varous unverstes.
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationQueueing Networks II Network Performance
Queueng Networks II Network Performance Davd Tpper Assocate Professor Graduate Telecommuncatons and Networkng Program Unversty of Pttsburgh Sldes 6 Networks of Queues Many communcaton systems must be modeled
More informationQuality of Routing Congestion Games in Wireless Sensor Networks
Qualty of Routng ongeston Gaes n Wreless Sensor Networs ostas Busch Lousana State Unversty Rajgoal Kannan Lousana State Unversty Athanasos Vaslaos Unv. of Western Macedona 1 Outlne of Tal Introducton Prce
More informationVehicle Routing Problem for Emissions Minimization
Vehce Routng Probem for Emssons Mnmzaton Mgue Fgozz Envronmenta, soca, an otca ressures to mt the effects assocate wth greenhouse gas emssons are mountng. Ltte research has been one on reucng emssons as
More informationFuzzy approach to solve multi-objective capacitated transportation problem
Internatonal Journal of Bonformatcs Research, ISSN: 0975 087, Volume, Issue, 00, -0-4 Fuzzy aroach to solve mult-objectve caactated transortaton roblem Lohgaonkar M. H. and Bajaj V. H.* * Deartment of
More informationA General Column Generation Algorithm Applied to System Reliability Optimization Problems
A Genera Coumn Generaton Agorthm Apped to System Reabty Optmzaton Probems Lea Za, Davd W. Cot, Department of Industra and Systems Engneerng, Rutgers Unversty, Pscataway, J 08854, USA Abstract A genera
More informationReconstruction History. Image Reconstruction. Radon Transform. Central Slice Theorem (I)
Reconstructon Hstory wth Bomedca Acatons EEG-475/675 Prof. Barner Reconstructon methods based on Radon s wor 97 cassc mage reconstructon from roectons aer 97 Hounsfed deveo the frst commerca x-ray CT scanner
More informationQuality-of-Service Routing in Heterogeneous Networks with Optimal Buffer and Bandwidth Allocation
Purdue Unversty Purdue e-pubs ECE Technca Reorts Eectrca and Comuter Engneerng -6-007 Quaty-of-Servce Routng n Heterogeneous Networs wth Otma Buffer and Bandwdth Aocaton Waseem Sheh Purdue Unversty, waseem@urdue.edu
More informationPriority Queuing with Finite Buffer Size and Randomized Push-out Mechanism
ICN 00 Prorty Queung wth Fnte Buffer Sze and Randomzed Push-out Mechansm Vladmr Zaborovsy, Oleg Zayats, Vladmr Muluha Polytechncal Unversty, Sant-Petersburg, Russa Arl 4, 00 Content I. Introducton II.
More informationWinter 2008 CS567 Stochastic Linear/Integer Programming Guest Lecturer: Xu, Huan
Wnter 2008 CS567 Stochastc Lnear/Integer Programmng Guest Lecturer: Xu, Huan Class 2: More Modelng Examples 1 Capacty Expanson Capacty expanson models optmal choces of the tmng and levels of nvestments
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationAn Integrated OR/CP Method for Planning and Scheduling
An Integrated OR/CP Method for Plannng and Schedulng John Hooer Carnege Mellon Unversty IT Unversty of Copenhagen June 2005 The Problem Allocate tass to facltes. Schedule tass assgned to each faclty. Subect
More informationA parametric Linear Programming Model Describing Bandwidth Sharing Policies for ABR Traffic
parametrc Lnear Programmng Mode Descrbng Bandwdth Sharng Poces for BR Traffc I. Moschoos, M. Logothets and G. Kokknaks Wre ommuncatons Laboratory, Dept. of Eectrca & omputer Engneerng, Unversty of Patras,
More informationCHALMERS, GÖTEBORGS UNIVERSITET. SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS. COURSE CODES: FFR 135, FIM 720 GU, PhD
CHALMERS, GÖTEBORGS UNIVERSITET SOLUTIONS to RE-EXAM for ARTIFICIAL NEURAL NETWORKS COURSE CODES: FFR 35, FIM 72 GU, PhD Tme: Place: Teachers: Allowed materal: Not allowed: January 2, 28, at 8 3 2 3 SB
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationA MIN-MAX REGRET ROBUST OPTIMIZATION APPROACH FOR LARGE SCALE FULL FACTORIAL SCENARIO DESIGN OF DATA UNCERTAINTY
A MIN-MAX REGRET ROBST OPTIMIZATION APPROACH FOR ARGE SCAE F FACTORIA SCENARIO DESIGN OF DATA NCERTAINTY Travat Assavapokee Department of Industra Engneerng, nversty of Houston, Houston, Texas 7704-4008,
More informationNumerical integration in more dimensions part 2. Remo Minero
Numerca ntegraton n more dmensons part Remo Mnero Outne The roe of a mappng functon n mutdmensona ntegraton Gauss approach n more dmensons and quadrature rues Crtca anass of acceptabt of a gven quadrature
More informationAn Optimization Model for Routing in Low Earth Orbit Satellite Constellations
An Optmzaton Model for Routng n Low Earth Orbt Satellte Constellatons A. Ferrera J. Galter P. Mahey Inra Inra Inra Afonso.Ferrera@sopha.nra.fr Jerome.Galter@nra.fr Phlppe.Mahey@sma.fr G. Mateus A. Olvera
More informationLower Bounding Procedures for the Single Allocation Hub Location Problem
Lower Boundng Procedures for the Snge Aocaton Hub Locaton Probem Borzou Rostam 1,2 Chrstoph Buchhem 1,4 Fautät für Mathemat, TU Dortmund, Germany J. Faban Meer 1,3 Uwe Causen 1 Insttute of Transport Logstcs,
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationMulticommodity Distribution System Design
Mummodt strbun stem esgn Consder the probem where ommodtes are produed and shpped from pants through potenta dstrbun enters C usmers. Pants C Cosmers Mummodt strbun stem esgn Consder the probem where ommodtes
More informationNODAL PRICES IN THE DAY-AHEAD MARKET
NODAL PRICES IN THE DAY-AHEAD MARET Fred Murphy Tempe Unversty AEG Meetng, Washngton, DC Sept. 7, 8 What we cover Two-stage stochastc program for contngency anayss n the day-ahead aucton. Fnd the LMPs
More informationOn Uplink-Downlink Sum-MSE Duality of Multi-hop MIMO Relay Channel
On Upn-Downn Sum-MSE Duat of Mut-hop MIMO Rea Channe A Cagata Cr, Muhammad R. A. handaer, Yue Rong and Yngbo ua Department of Eectrca Engneerng, Unverst of Caforna Rversde, Rversde, CA, 95 Centre for Wreess
More informationModelling and Constraint Hardness Characterisation of the Unique-Path OSPF Weight Setting Problem
Modellng and Constrant Hardness Charactersaton of the Unque-Path OSPF Weght Settng Problem Changyong Zhang and Robert Rodose IC-Parc, Imperal College London, London SW7 2AZ, Unted Kngdom {cz, r.rodose}@cparc.mperal.ac.u
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationImage Classification Using EM And JE algorithms
Machne earnng project report Fa, 2 Xaojn Sh, jennfer@soe Image Cassfcaton Usng EM And JE agorthms Xaojn Sh Department of Computer Engneerng, Unversty of Caforna, Santa Cruz, CA, 9564 jennfer@soe.ucsc.edu
More informationMultispectral Remote Sensing Image Classification Algorithm Based on Rough Set Theory
Proceedngs of the 2009 IEEE Internatona Conference on Systems Man and Cybernetcs San Antono TX USA - October 2009 Mutspectra Remote Sensng Image Cassfcaton Agorthm Based on Rough Set Theory Yng Wang Xaoyun
More informationSupporting Information
Supportng Informaton The neural network f n Eq. 1 s gven by: f x l = ReLU W atom x l + b atom, 2 where ReLU s the element-wse rectfed lnear unt, 21.e., ReLUx = max0, x, W atom R d d s the weght matrx to
More informationError Bars in both X and Y
Error Bars n both X and Y Wrong ways to ft a lne : 1. y(x) a x +b (σ x 0). x(y) c y + d (σ y 0) 3. splt dfference between 1 and. Example: Prmordal He abundance: Extrapolate ft lne to [ O / H ] 0. [ He
More information10.34 Fall 2015 Metropolis Monte Carlo Algorithm
10.34 Fall 2015 Metropols Monte Carlo Algorthm The Metropols Monte Carlo method s very useful for calculatng manydmensonal ntegraton. For e.g. n statstcal mechancs n order to calculate the prospertes of
More informationCIS 700: algorithms for Big Data
CIS 700: algorthms for Bg Data Lecture 5: Dmenson Reducton Sldes at htt://grgory.us/bg-data-class.html Grgory Yaroslavtsev htt://grgory.us Today Dmensonalty reducton AMS as dmensonalty reducton Johnson-Lndenstrauss
More informationOnline Appendix: Reciprocity with Many Goods
T D T A : O A Kyle Bagwell Stanford Unversty and NBER Robert W. Stager Dartmouth College and NBER March 2016 Abstract Ths onlne Appendx extends to a many-good settng the man features of recprocty emphaszed
More informationAssociative Memories
Assocatve Memores We consder now modes for unsupervsed earnng probems, caed auto-assocaton probems. Assocaton s the task of mappng patterns to patterns. In an assocatve memory the stmuus of an ncompete
More informationwe have E Y x t ( ( xl)) 1 ( xl), e a in I( Λ ) are as follows:
APPENDICES Aendx : the roof of Equaton (6 For j m n we have Smary from Equaton ( note that j '( ( ( j E Y x t ( ( x ( x a V ( ( x a ( ( x ( x b V ( ( x b V x e d ( abx ( ( x e a a bx ( x xe b a bx By usng
More informationA Linear Programming Approach to the Train Timetabling Problem
A Lnear Programmng Aroach to the Tran Tmetablng Problem V. Cacchan, A. Carara, P. Toth DEIS, Unversty of Bologna (Italy) e-mal (vcacchan, acarara, toth @des.unbo.t) The Tran Tmetablng Problem (on a sngle
More informationBoundary Value Problems. Lecture Objectives. Ch. 27
Boundar Vaue Probes Ch. 7 Lecture Obectves o understand the dfference between an nta vaue and boundar vaue ODE o be abe to understand when and how to app the shootng ethod and FD ethod. o understand what
More informationNotes on proof-nets II
Notes on proof-nets II Danel Murfet Most of these notes are coped from the followng paper: [BM] = Ballot, Mazza Lnear logc by levels and bounded tme complexty, 29 5/4/26 thersngseaorg/post/semnar-proofnets/
More informationDynamic Analysis Of An Off-Road Vehicle Frame
Proceedngs of the 8th WSEAS Int. Conf. on NON-LINEAR ANALYSIS, NON-LINEAR SYSTEMS AND CHAOS Dnamc Anass Of An Off-Road Vehce Frame ŞTEFAN TABACU, NICOLAE DORU STĂNESCU, ION TABACU Automotve Department,
More informationRoot Locus Properties of Adaptive Beamforming and Capon Estimation for Uniform Linear Arrays
Root Locus Propertes of Adaptve Beamformng and Capon Estmaton for Unform Lnear Arrays Allan Stenhardt Alphatech phone: 703-284-8426 emal: astenhardt@dc.alphatech.com Abstract In ths paper we explore propertes
More informationLecture 10 Support Vector Machines II
Lecture 10 Support Vector Machnes II 22 February 2016 Taylor B. Arnold Yale Statstcs STAT 365/665 1/28 Notes: Problem 3 s posted and due ths upcomng Frday There was an early bug n the fake-test data; fxed
More informationRobust Multi-Objective Facility Location Model of Closed-Loop Supply Chain Network under Interval Uncertainty
Internatona Journa of Operatons Research Internatona Journa of Operatons Research Vo. 14, No. 2, 53 63 (2017) Robust Mut-Obectve Facty Locaton Moe of Cose-Loop Suppy Chan Network uner Interva Uncertanty
More informationA FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS
Shervn Haamn A FAST HEURISTIC FOR TASKS ASSIGNMENT IN MANYCORE SYSTEMS WITH VOLTAGE-FREQUENCY ISLANDS INTRODUCTION Increasng computatons n applcatons has led to faster processng. o Use more cores n a chp
More informationDynamic Programming. Lecture 13 (5/31/2017)
Dynamc Programmng Lecture 13 (5/31/2017) - A Forest Thnnng Example - Projected yeld (m3/ha) at age 20 as functon of acton taken at age 10 Age 10 Begnnng Volume Resdual Ten-year Volume volume thnned volume
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationIn this section is given an overview of the common elasticity models.
Secton 4.1 4.1 Elastc Solds In ths secton s gven an overvew of the common elastcty models. 4.1.1 The Lnear Elastc Sold The classcal Lnear Elastc model, or Hooean model, has the followng lnear relatonshp
More informationCOS 521: Advanced Algorithms Game Theory and Linear Programming
COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton
More informationNonlinear Robust Regression Using Kernel Principal Component Analysis and R-Estimators
IJCSI Internatona Journa of Comuter Scence Issues, Vo. 8, Issue 5, o, Setember 0 ISS (Onne: 694-084 www.ijcsi.org 75 onnear Robust Regresson Usng Kerne rnca Comonent Anayss and R-Estmators Anton Wbowo
More informationResearch on Route guidance of logistic scheduling problem under fuzzy time window
Advanced Scence and Technology Letters, pp.21-30 http://dx.do.org/10.14257/astl.2014.78.05 Research on Route gudance of logstc schedulng problem under fuzzy tme wndow Yuqang Chen 1, Janlan Guo 2 * Department
More informationManaging Capacity Through Reward Programs. on-line companion page. Byung-Do Kim Seoul National University College of Business Administration
Managng Caacty Through eward Programs on-lne comanon age Byung-Do Km Seoul Natonal Unversty College of Busness Admnstraton Mengze Sh Unversty of Toronto otman School of Management Toronto ON M5S E6 Canada
More informationPortfolios with Trading Constraints and Payout Restrictions
Portfolos wth Tradng Constrants and Payout Restrctons John R. Brge Northwestern Unversty (ont wor wth Chrs Donohue Xaodong Xu and Gongyun Zhao) 1 General Problem (Very) long-term nvestor (eample: unversty
More informationMulti-dimensional Central Limit Argument
Mult-dmensonal Central Lmt Argument Outlne t as Consder d random proceses t, t,. Defne the sum process t t t t () t (); t () t are d to (), t () t 0 () t tme () t () t t t As, ( t) becomes a Gaussan random
More informationCHAPTER 17 Amortized Analysis
CHAPTER 7 Amortzed Analyss In an amortzed analyss, the tme requred to perform a sequence of data structure operatons s averaged over all the operatons performed. It can be used to show that the average
More informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationInterference Alignment and Degrees of Freedom Region of Cellular Sigma Channel
2011 IEEE Internatona Symposum on Informaton Theory Proceedngs Interference Agnment and Degrees of Freedom Regon of Ceuar Sgma Channe Huaru Yn 1 Le Ke 2 Zhengdao Wang 2 1 WINLAB Dept of EEIS Unv. of Sc.
More informationDynamic Programming. Preview. Dynamic Programming. Dynamic Programming. Dynamic Programming (Example: Fibonacci Sequence)
/24/27 Prevew Fbonacc Sequence Longest Common Subsequence Dynamc programmng s a method for solvng complex problems by breakng them down nto smpler sub-problems. It s applcable to problems exhbtng the propertes
More informationMARKOV CHAIN AND HIDDEN MARKOV MODEL
MARKOV CHAIN AND HIDDEN MARKOV MODEL JIAN ZHANG JIANZHAN@STAT.PURDUE.EDU Markov chan and hdden Markov mode are probaby the smpest modes whch can be used to mode sequenta data,.e. data sampes whch are not
More informationOptimization of Surgery Delivery Systems
Optmzaton of Surger Delver Sstems Bran Denton Edward P. Ftts Department of Industral & Sstems Engneerng North Carolna State Unverst Ma, 202 Collaborators Har Balasubramanan (Unverst of Massachusetts) Sakne
More information), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationStrain Energy in Linear Elastic Solids
Duke Unverst Department of Cv and Envronmenta Engneerng CEE 41L. Matr Structura Anass Fa, Henr P. Gavn Stran Energ n Lnear Eastc Sods Consder a force, F, apped gradua to a structure. Let D be the resutng
More informationPolymer Chains. Ju Li. GEM4 Summer School 2006 Cell and Molecular Mechanics in BioMedicine August 7 18, 2006, MIT, Cambridge, MA, USA
Polymer Chans Ju L GEM4 Summer School 006 Cell and Molecular Mechancs n BoMedcne August 7 18, 006, MIT, Cambrdge, MA, USA Outlne Freely Jonted Chan Worm-Lke Chan Persstence Length Freely Jonted Chan (FJC)
More informationThe Use of Principal Components Analysis in the Assessment of Process Capability Indices
Jont Statstca Meetngs - Secton on Physca & Engneerng Scences (SPES) The Use of Prnca omonents Anayss n the Assessment of Process aabty Indces Evdoka Xekaak Mchae Peraks Deartment of Statstcs Athens Unversty
More informationOutline and Reading. Dynamic Programming. Dynamic Programming revealed. Computing Fibonacci. The General Dynamic Programming Technique
Outlne and Readng Dynamc Programmng The General Technque ( 5.3.2) -1 Knapsac Problem ( 5.3.3) Matrx Chan-Product ( 5.3.1) Dynamc Programmng verson 1.4 1 Dynamc Programmng verson 1.4 2 Dynamc Programmng
More informationCalculation of time complexity (3%)
Problem 1. (30%) Calculaton of tme complexty (3%) Gven n ctes, usng exhaust search to see every result takes O(n!). Calculaton of tme needed to solve the problem (2%) 40 ctes:40! dfferent tours 40 add
More informationA Robust Optimization Approach for the Milk Run Problem with Time Windows under Inventory Uncertainty - An Auto Industry Supply Chain Case Study
Proceedngs of the 21 Internatonal Conference on Industral Engneerng and Oeratons Management Dhaa, Bangladesh, January 9 1, 21 A Robust Otmzaton Aroach for the Ml Run Problem wth Tme Wndows under Inventory
More informationAPPENDIX F A DISPLACEMENT-BASED BEAM ELEMENT WITH SHEAR DEFORMATIONS. Never use a Cubic Function Approximation for a Non-Prismatic Beam
APPENDIX F A DISPACEMENT-BASED BEAM EEMENT WITH SHEAR DEFORMATIONS Never use a Cubc Functon Approxmaton for a Non-Prsmatc Beam F. INTRODUCTION { XE "Shearng Deformatons" }In ths appendx a unque development
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationGlobal Optimization of Bilinear Generalized Disjunctive Programs
Global Optmzaton o Blnear Generalzed Dsunctve Programs Juan Pablo Ruz Ignaco E. Grossmann Department o Chemcal Engneerng Center or Advanced Process Decson-mang Unversty Pttsburgh, PA 15213 1 Non-Convex
More informationSupplementary Material: Learning Structured Weight Uncertainty in Bayesian Neural Networks
Shengyang Sun, Changyou Chen, Lawrence Carn Suppementary Matera: Learnng Structured Weght Uncertanty n Bayesan Neura Networks Shengyang Sun Changyou Chen Lawrence Carn Tsnghua Unversty Duke Unversty Duke
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationEffective Power Optimization combining Placement, Sizing, and Multi-Vt techniques
Effectve Power Optmzaton combnng Placement, Szng, and Mult-Vt technques Tao Luo, Davd Newmark*, and Davd Z Pan Department of Electrcal and Computer Engneerng, Unversty of Texas at Austn *Advanced Mcro
More informationIntra-Domain Traffic Engineering
Intra-Doman Traffc Engneerng Traffc Engneerng (TE) MPLS and traffc engneerng (wll go over very brefly) traffc engneerng as networ-wde optmzaton problem TE through ln weght assgnments Traffc Matrx Estmaton
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More information3. Stress-strain relationships of a composite layer
OM PO I O U P U N I V I Y O F W N ompostes ourse 8-9 Unversty of wente ng. &ech... tress-stran reatonshps of a composte ayer - Laurent Warnet & emo Aerman.. tress-stran reatonshps of a composte ayer Introducton
More informationEVALUATION OF THE VISCO-ELASTIC PROPERTIES IN ASPHALT RUBBER AND CONVENTIONAL MIXES
EVALUATION OF THE VISCO-ELASTIC PROPERTIES IN ASPHALT RUBBER AND CONVENTIONAL MIXES Manuel J. C. Mnhoto Polytechnc Insttute of Bragança, Bragança, Portugal E-mal: mnhoto@pb.pt Paulo A. A. Perera and Jorge
More informationCS294 Topics in Algorithmic Game Theory October 11, Lecture 7
CS294 Topcs n Algorthmc Game Theory October 11, 2011 Lecture 7 Lecturer: Chrstos Papadmtrou Scrbe: Wald Krchene, Vjay Kamble 1 Exchange economy We consder an exchange market wth m agents and n goods. Agent
More informationCSE4210 Architecture and Hardware for DSP
4210 Archtecture and Hardware for DSP Lecture 1 Introducton & Number systems Admnstratve Stuff 4210 Archtecture and Hardware for DSP Text: VLSI Dgtal Sgnal Processng Systems: Desgn and Implementaton. K.
More informationDEVELOPMENT OF A MATHEMATICAL MODEL FOR SIMULATION OF COAL CRUSHING IN A HAMMER MILL
Proceedngs of the XI Internatonal Semnar on Mneral Processng Technology (MPT-200) Edtors: R. Sngh, A. Das, P.K. Baneree, K.K. Bhattacharyya and N.G. Goswam NML Jamshedur,. 343 349 DEVELOPMENT OF A MATHEMATICAL
More informationNeural networks. Nuno Vasconcelos ECE Department, UCSD
Neural networs Nuno Vasconcelos ECE Department, UCSD Classfcaton a classfcaton problem has two types of varables e.g. X - vector of observatons (features) n the world Y - state (class) of the world x X
More informationDEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA. 1. Matrices in Mathematica
demo8.nb 1 DEMO #8 - GAUSSIAN ELIMINATION USING MATHEMATICA Obectves: - defne matrces n Mathematca - format the output of matrces - appl lnear algebra to solve a real problem - Use Mathematca to perform
More informationApplication of Particle Swarm Optimization to Economic Dispatch Problem: Advantages and Disadvantages
Appcaton of Partce Swarm Optmzaton to Economc Dspatch Probem: Advantages and Dsadvantages Kwang Y. Lee, Feow, IEEE, and Jong-Bae Par, Member, IEEE Abstract--Ths paper summarzes the state-of-art partce
More informationA Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks
IEEE/ACM TRANSACTIONS ON NETWORKING A Smpe Congeston-Aware Agorthm for Load Baancng n Datacenter Networs Mehrnoosh Shafee, Student Member, IEEE, and Javad Ghader, Member, IEEE Abstract We study the probem
More informationMulti-dimensional Central Limit Theorem
Mult-dmensonal Central Lmt heorem Outlne ( ( ( t as ( + ( + + ( ( ( Consder a sequence of ndependent random proceses t, t, dentcal to some ( t. Assume t = 0. Defne the sum process t t t t = ( t = (; t
More informationOnline Appendix to: Axiomatization and measurement of Quasi-hyperbolic Discounting
Onlne Appendx to: Axomatzaton and measurement of Quas-hyperbolc Dscountng José Lus Montel Olea Tomasz Strzaleck 1 Sample Selecton As dscussed before our ntal sample conssts of two groups of subjects. Group
More informationLinear Correlation. Many research issues are pursued with nonexperimental studies that seek to establish relationships among 2 or more variables
Lnear Correlaton Many research ssues are pursued wth nonexpermental studes that seek to establsh relatonshps among or more varables E.g., correlates of ntellgence; relaton between SAT and GPA; relaton
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationMatrix Approximation via Sampling, Subspace Embedding. 1 Solving Linear Systems Using SVD
Matrx Approxmaton va Samplng, Subspace Embeddng Lecturer: Anup Rao Scrbe: Rashth Sharma, Peng Zhang 0/01/016 1 Solvng Lnear Systems Usng SVD Two applcatons of SVD have been covered so far. Today we loo
More informationDynamic Programming 4/5/12. Dynamic programming. Fibonacci numbers. Fibonacci: a first attempt. David Kauchak cs302 Spring 2012
Dynamc Programmng Davd Kauchak cs32 Sprng 212 Dynamc programmng l One of the most mportant algorthm tools! l Very common ntervew queston l Method for solvng problems where optmal solutons can be defned
More informationLecture 3. Ax x i a i. i i
18.409 The Behavor of Algorthms n Practce 2/14/2 Lecturer: Dan Spelman Lecture 3 Scrbe: Arvnd Sankar 1 Largest sngular value In order to bound the condton number, we need an upper bound on the largest
More informationAnalysis of Discrete Time Queues (Section 4.6)
Analyss of Dscrete Tme Queues (Secton 4.6) Copyrght 2002, Sanjay K. Bose Tme axs dvded nto slots slot slot boundares Arrvals can only occur at slot boundares Servce to a job can only start at a slot boundary
More informationSimultaneous Optimization of Berth Allocation, Quay Crane Assignment and Quay Crane Scheduling Problems in Container Terminals
Smultaneous Optmzaton of Berth Allocaton, Quay Crane Assgnment and Quay Crane Schedulng Problems n Contaner Termnals Necat Aras, Yavuz Türkoğulları, Z. Caner Taşkın, Kuban Altınel Abstract In ths work,
More informationApproximate Circle Packing in a Rectangular Container: Integer Programming Formulations and Valid Inequalities
Appromate Crce Pacng n a Rectanguar Contaner: Integer Programmng Formuatons and Vad Inequates Igor Ltvnchev, Lus Infante, and Edth Lucero Ozuna Espnosa Department of Mechanca and Eectrca Engneerng Nuevo
More informationDelay tomography for large scale networks
Deay tomography for arge scae networks MENG-FU SHIH ALFRED O. HERO III Communcatons and Sgna Processng Laboratory Eectrca Engneerng and Computer Scence Department Unversty of Mchgan, 30 Bea. Ave., Ann
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationLinear Classification, SVMs and Nearest Neighbors
1 CSE 473 Lecture 25 (Chapter 18) Lnear Classfcaton, SVMs and Nearest Neghbors CSE AI faculty + Chrs Bshop, Dan Klen, Stuart Russell, Andrew Moore Motvaton: Face Detecton How do we buld a classfer to dstngush
More informationGravitation and Spatial Interaction
Unversty College London Lectures on Urban Modellng January 2017 Gravtaton and Satal Interacton Mchael Batty m.batty@ucl.ac.u @mchaelbatty 16 January, 2017 htt://www.satalcomlexty.nfo/ Lectures on Urban
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More information