Optimal planning of selective waste collection

Size: px
Start display at page:

Download "Optimal planning of selective waste collection"

Transcription

1 Sustanable Development and Plannng V 78 Optmal plannng of selectve aste collecton S. Racu, D. Costescu, E. Roşca & M. Popa Unversty Poltehnca of Bucharest, Romana Abstract The paper presents an optmsaton method for selectve aste collecton servces n unversty campuses n Bucharest. Based on geographc nformaton system (GIS) procedures and algorthms, an optmsaton method for selectve aste collecton servces s developed. The area of Bucharest Cty, the road netork, the locaton of the selectve aste collecton ponts n the man unversty campuses and the locaton of the collecton staton are organzed n GIS format. Complex geodatabase structures that allo solvng the large scale selectve aste collecton problem are desgned. The routng soluton that mnmses the total travel tme s determned takng nto consderaton the local road netork propertes and the locaton of the collecton staton for each category of aste (glass, paper and plastc). The methodology s appled for the man Unversty Campuses n Bucharest. The map th the routng soluton, the requred number of vehcles and the schedule for each category of aste and for each vehcle are obtaned. The developed method provdes nformatonal and technologcal support for publc authortes and selectve aste collecton operators. Keyords: selectve aste collecton, optmsaton, vehcle routng, schedulng, geographc nformaton system. Introducton The problem presented n ths paper s from a study carred out for the selectve aste collecton management system n unversty campuses n Bucharest. Wth over students, Bucharest s the greatest natonal unversty centre of Romana. There are over mportant unverstes th academc, admnstratve and resdental actvtes organzed n campuses spread out n dfferent areas of the cty. The campuses have dfferent organzaton systems, accordng th the structure, locaton, tradton and evoluton of each unversty. Due to the large WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne) do:0.249/sdp06

2 786 Sustanable Development and Plannng V number of the student and employees n all these campuses, selectve aste management s essental for mnmzng the mpact on the envronment. Snce 2006 the muncpal authorty n partnershp th aste collecton cooperatves and assocatons has been developng a selectve aste collecton management system. For the perod February July 2006 a plot project as appled for selectve collecton of paper, glass and paper n the area of Unversty Poltehnca of Bucharest. In that stage ere collected about kg recyclable astes, from hch 2000 kg paper, 7000 kg plastc and 3000 kg glass. Snce then the system has been developed n other campuses. Fgure shos the ncreasng volume of selectve aste collected n unversty campuses tonnes Paper Fgure : 2008 Plastc Glass Volume of selectve aste collected n unversty campuses. In order to ncrease the effcency and effectveness of the selectve collecton system, optmsaton methods are necessary for servces plannng. In ths paper e descrbe methods for vehcle routng and collecton servce schedulng. Examples for campuses located n one of the sx admnstratve sectors of the Bucharest are gven. 2 Selectve collecton model overve The optmsaton of selectve collecton servces mples solvng transport routng and schedulng problems. The objectves of these to combnatoral problems consst of mnmsng the total haulage tme, the fleet sze, the transport costs or an aggregated functon of the above mentoned. The problem s defned on a graph G ( J, D), here J K L ; K k, k2,..., k N s the vertex set ncludng the collecton aste centres or arehouses for paper, plastc and glass and L l, l2,..., lm s the vertex set ncludng the selectve collecton ponts here blue contaners for paper, yello contaner for plastc and green contaner for glass are located. The arc set s WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

3 Sustanable Development and Plannng V defned as 787 D (k, l j ) k K, l j L (l, l j ) l, l j L, j. Each arc has assocated a non-negatve value t j representng travel tme. Each selectve collecton pont l has assocated a non-negatve value t p representng the aste contaner pckng tme. Three contaners (for selectve paper, plastc and glass aste) th the capacty Vsel 3 m 3 are located n each collecton pont. On a sngle route, a vehcle can collect three contaners for the same category of aste (Fgure 2). Dfferent contaner fllng ntenstes are regstered for each type of aste. Therefore each selectve collecton pont has assocated a set of pckng perods T,2,3, here = for paper contaner, =2 for I plastc contaner and =3 for glass contaner. l k l2 l3 k2 l4 l l6 unloaded trp loaded trp Fgure 2: Examples of vehcle trp. The Vehcle Routng Problem (VRP) nvolves fndng a set of routes, startng and endng at one collecton centre, hch servces a set of selectve collecton ponts. The objectve functon s to mnmse the total travel tme. Let Z,2,..., Z max denote the set of trps that satsfy all the collectng demands for all categores of aste. The routng phase can be mathematcally expressed as: 3 N M M M Mnmze z z zj t j zj t j () z Z j j subject to 3 z Z z Z max WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne) (2)

4 788 Sustanable Development and Plannng V 3 N N z Z zj z max T z Z T j N (3),,2,3 mn T max T (4),,2,3, j,2,..., M () here z : decson varable; z f the trp z s planned for the aste ; z 0 otherse. : decson varable; z : 0 otherse. decson varable; z f zj : otherse. decson varable; zj f the centre k collect category of aste; the trp z starts from centre k and z 0 f the trp z serve the pont lj and zj 0 otherse. The objectve functon () measures the total travel tme of the system. Equaton (2) expresses the trp allocaton on aste category collecton. Relaton (3) s a constrant related to the type of the collecton centres. The restrctons (4) and () express the demand satsfacton restrctons. When for each collecton pont, a tme nterval I mn, max for pckng operaton s settled accordng th the locaton n the campus (facultes and admnstratve buldngs area or student resdental area), the problem turns nto a Vehcle Routng Problem th Tme Wndos (VRPTW). Bodn [] presented an overve of VRPTW optmsaton methods. In the case of selectve aste collecton presented n ths paper, a geographc nformaton system (GIS) model s developed for solvng VRPTW. Allocaton and routng procedure avalable n ArcGIS Netork Analyst Extenson are used. The secton 4 provdes a descrpton of the logcal structure desgned for the GIS model. In order to solve the VRPTW, e have to schedule the collectng trps accordng th the perodcally demands. The problem deals th fndng the subsets of collecton ponts, hch have to be served at the same tme. The next secton presents an algorthm for selectng and orderng the sets of selectve collecton contaners, hch are to be processed on a task. The algorthm s appled for each aste category and for the gven set of pckng perods. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

5 Sustanable Development and Plannng V 789 Vehcle routng problem s solved for each aste collecton centre and for each set of contaners obtaned as soluton n schedulng algorthm. Fnally, the detaled vehcle schedules are calculated, th respect to the tme ndo constrants. 3 Collecton plannng algorthm Dfferent determnstc schedulng methods are developed for practcal applcaton (Martelo et al. [2]). The problem of schedulng contaners pckng operaton needs a pecular approach. As mentoned before, the sets of pckng are gven for contaner locaton l L and for each category of perods T selectve aste,2,3. The frst step conssts n dentfyng the subsets of collecton ponts th smultaneous demands for a selectve aste category (Fgure 3). We descrbe belo the algorthm bult for solvng ths ssue. T T2 T3 l T T T3 T2 T22 T23 l2... lm T 2 TM TM2 TM3 TM TM TM2 TM3 λ2 λ Fgure 3: tme Gantt chart of pckng perods. We consder the follong parameters:, 2,..., M here,2,3 s the tme hen n the locaton l the contaner for the aste The vector of collectng tmes and have to be collect. The due date parameters j representng the tmes hen collecton operaton has to be processed for the aste. The set of tasks j ncludng all locaton lk hch have to be served at the tme j. The set of schedulng perod T,,2,3. max WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

6 790 Sustanable Development and Plannng V The algorthm for solvng the contaner allocaton on collecton tasks follos the next steps:. Parameter ntalzaton.. Assgn the gven perod to any collecton tme,2,..., M..2. Assgn for the frst teraton j and j mn j M T, and j..3. Assgn the maxmum perod to the schedulng perod Tmax max T. M 2. Iteraton 2.. For all,2,..., M, f T then j j l, and go to step Calculate the parameters for the next teraton mn j 3. M. Untl T j max go to step 2.. If j j, Tmax j then go to step 3. Savng the soluton 3.. Export the sets of task j n a table format, hch ll be used as nput data n the GIS model. 4 Vehcle routng model Based on geographc nformaton system (GIS) procedures, a model for solvng the vehcle routng problem s developed. The model s appled for dentfyng the routes startng and endng at one collecton centre and servng the set of selectve collecton contaners. The routng soluton that mnmses the total travel tme s determned takng nto consderaton the local road netork propertes and the locaton of the collecton contaners for each category of aste (glass, paper and plastc). Before the routng model could be constructed, preparng geospatal databases s necessary. The datasets used n the GIS model nclude: Area of admnstratve sectors of Bucharest Cty; Road netork; Area of unversty campuses; Locaton of the selectve aste collecton centres; Locaton of the selectve aste collecton contaners n the unversty campuses. The map representaton of the geospatal datasets s shon n fgure 4. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

7 Sustanable Development and Plannng V Legend Unversty campuses Collectng contaner Collecton Centre Fgure 4: Personal Geodatabase Map of the model features. Feature Data Set Selectve Collecton Sets Feature Class Collecton aste centres Paper Contaner Selectve Collecton System Plastc Contaner Glass Contaner Feature Data Set Bucharest Road Netork Feature Class Streets Netork Dataset Street Netork Fgure : Elements n netork datasets creaton. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne) 79

8 792 Sustanable Development and Plannng V In order to create a netork dataset and solvng the large scale selectve aste collecton problem s necessary to organse all the datasets n an ntegrated geodatabase structure (Fgure ). A netork dataset s created based on the road netork geospatal database. Connectvty rules are appled and tme and dstance attrbutes are used as evaluators n the netork dataset. Wth all the geospatal data dgtzed and necessary attrbutes added, the vehcle routng model can be bult. The ArcToolBox ArcGIS softare s used for creatng the model shon n Fgure 6. Procedure Make Route Layer s appled for the street netork dataset. The selectve collecton contaners are located on the route layer and Netork Analyst procedure s used for solvng the vehcle routng problem. CollectonNetork Model StreetNetork Make Route Layer Route Add Locaton Netork Analyst PaperContaner Solve PaperContaner RouteLayer Fgure 6: Flo chart of the vehcle routng GIS model. The model has to be successvely appled for each set of selectve aste contaners (paper, plastc and glass) and for all sets of task j establshed n the I prevous step. Case study The model descrbed before has been appled to optmse the selectve aste collecton system n unversty campuses located n the Sxth Admnstratve Sector of Bucharest. Fgure 4 shos the locaton of the selectve aste contaners and collectng arehouses. The prevous presented algorthm has been used n order to plannng the collecton servces. A collectng tasks selecton s presented n Table. The routng problem has been solved successvely for each task th the developed GIS model. The route layer resulted for the frst task s shon n Fgure 7. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

9 Sustanable Development and Plannng V Table : Collectng servces. OBJECTID CollectonPont W_Id Perod Allocaton Task Automatca #00 2 Rectorat #00 3 Mecanca 0 #003 4 Transportur 20 #006 IntrareVasleMlea 0 #003 6 P22 #00 7 Blocur_U #00 8 R 0 #003 9 Belvedere #00 0 R3 4 #00 ComplexLeu 0 #003 2 CantnaLeu #00 3 Grozavest 0 #003 4 Grozavest2 0 #003 ANEFS 2 Wahrehouse #03 # Drept 2 Wahrehouse #03 # CamneConstruct 7 Wahrehouse #03 #0302 Fgure 7: Route layers. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne) 793

10 794 Sustanable Development and Plannng V Each collectng pont needs 2 mnutes for loadng/unloadng the contaner. The total travel tme along all routes s calculated based on each arc travel tme from the netork dataset. Detaled schedule table are obtaned for each collectng vehcle. 6 Concluson Selectve aste collectng n unversty campuses s mportant for mnmzng the mpact on the envronment. The collecton servces have to be organsed n campuses th restrcted access and n traffc congested urban areas. In order to reduce the total costs, the vehcle fuel consumpton and pollutant emsson, effcent methods for plannng the recyclable aste collectng trps are necessary. GIS tools and procedure are useful for optmal plannng of selectve aste collecton. The GIS model presented n ths paper solves the routng problem. Addtonal programmng algorthm s necessary for plannng the collecton servces. The developed methods provde nformatonal and technologcal support for publc authortes and selectve aste collecton operators. Decson makers can also use the model to explore tradeoffs beteen plannng alternatves and dentfy the optmal soluton. The proposed model could be easly adapted for other practcal specal cases. Acknoledgement The paper has been supported by the research contract 920 Cvc Educaton for Selectve Waste Collecton n Unversty Campuses ECOSED, fundng by UEFISCDI/PNCDI-II. References [] Bodn, L.D., Tenty Years of Routng and Schedulng, Operatons Research, 38, pp. 7-79, 990. [2] Martelo, S., Laporte, G., Mnoux, M., Rbero, C. (eds). Survey n combnatoral optmzaton, Volume 3 of Annals of Dscrete Mathematcs, North-Holland, Amsterdam, 987. [3] ECOROM, ECOROM Annual Report, Bucurest, Romana, 20. [4] ESRI, ArcGIS9. Netork Analyst, Redlands, USA, 200. WIT Transactons on Ecology and the Envronment, Vol 0, 20 WIT Press.tpress.com, ISSN (on-lne)

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Greedy Technique - Definition

Greedy Technique - Definition Greedy Technque Greedy Technque - Defnton The greedy method s a general algorthm desgn paradgm, bult on the follong elements: confguratons: dfferent choces, collectons, or values to fnd objectve functon:

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

Support Vector Machines. CS534 - Machine Learning

Support Vector Machines. CS534 - Machine Learning Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

The Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks

The Impact of Delayed Acknowledgement on E-TCP Performance In Wireless networks The mpact of Delayed Acknoledgement on E-TCP Performance n Wreless netorks Deddy Chandra and Rchard J. Harrs School of Electrcal and Computer System Engneerng Royal Melbourne nsttute of Technology Melbourne,

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

Modelling a Queuing System for a Virtual Agricultural Call Center

Modelling a Queuing System for a Virtual Agricultural Call Center 25-28 July 2005, Vla Real, Portugal Modellng a Queung System for a Vrtual Agrcultural Call Center İnc Şentarlı, a, Arf Orçun Sakarya b a, Çankaya Unversty, Department of Management,06550, Balgat, Ankara,

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Load-Balanced Anycast Routing

Load-Balanced Anycast Routing Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance

More information

Solving Route Planning Using Euler Path Transform

Solving Route Planning Using Euler Path Transform Solvng Route Plannng Usng Euler Path ransform Y-Chong Zeng Insttute of Informaton Scence Academa Snca awan ychongzeng@s.snca.edu.tw Abstract hs paper presents a method to solve route plannng problem n

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

An Application of Network Simplex Method for Minimum Cost Flow Problems

An Application of Network Simplex Method for Minimum Cost Flow Problems BALKANJM 0 (0) -0 Contents lsts avalable at BALKANJM BALKAN JOURNAL OF MATHEMATICS journal homepage: www.balkanjm.com An Applcaton of Network Smplex Method for Mnmum Cost Flow Problems Ergun EROGLU *a

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

ELEC 377 Operating Systems. Week 6 Class 3

ELEC 377 Operating Systems. Week 6 Class 3 ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems

More information

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Algebraic Connectivity Optimization of the Air Transportation Network

Algebraic Connectivity Optimization of the Air Transportation Network Algebrac Connectvty Optmzaton of the Ar Transportaton Netork Gregore Spers, Peng We, Dengfeng Sun Abstract In transportaton netorks the robustness of a netork regardng nodes and lnks falures s a key factor

More information

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET

OPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor

More information

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide

Lobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.

More information

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm

Research of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm , pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,

More information

General Share-A-Ride Problem

General Share-A-Ride Problem General Share-A-Rde Problem Sesya Sr Purwant Department of Industral Engneerng, Insttut Tenolog Bandung, Bandung, Indonesa Department of Industral Management, Natonal Tawan Unversty of Scence and Technology,

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits

Repeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.

More information

On Some Entertaining Applications of the Concept of Set in Computer Science Course

On Some Entertaining Applications of the Concept of Set in Computer Science Course On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Graph-based Clustering

Graph-based Clustering Graphbased Clusterng Transform the data nto a graph representaton ertces are the data ponts to be clustered Edges are eghted based on smlarty beteen data ponts Graph parttonng Þ Each connected component

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech.

Air Transport Demand. Ta-Hui Yang Associate Professor Department of Logistics Management National Kaohsiung First Univ. of Sci. & Tech. Ar Transport Demand Ta-Hu Yang Assocate Professor Department of Logstcs Management Natonal Kaohsung Frst Unv. of Sc. & Tech. 1 Ar Transport Demand Demand for ar transport between two ctes or two regons

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION

CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION 24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and

More information

Cognitive Radio Resource Management Using Multi-Agent Systems

Cognitive Radio Resource Management Using Multi-Agent Systems Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE

ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton

More information

Available online at ScienceDirect. Procedia Engineering 137 (2016 ) GITSS2015

Available online at  ScienceDirect. Procedia Engineering 137 (2016 ) GITSS2015 Avalable onlne at www.scencedrect.com ScenceDrect Proceda Engneerng 137 (2016 ) 151 160 GITSS2015 Optmzaton of Urban Sngle-Lne Metro Tmetable for Total Passenger Travel Tme under Dynamc Passenger Demand

More information

A Mixed Linear Program for a Multi-Part Cyclic Hoist Scheduling Problem

A Mixed Linear Program for a Multi-Part Cyclic Hoist Scheduling Problem A Mxed Lnear Program for a MultPart Cyclc Host Schedulng Problem Adnen El Amraou,, MareAnge Maner, Abdellah El Moudn and Mohamed Benrejeb U.R. LARA Automatque, Ecole Natonale d Ingéneurs de Tuns, Tunse.

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS

A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and

Research Article. ISSN (Print) s k and. d k rate of k -th flow, source node and Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 2015; 3(4A):343-350 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com

More information

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub

More information

ESTABLECIMIENTO DE UNA RED DE DISTRIBUCIÓN EFICIENTE EN TÉRMINOS DE COSTES OPERACIONALES.

ESTABLECIMIENTO DE UNA RED DE DISTRIBUCIÓN EFICIENTE EN TÉRMINOS DE COSTES OPERACIONALES. UNIVERSIDAD PONTIFICIA COMILLAS ESCUELA TÉCNICA SUPERIOR DE INGENIERÍA (ICAI) INGENIERO INDUSTRIAL PROYECTO FIN DE CARRERA ESTABLECIMIENTO DE UNA RED DE DISTRIBUCIÓN EFICIENTE EN TÉRMINOS DE COSTES OPERACIONALES.

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

Using SAS/OR for Automated Test Assembly from IRT-Based Item Banks

Using SAS/OR for Automated Test Assembly from IRT-Based Item Banks Usng SAS/OR for Automated Test Assembly from IRT-Based Item Bans Yung-chen Hsu, GED Testng Servce, LLC, Washngton, DC Tsung-hsun Tsa, Research League, LLC, Matawan, J ABSTRACT In recent years, advanced

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

Decision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing

Decision Support for the Dynamic Reconfiguration of Machine Layout and Part Routing in Cellular Manufacturing Decson Support for the Dynamc Reconfguraton of Machne Layout and Part Routng n Cellular Manufacturng Hao W. Ln and Tomohro Murata Abstract A mathematcal based approach s presented to evaluate the dynamc

More information

UNIT 2 : INEQUALITIES AND CONVEX SETS

UNIT 2 : INEQUALITIES AND CONVEX SETS UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Cable optimization of a long span cable stayed bridge in La Coruña (Spain)

Cable optimization of a long span cable stayed bridge in La Coruña (Spain) Computer Aded Optmum Desgn n Engneerng XI 107 Cable optmzaton of a long span cable stayed brdge n La Coruña (Span) A. Baldomr & S. Hernández School of Cvl Engneerng, Unversty of Coruña, La Coruña, Span

More information

Loop Transformations, Dependences, and Parallelization

Loop Transformations, Dependences, and Parallelization Loop Transformatons, Dependences, and Parallelzaton Announcements Mdterm s Frday from 3-4:15 n ths room Today Semester long project Data dependence recap Parallelsm and storage tradeoff Scalar expanson

More information

Annales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization

Annales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization Annales Informatca AI 1 (2003) 277-284 Annales Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ Desgnng of multchannel optcal communcaton systems topologes crtera optmzaton Mrosław Hajder,

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

Sequential Projection Maximin Distance Sampling Method

Sequential Projection Maximin Distance Sampling Method APCOM & ISCM 11-14 th December, 2013, Sngapore Sequental Projecton Maxmn Dstance Samplng Method J. Jang 1, W. Lm 1, S. Cho 1, M. Lee 2, J. Na 3 and * T.H. Lee 1 1 Department of automotve engneerng, Hanyang

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations

Parallel Branch and Bound Algorithm - A comparison between serial, OpenMP and MPI implementations Journal of Physcs: Conference Seres Parallel Branch and Bound Algorthm - A comparson between seral, OpenMP and MPI mplementatons To cte ths artcle: Luco Barreto and Mchael Bauer 2010 J. Phys.: Conf. Ser.

More information

RESEARCH ON JOB-SHOP SCHEDULING PROBLEM BASED ON IMPROVED PARTICLE SWARM OPTIMIZATION

RESEARCH ON JOB-SHOP SCHEDULING PROBLEM BASED ON IMPROVED PARTICLE SWARM OPTIMIZATION Journal of heoretcal and Appled Informaton echnology 005-013 JAI & LLS. All rghts reserved. RESEARCH ON JOB-SHOP SCHEDULING PROBLEM BASED ON IMPROVED PARICLE SWARM OPIMIZAION 1 ZUFENG ZHONG 1 School of

More information

AGGREGATED MODELS TECHNIQUE FOR INTEGRATING PLANNING AND SCHEDULING OF PRODUCTION TASKS

AGGREGATED MODELS TECHNIQUE FOR INTEGRATING PLANNING AND SCHEDULING OF PRODUCTION TASKS Internatonal Journal of Modern Manufacturng Technologes ISSN 2067 3604, Vol III, No 1 / 2011 39 AGGREGATED MODELS TECHNIQUE FOR INTEGRATING PLANNING AND SCHEDULING OF PRODUCTION TASKS Ştefan Dumbravă Gheorghe

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Solving vehicle assignment problems by process-network synthesis to minimize cost and environmental impact of transportation

Solving vehicle assignment problems by process-network synthesis to minimize cost and environmental impact of transportation Ths s the author s fnal, peer-revewed manuscrpt as accepted for publcaton. The publsher-formatted verson may be avalable through the publsher s web ste or your nsttuton s lbrary. Solvng vehcle assgnment

More information

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming

Optimization Methods: Integer Programming Integer Linear Programming 1. Module 7 Lecture Notes 1. Integer Linear Programming Optzaton Methods: Integer Prograng Integer Lnear Prograng Module Lecture Notes Integer Lnear Prograng Introducton In all the prevous lectures n lnear prograng dscussed so far, the desgn varables consdered

More information

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm

Non-Split Restrained Dominating Set of an Interval Graph Using an Algorithm Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,

More information

NGPM -- A NSGA-II Program in Matlab

NGPM -- A NSGA-II Program in Matlab Verson 1.4 LIN Song Aerospace Structural Dynamcs Research Laboratory College of Astronautcs, Northwestern Polytechncal Unversty, Chna Emal: lsssswc@163.com 2011-07-26 Contents Contents... 1. Introducton...

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks

Decision Strategies for Rating Objects in Knowledge-Shared Research Networks Decson Strateges for Ratng Objects n Knowledge-Shared Research etwors ALEXADRA GRACHAROVA *, HAS-JOACHM ER **, HASSA OUR ELD ** OM SUUROE ***, HARR ARAKSE *** * nsttute of Control and System Research,

More information

A Min-Cost Flow Based Detailed Router for FPGAs

A Min-Cost Flow Based Detailed Router for FPGAs A Mn-Cost Flow Based Detaled Router for FPGAs eokn Lee Dept. of ECE The Unversty of Texas at Austn Austn, TX 78712 Yongseok Cheon Dept. of Computer cences The Unversty of Texas at Austn Austn, TX 78712

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

5 The Primal-Dual Method

5 The Primal-Dual Method 5 The Prmal-Dual Method Orgnally desgned as a method for solvng lnear programs, where t reduces weghted optmzaton problems to smpler combnatoral ones, the prmal-dual method (PDM) has receved much attenton

More information

Multi-objective Design Optimization of MCM Placement

Multi-objective Design Optimization of MCM Placement Proceedngs of the 5th WSEAS Int. Conf. on Instrumentaton, Measurement, Crcuts and Systems, Hangzhou, Chna, Aprl 6-8, 26 (pp56-6) Mult-objectve Desgn Optmzaton of MCM Placement Chng-Ma Ko ab, Yu-Jung Huang

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

CS246: Mining Massive Datasets Jure Leskovec, Stanford University CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd

More information

Learning to Project in Multi-Objective Binary Linear Programming

Learning to Project in Multi-Objective Binary Linear Programming Learnng to Project n Mult-Objectve Bnary Lnear Programmng Alvaro Serra-Altamranda Department of Industral and Management System Engneerng, Unversty of South Florda, Tampa, FL, 33620 USA, amserra@mal.usf.edu,

More information

Research on a Method of Geographical Information Service Load Balancing

Research on a Method of Geographical Information Service Load Balancing Research on a Method of Geographcal Informaton Servce oad Balancng Heyuan a, Yongxng a, Xue Zhyong a, Feng Tao a a X an Research Insttute of Surveyng and Mappng, X an, Shaanx, Chna; 305789861@qq.com; yongxngl2017@163.com;

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

A Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks

A Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks A Decentralzed Lfetme Maxmzaton Algorthm for Dstrbuted Applcatons n Wreless Sensor Networks Vrgna Pllon, Mauro Franceschell, Lug Atzor, Alessandro Gua Dept. of Electrcal and Electronc Engneerng, Unversty

More information

Session 5.3. Switching/Routing and Transmission planning

Session 5.3. Switching/Routing and Transmission planning ITU Regonal Semnar Belgrade Serba and Montenegro 20-24 24 June 2005 Sesson 5.3 Swtchng/Routng and Transmsson plannng volvng nfrastructures to NGN and related Plannng Strateges and Tools I.S. Sesson 5.3-1

More information

Distributed Model Predictive Control Methods For Improving Transient Response Of Automated Irrigation Channels

Distributed Model Predictive Control Methods For Improving Transient Response Of Automated Irrigation Channels Dstrbuted Model Predctve Control Methods For Improvng Transent Response Of Automated Irrgaton Channels Al Khodabandehlou, Alreza Farhad and Al Parsa Abstract Ths paper presents dstrbuted model predctve

More information

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events

More information

Design for Reliability: Case Studies in Manufacturing Process Synthesis

Design for Reliability: Case Studies in Manufacturing Process Synthesis Desgn for Relablty: Case Studes n Manufacturng Process Synthess Y. Lawrence Yao*, and Chao Lu Department of Mechancal Engneerng, Columba Unversty, Mudd Bldg., MC 473, New York, NY 7, USA * Correspondng

More information

Connection-information-based connection rerouting for connection-oriented mobile communication networks

Connection-information-based connection rerouting for connection-oriented mobile communication networks Dstrb. Syst. Engng 5 (1998) 47 65. Prnted n the UK PII: S0967-1846(98)90513-7 Connecton-nformaton-based connecton reroutng for connecton-orented moble communcaton networks Mnho Song, Yanghee Cho and Chongsang

More information

Report on On-line Graph Coloring

Report on On-line Graph Coloring 2003 Fall Semester Comp 670K Onlne Algorthm Report on LO Yuet Me (00086365) cndylo@ust.hk Abstract Onlne algorthm deals wth data that has no future nformaton. Lots of examples demonstrate that onlne algorthm

More information

On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast

On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast On Maxmzng the Lfetme of Delay-Senstve Wreless Sensor Networks wth Anycast Joohwan Km, Xaojun Ln, Ness B. Shroff, and Prasun Snha School of Electrcal and Computer Engneerng, Purdue Unversty Departments

More information

NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK

NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,

More information

Investigation of Transformations and Landscapes for Combinatorial Optimization Problems

Investigation of Transformations and Landscapes for Combinatorial Optimization Problems Investgaton of Transformatons and Landscapes for Combnatoral Optmzaton Problems Abstract - Ths paper deals wth an analyss of transformatons between combnatoral optmzaton problems and proposes an approach

More information

Analysis of Non-coherent Fault Trees Using Ternary Decision Diagrams

Analysis of Non-coherent Fault Trees Using Ternary Decision Diagrams Analyss of Non-coherent Fault Trees Usng Ternary Decson Dagrams Rasa Remenyte-Prescott Dep. of Aeronautcal and Automotve Engneerng Loughborough Unversty, Loughborough, LE11 3TU, England R.Remenyte-Prescott@lboro.ac.uk

More information