Hassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
|
|
- Eugenia Norris
- 5 years ago
- Views:
Transcription
1 COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM) algorithm, to a routing problem called the vehicle routing problem with backhaul (VRPB). Uually SOM i baed on a ingle map to repreent data. The main contribution of thi paper i to introduce a new architecture formed of multiple competing map and to deign the correponding learning algorithm uch that the Kohonen map can be applied to a family of routing problem. Thoe problem are known to be NP-Hard problem. We have applied thee concept to the vehicle routing problem (VRP) and to a variant of thi problem called the VRP with Backhaul in which cutomer are of two ort : linehaul and backhaul cutomer. In deigning the route for the variou vehicle, linehaul cutomer hould be viited firt and then the backhaul cutomer. We benchmarked the performance of our approach with the mot powerful meta-heuritic and obtained excellent reult. Key word Competitive elf-organizing map, Meta-heuritic, Vehicle routing problem, 1 Introduction The VRPB problem we are conidering in thi paper conit of deigning delivery route to erve two type of cutomer; linehaul and backahul cutomer The following information i given: The Cutomer. The poition of the cutomer i provided through their coordinate in the Euclidean pace. Along with their poition, the weight or quantity of good, of each cutomer and it type are alo provided. There are two type, the backhaul and linehaul cutomer. A certain quantity of good i delivered from the depot to the linehaul cutomer and a certain quantity of good mut be picked up from each backhaul cutomer and brought to the depot. The Vehicle. A fleet of homogeneou vehicle i given. It mean that the number of vehicle i known and the capacity of all vehicle i the ame. Each vehicle can not hip a quantity of good that exceed it capacity. The Depot. The location of the depot i known and it coordinate in the Euclidean pace are given. Each vehicle tart it route from the depot viit the linehaul cutomer aigned to it for delivery and then collect the correponding good from each backhaul cutomer and bring them back to the depot.
2 WSOM 2005, Pari 2 SOM for Routing Problem: a Brief Review Artificial Neural network were ued to olve routing problem, namely the Traveling Saleman Problem (TSP). Hopfield (1995) network wa among the firt ued to tackle thi problem. In pite of it novelty, thi approach wa not practical and not competitive with exact method and metaheuritic. The application were retricted to mall ized problem not exceeding 20 to 50 citie. The architecture that i uually ued for routing problem and that wa introduced by Fort (1988) i the ring architecture. It conit of a et of neuron placed on a deformable ring. The concept of tour i embedded in the ring architecture, ince the location of a neuron on the ring can be identified with the poition in the viit a hown in the figure 2. Thi i the mot important advantage of thi approach. The ring can be conidered a a route for an ideal problem. The interaction of the network with it environment, here the cutomer and the adaptation of it neuron will force iteratively the ring to repreent the real tour that will viit equentially the cutomer. From a practical point of view, the SOFM algorithm tart by pecifying the architecture of the network, which conit of a one ring upon which the artificial neuron are patially ditributed. The ring i embedded in the Euclidian pace. Each neuron i identified by it poition in the Euclidian pace and it poition on the ring. The Euclidian ditance will be ued to compare the poition of neuron with the poition of citie. The lateral ditance will be ued to define the ditance on the ring between two neuron. The lateral ditance between any two neuron i defined to be the mallet number of neuron eparating them plu one. In the firt tep, a cutomer i randomly picked up, hi poition i compared to all poition of neuron on the ring. The nearet neuron to the cutomer i then elected and moved toward him. The neighbor of the elected neuron move alo toward the cutomer with a decreaing intenity controlled by the lateral function Kohonen (1982). An extenive analyi of thi algorithm could be found in the work publihed by Fort (1988), Angeniol et al. (1988) and Smith (1999). 3 SOM for the VRP with Backhaul The claical SOM approach conit of a neural network with a defined architecture that i interacting with it environment to repreent it according to the following principle: Two neighboring input hould be repreented by two neighboring neuron. The neighborhood relationhip between input i defined according to the Euclidean ditance in thi paper. The concept of neighboring neuron refer to neighborhood in the map formed by the neuron. Thi relationhip i defined according to connectivity. From a routing perpective, it i clear that two neighboring cutomer hould be aigned cloe poition in the routing chedule in order to minimize the total ditance traveled by the vehicle. In thi ection, we will explain how to extend the SOM to VRPB. Thi extenion i baed on the deign of a new architecture in which the TSP ring i replaced by a certain number of ring. Each ring repreent a vehicle. For more detail refer to [1,2]. In order to repreent the concept of linehaul cutomer and backhaul cutomer, each ring will conit of two part. The firt part i a equence of neuron that will interact excluively with linehaul cutomer. They are called linehaul neuron. The econd part of the ring conit of backhaul neuron, which mean that thee neuron will interact excluively with backhaul cutomer. Experiment how that thi architecture lack flexibility preventing the network from evolving adequately. Therefore, the concept of ring ha been replaced by the concept of chain. There will be two type of chain. inehaul chain are formed of linehaul neuron and backhaul chain formed of backhaul neuron. The linehaul cutomer will interact excluively with the linehaul chain,
3 Competitive Probabilitic Self-Organizing Map for Routing Problem the backhaul cutomer will interact excluively with the backhaul chain. It i clear that thoe chain will not form tour. Therefore a procedure ha to be implemented in order to repect the following requirement: Ring hould be formed to repreent the equence according to which the cutomer are viited Each ring mut be formed of a linehaul equence followed by a backhaul equence. The linehaul equence repreent the chedule of viiting the linehaul cutomer erved by the correponding vehicle and the backhaul equence repreent the chedule of viiting the backhaul cutomer erved by the ame vehicle. Each ring mut pa by the depot. Accordingly, the procedure conit of connecting the chain uch that the requirement are repected. Conequently, four type of interaction are introduced to generate a feaible VRPB tour. et u introduce the following notation: = {l = (x 1, x i i i, x ), for i =,.., N i 1} be the et of N 1 inehaul cutomer where ( x 1i, x 2i ) are the coordinate of the inehaul cutomer l i and x 3i it weight. B = { b =(y, y 2, y 3 ), for = 1,..,N 2} 1 be the et of N 2 backhaul cutomer where ( y, 1 y 2 ) are the coordinate of the backhaul cutomer b and y 3 it weight. D = (x d, y d) be the coordinate of the depot. V = { vk, for k = 1,,N v} be the et of vehicle where Nv i the number of vehicle Q i the vehicle capacity. Q i fixed becaue we have a homogenou fleet. W m : i the current amount of good delivered to inehaul cutomer by the vehicle vm, where m=1,...,n v G n : i the current amount of good picked up at backhaul cutomer by the vehicle vn, where n=1,,n v N k = {N kl, N kb } i the et of cutomer erved by vehicle vk, where N kl i the et of linehaul cutomer and N kb i the et of backhaul cutomer, where k =1,...,N v Cm = { =( X X ) for = 1,..., Nm } be the et of N m connected neuron forming the inehaul m m m, 1 2 m m chain of neuron., where m = 1,..., N y and ( X 1, X 2 ) are the coordinate in the Euclidean pace of the neuron m. ~ n n n n 1 2 C = { B = ( Y, Y ), for = 1,..., Nn} the et of N n connected neuron forming the Backhaul chain n n of neuron., where n = 1,..., N y and ( Y1, Y 2 ) are the coordinate in the Euclidean pace of the neuron B n. (i) Interaction between the chain C m and the inehaul cutomer in. In thi interaction, the inehaul cutomer in will be preented to the chain C m one by one in a random order. In order to chooe the chain that will interact with the preented cutomer, we have to conider two factor: 1) The ditance of the nearet neuron from each chain to the cutomer 2) The current weight of each chain. Each time a cutomer i aigned to a certain chain it current weight wm will be increaed by the correponding weight. The winning chain will be elected randomly according to a probability ditribution taking into conideration
4 WSOM 2005, Pari thee two factor. Once a chain i elected, the poition of it neuron will be aduted according to the adaptation rule. (ii) Interaction between the chain C n and the backhaul cutomer in B. In thi interaction the backhaul cutomer in B will interact with C n in a imilar way to the interaction of type (i) and ue to ame adaptation rule. (iii) Interaction between the chain C m and C n. Uing the previou type of interaction, the chain will evolve independently. Nothing i forcing them to be connected in order to form a feaible route. For thi reaon, an interaction between the two chain C m and C n, i introduced. We aume that each chain ha a head and a tail. The tail and the head are repreented by the lat and the firt neuron repectively. After preenting all backhaul and inehaul cutomer, the chain C m will interact with the chain C n having the nearet neuron tail to the C m neuron head. The obective of thi interaction i to make the tail of the linehaul chain and the head of the correponding backhaul chain converge. Thi convergence will allow the formation of a ingle ring repreenting a tour viiting the inehaul and backhaul cutomer conecutively. The firt neuron of the backhaul chain i aigned a the winner neuron in thi interaction. Thi mean that the algorithm at thi level i not anymore a competitive algorithm but a upervied one in the ene that the lat neuron of the linehaul chain ha to be attracted by the firt neuron of the backhaul chain. After thi aignment, the adaptation rule ha to be applied on the neuron of C n.we apply the ame procedure to the backahul chain, by preenting the firt neuron of C n to the firt chain, aigning the lat neuron of C m a the winner neuron and updating the poition of the neuron of C m according to the ame adaptation rule. (iv) Interaction between the two type of chain and the depot. Thi type of interaction i imilar to the lat one, where the depot i preented to the linehaul chain. The firt neuron of each C m i aigned to the depot and conidered a the winner neuron. Once thi neuron i aigned, we update thi neuron and it neighboring neuron according to the uual adaptation rule. The ame procedure i applied to the lat neuron of each chain C n. The poition of the neuron in the chain will give the poition of the cutomer in the route. 3 The CP-SOM Algorithm In thi ection the CP-SOM algorithm for VRPB i ketched in peudo-code. et u introduce the following additional notation: d: i the lateral ditance. δ, β: parameter to control the probability function ή, α : parameter to control adaptation rule t : iteration number Step 1: Initialization Step 2: Select a city randomly Step 3: Select a Winner neuron If (C belong to ) Then
5 Competitive Probabilitic Self-Organizing Map for Routing Problem I. Selection of the nearet neuron for each C m, et m be the winning neuron belonging to C m, i.e. Such that m m = ( X, X ) 1m 2m ( X X ) + ( X X ) ( X X ) + ( X X ) c 1m 2c 2m 1c 1i 2c 2i i = 1,,N 1 m = 1,,N v. d (C, m ) i the Euclidean ditance between C and II. Select the aigned chain according to the probability: 2 d (C, m) exp( m+ wm+ x3 k) exp( ) 1+ δ() t β() t PCC (, ) = m 2 d (C, m) exp( m+ wm+ x3 k) exp( ) 1+ δ() t β() t m m = 1,,N v. Aume C to be the aigned chain w = w + x3k Add C to N l III. Update the coordinate of each neuron in et C for example the x- coordinate i updated by the following rule: X 1 (t+1) = X 1 (t) + ή (t) Γ(C, ) ( x 1 C X 1 (t)), = 1,..., N. where 2 (, ) 1 d Γ ( C, ) = exp σ ( t ) If (C belong to B) Then I. Selection of the nearet neuron for each C n, B n et Bn be the winning neuron belonging to C n, i.e. uch that m B n = ( Y Y ) + ( Y Y ) ( Y Y ) + ( Y Y ) c 1m 2c 2m 1c 1i 2c 2i i = 1,,N 2 n = 1,,N v. II. Select the aigned chain according to the probability: 2 n 3i d (C, B ) exp( m+ g + y ) ~ exp( ) 1+ δ ( t) β ( t) P( C, Cn ) = d (C, B ) 2 exp( m+ gn+ y3i) exp( ) 1+ δ ( t) β ( t) n n = 1,,N v. ( Y, Y ) 1n 2n
6 WSOM 2005, Pari ~ Aume C to be the aigned chain g =g + y3k Add C to N b III. Update the coordinate of each neuron in et C ~ for example the x- coordinate i updated by the following rule: Y 1 (t+1) = Y 1 (t) + ή (t) Γ (C, = 1,..., N. where B ) ( Y 1 Y 1 (t)), 2 1 d ( B, B ) Γ ( C, B ) = exp σ ( t ) Step 4. Extremitie interaction: Apply the different type of Interaction Step 5. End-Iteration Tet: If Not {all cutomer are elected at the current iteration} Then go to Step 2. Step 6. Stopping Criterion: If {all cutomer are within 10-4 of their nearet neuron in the Euclidean pace} Then Stop 4. Computational Experience Our computational experience i deigned to analyze the performance of the CP-SOM in term of olution quality and computational requirement. The computational reult are reported uing a et of 33 intance, which were propoed in Toth & Vigo [8]. Thee intance are generated from the 11 claical intance of the VRP literature. The VRPB intance range in ize between 21 and 100 cutomer. For each VRP problem intance, three VRPB intance ρ = B are generated with ratio N -the number of backhaul cutomer over the total number of backhaul and linehaul cutomer- ranging from 50, 66 and 80%. Thee intance were alo ued to report the experimental experience of many reearcher, Toth and Vigo [9] and Waan and Oman [6]. The parameter are choen experimentally and are lowly decreaed at each iteration by 1%. The Algorithm i robut in term of parameter. The propoed algorithm for the VRPB are coded in C and run on a PC Intel Pentium MMX 233 MHz. The quality of an algorithm i meaured by the relative percentage deviation (RPD) of the olution value from it optimal olution, or bet-known value publihed in the literature and by the average of RPD over all intance (ARPD). Three SOM variant, CP-SOM, CP-SOM1 and CP-SOM2, were implemented for the VRPB. The main difference between them i baed on the way the local 2-opt optimization i embedded, while keeping invariant other parameter. The CP_SOM algorithm i the baic algorithm uing SOM principle. In C_SOM1 a 2-opt procedure i ued to improve the CP- SOM generated olution, whereacp-som2 call periodically the 2-opt procedure every 50 iteration within the CP-SOM implementation rather than only at the end a in CP-SOM1. The reult comparing the performance of the 3 variant are given in table 1. We can oberve that C
7 Competitive Probabilitic Self-Organizing Map for Routing Problem the pot-optimization ha improved the reult by 5% percent for large intance and around 2% for intance of 50 point. For mall intance CP-SOM i till getting the bet known reult. Thi mean, that the performance of the neural approach i good in the allocation tage but can be improved at the cheduling tage by a local earch procedure. CPU time for potoptimization i between 2 and 3% above the CP-SOM CPU time. Thi confirm that the neural network provide the olution while the improvement are due to the local earch. Comparing the CPU time with other technique uch a the reactive tabu earch [6] i not eay becaue of the ue of different machine and programming language. However, uing ome reaonnable approximation, it can be een that the CP-SOM algorithm require more CPU time than other algorithm when the vehicle capacity i tight and when the number of linehaul and backhaul cutomer are not balanced. Thi can be een epecially for the intance correponding to 100 cutomer. However, on average CP-SOM conume 20% CPU time le than the reactive tabu earch method for a performance that i 1.66% better. 5 Concluion The SOM heuritic variant CP-SOM1 and CP-SOM2 are deigned and implemented for the VRPB. Their comparion with the bet exiting heuritic how that they are competitive with repect to olution quality, but they require more computational effort, imilar to other neural network in the literature. In particular, CP-SOM1 heuritic i the bet performing algorithm for mall-ized intance up to 32 cutomer. Therefore, it mut be recommended for uch intance. For the medium to large intance, the performance of CP-SOM1 wa enhanced by embedding a periodic-improvement trategy within it implementation leading to CP-SOM2. In general, our SOM baed neural approach i by far more powerful, flexible and imple to implement than the Hopfield-Tank neural network method. Reference [1] J.J. Hopfield, & D.W. Tank, Neural computation of deciion in optimization problem. Biological Cybernetic, Vol. 52, pp , [2] J.C. Fort, Solving a combinatorial problem via elf-organizing proce: An application to the traveling aleman problem. Biological Cybernetic, Vol. 59, pp , [3] H. Ghaziri, Superviion in the elf-organizing feature map: application to the vehicle routing problem. In: I.H. Oman and J.P. Kelly, Meta-Heuritic: Theory and Application, ( pp ). Kluwer Academic publiher, Boton, [4] H. Ghaziri, & I. Oman, A neural network algorithm for traveling ale man problem With backhaul. Computer & Indutrial Engineering. Vol. 44, pp , [5]T. Kohonen, Self-Organizing Map. Springer-Verlag: Berlin, [6] I.H. Oman, & N.A. Waan, A reactive tabu earch for the vehicle routing problem with Backhaul. Journal of Scheduling, Vol 5, pp , [7] K.A. Smith, Neural network for combinatorial optimization: A review of more than a decade of reearch. INFORMS Journal on Computing, Vol. 11, pp , [8] P. Toth, & D. Vigo, A heuritic algorithm for the vehicle routing problem with backhaul. In Advanced Method in Tranportation Analyi, Bianco, pp , [9] P. Toth, & D. Vigo, A heuritic algorithm for the ymmetric and aymmetric vehicle routing problem with backhaul. European Journal of Operational Reearch, Vol. 113, pp , 1999.
8 WSOM 2005, Pari Table 1. Comparing the performance of the 3 SOM variant with the bet known reult CP-SOM1 N RPD CPU CP-SOM RPD CPU CP-SOM RPD CPU
Cutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationDAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationMarkov Random Fields in Image Segmentation
Preented at SSIP 2011, Szeged, Hungary Markov Random Field in Image Segmentation Zoltan Kato Image Proceing & Computer Graphic Dept. Univerity of Szeged Hungary Zoltan Kato: Markov Random Field in Image
More informationPreprint 1 (1997) 1{11 1. An improved ant system algorithm for the vehicle. routing problem. Bernd Bullnheimer, Richard F. Hartl and Christine Strauss
Preprint 1 (1997) 1{11 1 An improved ant ytem algorithm for the vehicle routing problem Bernd Bullnheimer, Richard F. Hartl and Chritine Strau Intitute of Management Science, Univerity of Vienna, Bruenner
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationA Practical Model for Minimizing Waiting Time in a Transit Network
A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor,
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationCENTER-POINT MODEL OF DEFORMABLE SURFACE
CENTER-POINT MODEL OF DEFORMABLE SURFACE Piotr M. Szczypinki Iintitute of Electronic, Technical Univerity of Lodz, Poland Abtract: Key word: Center-point model of deformable urface for egmentation of 3D
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationA study on turbo decoding iterative algorithms
Buletinul Ştiinţific al Univerităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 49(63, Facicola 2, 2004 A tudy on turbo decoding
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More informationA SIMPLE IMPERATIVE LANGUAGE THE STORE FUNCTION NON-TERMINATING COMMANDS
A SIMPLE IMPERATIVE LANGUAGE Eventually we will preent the emantic of a full-blown language, with declaration, type and looping. However, there are many complication, o we will build up lowly. Our firt
More informationComparison of Methods for Horizon Line Detection in Sea Images
Comparion of Method for Horizon Line Detection in Sea Image Tzvika Libe Evgeny Gerhikov and Samuel Koolapov Department of Electrical Engineering Braude Academic College of Engineering Karmiel 2982 Irael
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationOperational Semantics Class notes for a lecture given by Mooly Sagiv Tel Aviv University 24/5/2007 By Roy Ganor and Uri Juhasz
Operational emantic Page Operational emantic Cla note for a lecture given by Mooly agiv Tel Aviv Univerity 4/5/7 By Roy Ganor and Uri Juhaz Reference emantic with Application, H. Nielon and F. Nielon,
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationOn combining Learning Vector Quantization and the Bayesian classifiers for natural textured images
On combining Learning Vector Quantization and the Bayeian claifier for natural textured image María Guiarro Dept. Ingeniería del Software e Inteligencia Artificial Facultad Informática Univeridad Complutene
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationShortest Path Routing in Arbitrary Networks
Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,
More informationTexture-Constrained Active Shape Models
107 Texture-Contrained Active Shape Model Shuicheng Yan, Ce Liu Stan Z. Li Hongjiang Zhang Heung-Yeung Shum Qianheng Cheng Microoft Reearch Aia, Beijing Sigma Center, Beijing 100080, China Dept. of Info.
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationChapter S:II (continued)
Chapter S:II (continued) II. Baic Search Algorithm Sytematic Search Graph Theory Baic State Space Search Depth-Firt Search Backtracking Breadth-Firt Search Uniform-Cot Search AND-OR Graph Baic Depth-Firt
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationEdits in Xylia Validity Preserving Editing of XML Documents
dit in Xylia Validity Preerving diting of XML Document Pouria Shaker, Theodore S. Norvell, and Denni K. Peter Faculty of ngineering and Applied Science, Memorial Univerity of Newfoundland, St. John, NFLD,
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationPart 1 Data Collection Planning
N N Overview of the Lecture Data collection planning - (N), PC-(N), and (N)) Part Data Collection Planning Data Collection Planning al Problem Part I Traveling Saleman Problem () Jan Faigl Generalized
More informationA Sparse Shared-Memory Multifrontal Solver in SCAD Software
Proceeding of the International Multiconference on ISBN 978-83-6080--9 Computer Science and Information echnology, pp. 77 83 ISSN 896-709 A Spare Shared-Memory Multifrontal Solver in SCAD Software Sergiy
More informationOn successive packing approach to multidimensional (M-D) interleaving
On ucceive packing approach to multidimenional (M-D) interleaving Xi Min Zhang Yun Q. hi ankar Bau Abtract We propoe an interleaving cheme for multidimenional (M-D) interleaving. To achieved by uing a
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More informationA TOPSIS based Method for Gene Selection for Cancer Classification
Volume 67 No17, April 2013 A TOPSIS baed Method for Gene Selection for Cancer Claification IMAbd-El Fattah,WIKhedr, KMSallam, 1 Department of Statitic, 3 Department of Deciion upport, 2 Department of information
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationResearch Article Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks
International Optic Volume 0, Article ID 9, page http://dxdoiorg/0/0/9 Reearch Article Longet Path Reroute to Optimize the Optical Multicat Routing in Spare Splitting WDM Network Huanlin Liu, Hongyue Dai,
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationVARIABLE-DEPTH ADAPTIVE LARGE NEIGHBOURHOOD SEARCH ALGORITHM FOR OPEN PERIODIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS
VARIABLE-DEPTH ADAPTIVE LARGE NEIGHBOURHOOD SEARCH ALGORITHM FOR OPEN PERIODIC VEHICLE ROUTING PROBLEM WITH TIME WINDOWS Binhui Chen (a), Rong Qu (b), Hiao Ihibuchi (c) (a),(b) School of Computer Science,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION
ANALYSIS OF THE FIRST LAYER IN WEIGHTLESS NEURAL NETWORKS FOR 3_DIMENSIONAL PATTERN RECOGNITION A. Váque-Nava * Ecuela de Ingeniería. CENTRO UNIVERSITARIO MEXICO. DIVISION DE ESTUDIOS SUPERIORES J. Figueroa
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationA Boyer-Moore Approach for. Two-Dimensional Matching. Jorma Tarhio. University of California. Berkeley, CA Abstract
A Boyer-Moore Approach for Two-Dimenional Matching Jorma Tarhio Computer Science Diviion Univerity of California Berkeley, CA 94720 Abtract An imple ublinear algorithm i preented for two-dimenional tring
More informationA Novel Feature Line Segment Approach for Pattern Classification
12th International Conference on Information Fuion Seattle, WA, USA, July 6-9, 2009 A Novel Feature Line Segment Approach for Pattern Claification Yi Yang Intitute of Integrated Automation Xi an Jiaotong
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More informationEvolution of Non-Deterministic Incremental Algorithms. Hugues Juille. Volen Center for Complex Systems. Brandeis University. Waltham, MA
Evolution of Non-Determinitic Incremental Algorithm a a New Approach for Search in State Space Hugue Juille Computer Science Department Volen Center for Complex Sytem Brandei Univerity Waltham, MA 02254-9110
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationDelaunay Triangulation: Incremental Construction
Chapter 6 Delaunay Triangulation: Incremental Contruction In the lat lecture, we have learned about the Lawon ip algorithm that compute a Delaunay triangulation of a given n-point et P R 2 with O(n 2 )
More informationEmbedding Service Function Tree with Minimum Cost for NFV Enabled Multicast
1 Embedding Service Function Tree with Minimum ot for NFV Enabled Multicat angbang Ren, Student Member, IEEE, eke Guo, Senior Member, IEEE, Yulong Shen, Member, IEEE, Guoming Tang, Member, IEEE, Xu Lin,
More informationOptimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Optimal Multi-Robot Path Planning on Graph: Complete Algorithm and Effective Heuritic Jingjin Yu Steven M. LaValle Abtract arxiv:507.0390v [c.ro] Jul 05 We tudy the problem of optimal multi-robot path
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationISSN: (Online) Volume 3, Issue 4, April 2015 International Journal of Advance Research in Computer Science and Management Studies
ISSN: 2321-7782 (Online) Volume 3, Iue 4, April 2015 International Journal Advance Reearch in Computer Science and Management Studie Reearch Article / Survey Paper / Cae Study Available online at: www.ijarcm.com
More informationAn Image Edge Detection Algorithm using Wavelet Transform and Fuzzy Techniques
An Image Edge Detection Algorithm uing Wavelet Tranform and Fuzzy Technique Bin Huang 1*, Jiaofeng Wang,Xiaomei Jin 3 1.College of Teacher Education, Quzhou Univerity, Zheiang Quzhou, china. Quzhou Vocational
More informationarxiv: v1 [cs.ds] 27 Feb 2018
Incremental Strong Connectivity and 2-Connectivity in Directed Graph Louka Georgiadi 1, Giueppe F. Italiano 2, and Niko Parotidi 2 arxiv:1802.10189v1 [c.ds] 27 Feb 2018 1 Univerity of Ioannina, Greece.
More informationShortest Paths with Single-Point Visibility Constraint
Shortet Path with Single-Point Viibility Contraint Ramtin Khoravi Mohammad Ghodi Department of Computer Engineering Sharif Univerity of Technology Abtract Thi paper tudie the problem of finding a hortet
More informationxy-monotone path existence queries in a rectilinear environment
CCCG 2012, Charlottetown, P.E.I., Augut 8 10, 2012 xy-monotone path exitence querie in a rectilinear environment Gregory Bint Anil Mahehwari Michiel Smid Abtract Given a planar environment coniting of
More informationThe Data Locality of Work Stealing
The Data Locality of Work Stealing Umut A. Acar School of Computer Science Carnegie Mellon Univerity umut@c.cmu.edu Guy E. Blelloch School of Computer Science Carnegie Mellon Univerity guyb@c.cmu.edu Robert
More informationA Local Mobility Agent Selection Algorithm for Mobile Networks
A Local Mobility Agent Selection Algorithm for Mobile Network Yi Xu Henry C. J. Lee Vrizlynn L. L. Thing Intitute for Infocomm Reearch, 21 Heng Mui Keng Terrace, Singapore 119613 Email: {yxu, hlee, vriz}@i2r.a-tar.edu.g
More informationInternational Journal of Engineering Research & Technology (IJERT) ISSN: Vol. 2 Issue 5, May
Intertage Pipeline VLI Architecture for 2-D DWT Ajinkya. Bankar 1,Bhavika. haha 2, P.K. Kadbe 3 E&TC Department, Pune Univerity 1,2,3 VPCOE Baramati Abtract In thi paper, a cheme for the deign of a high-pd
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationAlgorithmic Discrete Mathematics 4. Exercise Sheet
Algorithmic Dicrete Mathematic. Exercie Sheet Department of Mathematic SS 0 PD Dr. Ulf Lorenz 0. and. May 0 Dipl.-Math. David Meffert Verion of May, 0 Groupwork Exercie G (Shortet path I) (a) Calculate
More informationFloating Point CORDIC Based Power Operation
Floating Point CORDIC Baed Power Operation Kazumi Malhan, Padmaja AVL Electrical and Computer Engineering Department School of Engineering and Computer Science Oakland Univerity, Rocheter, MI e-mail: kmalhan@oakland.edu,
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationAnalysis of slope stability
Engineering manual No. 8 Updated: 02/2016 Analyi of lope tability Program: Slope tability File: Demo_manual_08.gt In thi engineering manual, we are going to how you how to verify the lope tability for
More informationMirror shape recovery from image curves and intrinsic parameters: Rotationally symmetric and conic mirrors. Abstract. 2. Mirror shape recovery
Mirror hape recovery from image curve and intrinic parameter: Rotationally ymmetric and conic mirror Nuno Gonçalve and Helder Araújo Λ Intitute of Sytem and Robotic Univerity of Coimbra Pinhal de Marroco
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationA DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION
A DIVISIVE HIERARCHICAL CLUSTERING- BASED METHOD FOR INDEXING IMAGE INFORMATION ABSTRACT Najva Izadpanah Department of Computer Engineering, Ilamic Azad Univerity, Qazvin Branch, Qazvin, Iran In mot practical
More informationA neural network algorithm for the traveling salesman problem with backhauls
Computers & Industrial Engineering 44 (2003) 267 281 www.elsevier.com/locate/dsw A neural network algorithm for the traveling salesman problem with backhauls Hassan Ghaziri*, Ibrahim H. Osman School of
More informationIMPROVED JPEG DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION. Tak-Shing Wong, Charles A. Bouman, and Ilya Pollak
IMPROVED DECOMPRESSION OF DOCUMENT IMAGES BASED ON IMAGE SEGMENTATION Tak-Shing Wong, Charle A. Bouman, and Ilya Pollak School of Electrical and Computer Engineering Purdue Univerity ABSTRACT We propoe
More informationCERIAS Tech Report EFFICIENT PARALLEL ALGORITHMS FOR PLANAR st-graphs. by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daescu
CERIAS Tech Report 2003-15 EFFICIENT PARALLEL ALGORITHMS FOR PLANAR t-graphs by Mikhail J. Atallah, Danny Z. Chen, and Ovidiu Daecu Center for Education and Reearch in Information Aurance and Security,
More informationelse end while End References
621-630. [RM89] [SK76] Roenfeld, A. and Melter, R. A., Digital geometry, The Mathematical Intelligencer, vol. 11, No. 3, 1989, pp. 69-72. Sklanky, J. and Kibler, D. F., A theory of nonuniformly digitized
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier a a The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each b c circuit will be decribed in Verilog
More informationParallel MATLAB at FSU: Task Computing
Parallel MATLAB at FSU: Tak John Burkardt Department of Scientific Florida State Univerity... 1:30-2:30 Thurday, 07 April 2011 499 Dirac Science Library... http://people.c.fu.edu/ jburkardt/preentation/...
More informationTrainable Context Model for Multiscale Segmentation
Trainable Context Model for Multicale Segmentation Hui Cheng and Charle A. Bouman School of Electrical and Computer Engineering Purdue Univerity Wet Lafayette, IN 47907-1285 {hui, bouman}@ ecn.purdue.edu
More informationA PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED
A PROBABILISTIC NOTION OF CAMERA GEOMETRY: CALIBRATED VS. UNCALIBRATED Jutin Domke and Yianni Aloimono Computational Viion Laboratory, Center for Automation Reearch Univerity of Maryland College Park,
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More informationRepresentations and Transformations. Objectives
Repreentation and Tranformation Objective Derive homogeneou coordinate tranformation matrice Introduce tandard tranformation - Rotation - Tranlation - Scaling - Shear Scalar, Point, Vector Three baic element
More informationInterface Tracking in Eulerian and MMALE Calculations
Interface Tracking in Eulerian and MMALE Calculation Gabi Luttwak Rafael P.O.Box 2250, Haifa 31021,Irael Interface Tracking in Eulerian and MMALE Calculation 3D Volume of Fluid (VOF) baed recontruction
More information