Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
|
|
- Suzanna Simon
- 6 years ago
- Views:
Transcription
1 Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University of Technology, Melbourne, Australia montgomery@ict.swin.eu.au 2 School of Computer Science & IT, University of Nottingham, Nottingham, UK {cxf,sxp}@cs.nott.ac.uk Abstract. Prouction scheuling problems such as the ob shop consist of a collection of operations (groupe into obs) that must be scheule for processing on ifferent machines. Typical ant colony optimisation applications for these problems generate solutions by constructing a permutation of the operations, from which a eterministic algorithm can generate the actual scheule. This paper consiers an alternative approach in which each machine is assigne a ispatching rule, which heuristically etermines the orer of operations on that machine. This representation creates a substantially smaller search space that likely contains goo solutions. The performance of both approaches is compare on a real-worl ob shop scheuling problem in which processing times an ob ue ates are moelle with fuzzy sets. Results inicate that the new approach prouces better solutions more quickly than the traitional approach. Keywors: Ant colony optimisation, fuzzy ob shop scheuling, solution representation. Introuction Ant colony optimisation (ACO) is a constructive metaheuristic in which, uring successive iterations of solution construction, a number of artificial ants buil solutions by probabilistically selecting from problem-specific solution components, influence by a parameterise moel of solutions (calle a pheromone moel in reference to ant trail pheromones). The parameters of this moel are upate at the en of each iteration using the solutions prouce so that, over time, the algorithm learns which solution components shoul be combine to prouce the best solutions. When aapting ACO to suit a problem an algorithm esigner must first ecie how solutions are to be represente an built (i.e., what base components are to be combine to form solutions) an then what characteristics of the chosen representation are to be moelle. Corresponing author
2 Prouction scheuling problems consist of a number of obs, mae up of a set of operations, each of which must be scheule for processing on one of a number of machines. Preceence constraints are impose on the operations of each ob. The maority of ACO algorithms for these problems represent solutions as permutations of the operations to be scheule (operations are the base components of solutions), which etermines the relative orer of operations that require the same machine (see, e.g., [, 2]). A eterministic algorithm can then prouce the best possible scheule given the preceence constraints establishe by the permutation. This approach is more generally referre to as the list scheuler algorithm []. An alternative approach is to assign ifferent heuristics to each machine which etermine the relative processing orer of operations, thereby searching the reuce space of scheules that can be prouce by ifferent combinations of the heuristics [3]. Builing solutions in this manner may offer an avantage by concentrating the search on heuristically goo solutions. This paper compares these two solution representations by using a real-worl ob shop scheuling problem (JSP). A formal escription of the JSP is given in Section 2, incluing further etails of the two solution construction approaches. Section 3 escribes the real-worl JSP instance to which both approaches are applie, in which processing times an ue ates are moelle by fuzzy sets to reflect the uncertain nature of these in inustrial settings. Details of the ACO algorithms evelope for the fuzzy JSP are given in Section 4, followe by analysis of their empirical performance in Section 5. Section 6 escribes the implications of the results for the future application of ACO to such problems. An extene version of this paper, incluing more extensive empirical analyses, is presente in [9]. 2 Job Shop Scheuling an Solution Construction The JSP examine in this stuy consists of a set of n obs J,..., J n, with associate release ates r,..., r n an ue ates,..., n. Each ob consists of a sequence of operations (etermine by the processing requirements of the ob) that must each be scheule for processing on one of m machines M,..., M m. Only one operation of a ob may be processe at any given time, only one operation may use a machine at any given time an operations may not be preempte. Two criteria have to be minimise simultaneously, the average tariness of obs C AT an the number of tary obs C NT, calculate as follows: C AT = n n T () where T = max{0, C } is the tariness of of ob J an C is the completion time of ob J. n C NT = u (2) = =
3 where u = if T > 0, 0 otherwise. It is common in ACO applications for the JSP an relate scheuling problems to generate a permutation of the operations, which implicitly etermines the relative processing orer of operations on each machine. These algorithms are restricte to creating permutations that respect the require processing orer of operations within each ob, which can consequently be calle feasible permutations. A eterministic algorithm transforms the relative processing orer into an actual scheule. Different solution construction approaches prouce ifferent search spaces. The space of feasible permutations of operations for a JSP is very large (a weak upper boun is O(k!), where k is the number of operations) an is certainly much larger than the space of actual solutions. This space also has a slight bias towars goo solutions, which can be exploite by some pheromone moels an proves isastrous for others [0]. Another notable feature of this search space is that while all solutions can be reache, solutions (scheules) are represente by iffering numbers of permutations. An alternative approach to builing solutions is to assign ifferent ispatching rules (i.e., orering heuristics) to each machine, which subsequently buil the actual scheule [3]. The search space then becomes the space of all possible combinations of rules assigne to machines, which is O( D m ) where D is the set of rules an m the number of machines. Given a small number of ispatching rules (this stuy uses four, escribe in Section 4) it is highly probable that this search space is a subset of the space of all feasible scheules. However, assuming the ispatching rules are iniviually likely to perform well it is expecte that this reuce space largely consists of goo quality scheules. The performance of these two approaches is compare on a real-worl JSP instance, escribe in the next section. 3 A Real-Worl JSP The ata set use has been provie by a printing company, Sherwoo Press, in Nottingham, Unite Kingom [5]. There are 8 machines in the shop floor, groupe within seven work centres: printing, cutting, foling, car-inserting, embossing an ebossing, gathering, stitching an trimming, an packaging. Due to both machine an human factors, processing times of obs are uncertain an ue ates are not fixe but promise instea. Therefore, fuzzy sets are use to moel these uncertain values. A triangular membership function µ pi (t) = (p i, p2 i, p3 i ) is use to moel the fuzzy processing time p i of ob J on machine M i, i =,..., m, =,..., n, where p i an p3 i are lower an upper bouns of the processing time, while p 2 i is the so-calle moal point [7]. An example of fuzzy processing time is shown in Fig. (a). A trapezoial fuzzy set (, 2 ) is use to moel the ue ate of each ob, where is the crisp ue ate an the upper boun 2 of the trapezoi excees by 0%, following the policy of the company. An example of a fuzzy ue ate is given in Fig. (b).
4 µ ~ p i ( t) ~ p i µ ~ ( t) ~ p i p i p i t 0 2 t (a) (b) Fig.. Fuzzy (a) processing time an (b) ue ate µ(t) 0 ~ π ~ ( ) ~ C C ~ 2 (a) t µ(t) 0 ~ ~ ~ C I C ~ 2 (b) t Fig. 2. Satisfaction grae of tariness using (a) possibility measure an (b) area of intersection The obective function takes into account both the average tariness of obs an the number of tary obs. As these are measure in ifferent units they are mappe onto satisfaction graes in the range [0, ], which are then combine in an overall satisfaction grae. Two approaches use to measure tariness in [5] are investigate:. The possibility measure π C ( ), use by Itoh an Ishii [6] to hanle tary obs in a JSP, measures the satisfaction grae of a fuzzy completion time SG T ( C ) of ob J by evaluating the possibility of a fuzzy event C occurring within the fuzzy set [6] (illustrate in Fig. 2(a)): SG T ( C ) = π C ( ) = sup min{µ C (t), µ (t)} =,..., n (3) where µ C (t) an µ (t) are the membership functions of fuzzy sets C an respectively. This measure is referre to as poss hereafter. 2. The area of intersection measure (enote area hereafter), introuce by Sakawa an Kubota [], measures the proportion of C that is complete by the ue ate (illustrate in Fig. 2(b)): SG T ( C ) = (area C )/(area C ) (4) The satisfaction graes of tariness efine in (3) an (4) are use in two obectives:
5 . To maximise the satisfaction grae of average tariness S AT : S AT = n n SG T ( C ) (5) = 2. To maximise the satisfaction grae of number of tary obs S NT : A parameter λ is introuce such that a ob J, =,..., n, is consiere to be tary if SG T ( C ) λ, λ [0, ]. After calculating the number of tary obs nt ary, the satisfaction grae S NT is calculate as: if nt ary = 0 S NT = (n nt ary)/n if 0 < nt ary < n (6) 0 if nt ary > n where n = 5% of n, where n is the number of obs. Two ifferent aggregation operators, average an minimum (enote average an min hereafter), were investigate for combining the satisfaction graes of the obectives. 4 ACO for a Fuzzy JSP. Blum an Sampels [] take the minimum of the relevant pheromone values. Thus, the probability of selecting an available operation o to a to the partial permutation p is given by Two ACO algorithms were evelope base on the MAX MIN Ant System (MMAS), which has been foun to work well in practice [2]. The first of these, enote MMAS perm, constructs solutions as permutations of the operations, while the secon, enote MMAS rules, assigns ispatching rules to machines. The set of ispatching rules D consists of the following four rules: Early Due Date First, Shortest Processing Time First, Longest Processing Time First an Longest Remaining Processing Time First. The two solution representations require ifferent pheromone moels. The moels chosen have been foun to prouce the best performance for their respective solution representations [8]. For MMAS perm, a pheromone value, enote τ(o i, o ), exists for each irecte pair of operations that use the same machine, an represents the learne utility of operation o i preceing operation o []. At each step of solution construction, the set of unscheule operations that require the same machine as a caniate operation o is enote by O rel o P (o, p) = min or O rel o o p min o r O rel τ(o, o r ) o τ(o, o r ). (7) The last operation on each machine is scheule as soon as it becomes available. For MMAS rules, a pheromone value τ(m k, ) is associate with each combination of machine an ispatching rule (M k, ) M D, where M is the set
6 of machines. At each step of solution construction, a machine is assigne a ispatching rule. The probability of assigning a ispatching rule D to machine M k is given by τ(m k, ) P (M k, ) = D\{} τ(m k, ). (8) In both algorithms, after each iteration all pheromone values are reuce in proportion to (ρ ) while those for the iteration best solution s ib are increase by ρ F (s ib ), where ρ is the pheromone evaporation rate an F is the overall satisfaction grae of s ib (given by either the average or min aggregation operator). 5 Computational Results The performance of the algorithms was compare on one month s ata collecte from Sherwoo Press (the March set use by Faya an Petrovic [5]). The resulting JSP instance consists of 549 operations partitione into 59 obs. The algorithms were implemente in the C language an execute uner Linux on a 2.6GHz Pentium 4 with 52Mb of RAM. The MMAS control parameters use were: 0 ants per iteration; 3000 iterations; ρ = 0.; τ max = ; τ min = 0 3 in MMAS rules an τ min = 0 4 in MMAS perm. The values of τ min an τ max were chosen to approximate those suggeste by Stützle an Hoos [2] base on the size of the solution representation an pheromone upate. Both algorithms were execute with ifferent combinations of parameter values for solution evaluation: poss an area tariness measures, an average an min aggregation operators. The value of λ was fixe at 0.7. Each combination was run with 0 ifferent ranom sees. 5. Solution quality The results reveale that when using the min aggregation operator, MMAS perm is unable to fin a solution with a non-zero obective value. This is because the algorithm, facing a large number of solutions with S NT = 0, searches ranomly until a subset of pheromone values is upate. Further testing confirme that a ranom search of permutations is unlikely to prouce solutions with S NT > 0. A secon version of the algorithm, name MMAS min perm, was evelope in which the pheromone upate was moifie such that, if all solutions in an iteration have an obective value of zero, the best solution in terms of S AT is use to upate pheromone values using the average aggregation operator. Such a moification was not necessary for MMAS rules as ranom assignments of ispatching rules to machines typically prouce solutions with S NT > 0. Table summarises the satisfaction graes of tariness measures accoring to the aggregation operator use for each algorithm. It is evient that MMAS min perm is much more successful than its original form when using the min aggregation
7 Table. Performance of the algorithms. The best result for each measure is given with the mean value in parentheses. Bol items are best within each solution quality measure Algorithm F S AT S NT C NT Using poss an average MMAS perm 0.69 (0.62) 0.9 (0.9) 0.46 (0.34) 3 (5.9) MMAS rules 0.73 (0.73) 0.93 (0.93) 0.54 (0.53) (.2) Using poss an min MMAS perm (0.7) 0 48 (5.2) MMAS min perm 0.42 (0.35) 0.89 (0.88) 0.42 (0.35) 4 (5.5) MMAS rules 0.54 (0.53) 0.93 (0.93) 0.54 (0.53) (.3) Using area an average MMAS perm 0.62 (0.59) 0.90 (0.90) 0.33 (0.28) 6 (7.3) MMAS rules 0.7 (0.70) 0.93 (0.93) 0.50 (0.48) 2 (2.5) Using area an min MMAS perm (0.69) 0 49 (52.) MMAS min perm 0.42 (0.32) 0.88 (0.87) 0.42 (0.32) 4 (6.4) MMAS rules 0.50 (0.48) 0.93 (0.92) 0.50 (0.48) 2 (2.5) operator. Further investigation reveale that it require the use of the average aggregation operator in up to 33% of iterations. Across solution evaluation measures, MMAS rules clearly outperforms MMAS perm. 5.2 CPU time An orer of magnitue ifference was observe between the CPU time of the two algorithms, with MMAS perm taking more than 400 secons compare to approximately 00 secons for MMAS rules. This is to be expecte given the respective number of components each must consier at each constructive step; MMAS perm consiers approximately 40 operations on average, while MMAS rules consiers only four. Moreover, MMAS rules fins its best solutions very early in each run (often within secon) while MMAS perm oes not converge until quite late. 6 Conclusions Typical ACO algorithms for prouction scheuling problems such as the JSP buil solutions as permutations of the operations to be scheule, from which actual scheules are generate eterministically. An alternative approach when the problem in question has multiple machines an various criteria upon which to uge the urgency of competing operations is to assign ifferent ispatching rules to each machine. The chosen ispatching rules are then responsible for etermining the relative processing orer of operations on each machine. This paper compare both approaches on a multi-obective real-worl JSP, moelle
8 with fuzzy operation processing times an ob ue ates. The results show that assigning ispatching rules to machines prouces higher quality solutions in far less time than builing a permutation of the operations. This supports the claim that the assignment of ispatching rules restricts the search space to an area of goo quality solutions. As this stuy focuse on a single, real-worl JSP instance (albeit using a variety of solution quality measures) future work is require to etermine if these results hol for other prouction scheuling instances. Aitionally, it is now common practice in most ACO algorithms to use a local search proceure to improve the solutions prouce, something not one in this stuy so that ifferences between the two solution construction approaches coul be observe. While the aition of local search to a permutation-base ACO algorithm for these problems may allow it to perform better, it is potentially more useful in the new approach, where it can explore solutions that combinations of ispatching rules woul otherwise never prouce. References [] C. Blum an M. Sampels. An ant colony optimization algorithm for shop scheuling problems. J. Math. Moel. Algorithms, 3(3): , [2] A. Colorni, M. Dorigo, V. Maniezzo, an M. Trubian. Ant system for ob-shop scheuling. JORBEL, 34():39 53, 994. [3] U. Dornorf an E. Pesch. Evolution base learning in a ob shop scheuling environment. Comput. Oper. Res., 22:25 44, 995. [4] D. Dubois an P. H. Possibility theory: An approach to computerize processing of uncertainty. Kluwer Acaemic, New York, 988. [5] C. Faya an S. Petrovic. A fuzzy genetic algorithm for real-worl ob shop scheuling. In M. Ali an F. Esposito, eitors, Innovations in Applie Artificial Intelligence, volume 3533 of LNAI, pages , Springer-Verlag. [6] T. Itoh an H. Ishii. Fuzzy ue-ate scheuling problem with fuzzy processing time. Int. Trans. Oper. Res., 6: , 999. [7] G. Klir an T. Folger. Fuzzy sets, uncertainty an information. Prentice Hall, New Jersey, 988. [8] E. J. Montgomery. Solution biases an pheromone representation selection in ant colony optimisation. PhD thesis, Bon University, [9] J. Montgomery, C. Faya an S. Petrovic. Representation of solutions to ob shop scheuling problems in ant colony optimisation. Technical Report SUTICT- TR , Faculty of Information & Communication Technologies, Swinburne University of Technology, [0] J. Montgomery, M. Ranall, an T. Hentlass. Structural avantages for ant colony optimisation inherent in permutation scheuling problems. In M. Ali an F. Esposito, eitors, Innovations in Applie Artificial Intelligence, volume 3533 of LNAI, pages , Springer-Verlag. [] M. Sakawa an R. Kubota. Fuzzy programming for multiobective ob shop scheuling with fuzzy processing time an fuzzy ueate through genetic algorithms. Eur. J. Oper. Res., 20(2): , [2] T. Stützle an H. Hoos. MAX MIN ant system. Future Gen. Comp. Sys., 6:889 94, 2000.
Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Faculty of Information & Communication Technologies Solution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation James Montgomery, Carole Fayad 1 and Sanja Petrovic 1 1 School of
More informationAlternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation
Alternative Solution Representations for the Job Shop Scheduling Problem in Ant Colony Optimisation James Montgomery Complex Intelligent Systems Laboratory Centre for Information Technology Research Faculty
More informationA Genetic Algorithm for the Real-World Fuzzy Job Shop Scheduling
A Genetic Algorithm for the Real-World Fuzzy Job Shop Scheduling Carole Fayad and Sana Petrovic School of Computer Science and Information Technology University of Nottingham, Jubilee Campus, Wollaton
More informationStructural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems
Structural Advantages for Ant Colony Optimisation Inherent in Permutation Scheduling Problems James Montgomery No Institute Given Abstract. When using a constructive search algorithm, solutions to scheduling
More informationA shortest path algorithm in multimodal networks: a case study with time varying costs
A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via
More informationSolution Bias in Ant Colony Optimisation: Lessons for Selecting Pheromone Models
Solution Bias in Ant Colony Optimisation: Lessons for Selecting Pheromone Models James Montgomery Faculty of Information & Communication Technologies Swinburne University of Technology, VIC 3122, Australia
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationInverse Model to Determine the Optimal Number of Drops of RDC Column Using Fuzzy Approach
Inverse Moel to Determine the Optimal Number of Drops of RDC Column Using Fuzzy Approach 1 HAFEZ IBRAHIM, 2 JAMALLUDIN TALIB, 3 NORMAH MAAN Department of Mathematics Universiti Teknologi Malaysia 81310
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
More informationFrequency Domain Parameter Estimation of a Synchronous Generator Using Bi-objective Genetic Algorithms
Proceeings of the 7th WSEAS International Conference on Simulation, Moelling an Optimization, Beijing, China, September 15-17, 2007 429 Frequenc Domain Parameter Estimation of a Snchronous Generator Using
More informationOn Effectively Determining the Downlink-to-uplink Sub-frame Width Ratio for Mobile WiMAX Networks Using Spline Extrapolation
On Effectively Determining the Downlink-to-uplink Sub-frame With Ratio for Mobile WiMAX Networks Using Spline Extrapolation Panagiotis Sarigianniis, Member, IEEE, Member Malamati Louta, Member, IEEE, Member
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationComparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
More informationA New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
Worl Applie Sciences Journal 16 (10): 1387-1392, 2012 ISSN 1818-4952 IDOSI Publications, 2012 A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Base on Gravity Aliasghar Rahmani Hosseinabai,
More informationA MIMO Fuzzy Controller for tracking: Robot control. Carl Crane Professor, Mechanical Engineering University of Florida Gainesville, FL 32611
A MIMO Fuzzy Controller for tracking: Robot control Paul A.C. Mason Assistant Professor, Kevin Walchko Research Assistant Carl Crane Professor, Mechanical Engineering University of Floria Gainesville,
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationInterior Permanent Magnet Synchronous Motor (IPMSM) Adaptive Genetic Parameter Estimation
Interior Permanent Magnet Synchronous Motor (IPMSM) Aaptive Genetic Parameter Estimation Java Rezaie, Mehi Gholami, Reza Firouzi, Tohi Alizaeh, Karim Salashoor Abstract - Interior permanent magnet synchronous
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationAlgorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal
More informationVerifying performance-based design objectives using assemblybased vulnerability
Verying performance-base esign objectives using assemblybase vulnerability K.A. Porter Calornia Institute of Technology, Pasaena, Calornia, USA A.S. Kiremijian Stanfor University, Stanfor, Calornia, USA
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationWLAN Indoor Positioning Based on Euclidean Distances and Fuzzy Logic
WLAN Inoor Positioning Base on Eucliean Distances an Fuzzy Logic Anreas TEUBER, Bern EISSFELLER Institute of Geoesy an Navigation, University FAF, Munich, Germany, e-mail: (anreas.teuber, bern.eissfeller)@unibw.e
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationAn electromagnetism-inspired method for a generalized flowshop problem
Manufacturing Rev. 214, 1, 13 Ó M. Khalili, Publishe by EDP Sciences, 214 DOI: 1.151/mfreview/21413 Available online at: http://mfr.ep-open.org RESEARCH ARTICLE OPEN ACCESS An electromagnetism-inspire
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationFast Fractal Image Compression using PSO Based Optimization Techniques
Fast Fractal Compression using PSO Base Optimization Techniques A.Krishnamoorthy Visiting faculty Department Of ECE University College of Engineering panruti rishpci89@gmail.com S.Buvaneswari Visiting
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationDesign and Analysis of Optimization Algorithms Using Computational
Appl. Num. Anal. Comp. Math., No. 3, 43 433 (4) / DOI./anac.47 Design an Analysis of Optimization Algorithms Using Computational Statistics T. Bartz Beielstein, K.E. Parsopoulos,3, an M.N. Vrahatis,3 Department
More informationTracking and Regulation Control of a Mobile Robot System With Kinematic Disturbances: A Variable Structure-Like Approach
W. E. Dixon e-mail: wixon@ces.clemson.eu D. M. Dawson e-mail: awson@ces.clemson.eu E. Zergeroglu e-mail: ezerger@ces.clemson.eu Department of Electrical & Computer Engineering, Clemson University, Clemson,
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationCS 106 Winter 2016 Craig S. Kaplan. Module 01 Processing Recap. Topics
CS 106 Winter 2016 Craig S. Kaplan Moule 01 Processing Recap Topics The basic parts of speech in a Processing program Scope Review of syntax for classes an objects Reaings Your CS 105 notes Learning Processing,
More informationScalable Deterministic Scheduling for WDM Slot Switching Xhaul with Zero-Jitter
FDL sel. VOA SOA 100 Regular papers ONDM 2018 Scalable Deterministic Scheuling for WDM Slot Switching Xhaul with Zero-Jitter Bogan Uscumlic 1, Dominique Chiaroni 1, Brice Leclerc 1, Thierry Zami 2, Annie
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationImage compression predicated on recurrent iterated function systems
2n International Conference on Mathematics & Statistics 16-19 June, 2008, Athens, Greece Image compression preicate on recurrent iterate function systems Chol-Hui Yun *, Metzler W. a an Barski M. a * Faculty
More informationSelection Strategies for Initial Positions and Initial Velocities in Multi-optima Particle Swarms
ACM, 2011. This is the author s version of the work. It is poste here by permission of ACM for your personal use. Not for reistribution. The efinitive version was publishe in Proceeings of the 13th Annual
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationPreamble. Singly linked lists. Collaboration policy and academic integrity. Getting help
CS2110 Spring 2016 Assignment A. Linke Lists Due on the CMS by: See the CMS 1 Preamble Linke Lists This assignment begins our iscussions of structures. In this assignment, you will implement a structure
More informationAn Ant Approach to the Flow Shop Problem
An Ant Approach to the Flow Shop Problem Thomas Stützle TU Darmstadt, Computer Science Department Alexanderstr. 10, 64283 Darmstadt Phone: +49-6151-166651, Fax +49-6151-165326 email: stuetzle@informatik.tu-darmstadt.de
More informationSoftware Reliability Modeling and Cost Estimation Incorporating Testing-Effort and Efficiency
Software Reliability Moeling an Cost Estimation Incorporating esting-effort an Efficiency Chin-Yu Huang, Jung-Hua Lo, Sy-Yen Kuo, an Michael R. Lyu -+ Department of Electrical Engineering Computer Science
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationOptimizing the quality of scalable video streams on P2P Networks
Optimizing the quality of scalable vieo streams on PP Networks Paper #7 ASTRACT The volume of multimeia ata, incluing vieo, serve through Peer-to-Peer (PP) networks is growing rapily Unfortunately, high
More informationChapter 9 Memory Management
Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationYet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama and Hayato Ohwada Faculty of Sci. and Tech. Tokyo University of Scien
Yet Another Parallel Hypothesis Search for Inverse Entailment Hiroyuki Nishiyama an Hayato Ohwaa Faculty of Sci. an Tech. Tokyo University of Science, 2641 Yamazaki, Noa-shi, CHIBA, 278-8510, Japan hiroyuki@rs.noa.tus.ac.jp,
More information+ E. Bit-Alignment for Retargetable Code Generators * 1 Introduction A D T A T A A T D A A. Keen Schoofs Gert Goossens Hugo De Mant
Bit-lignment for Retargetable Coe Generators * Keen Schoofs Gert Goossens Hugo e Mant IMEC, Kapelreef 75, B-3001 Leuven, Belgium bstract When builing a bit-true retargetable compiler, every signal type
More informationA PSO Optimized Layered Approach for Parametric Clustering on Weather Dataset
Vol.3, Issue.1, Jan-Feb. 013 pp-504-508 ISSN: 49-6645 A PSO Optimize Layere Approach for Parametric Clustering on Weather Dataset Shikha Verma, 1 Kiran Jyoti 1 Stuent, Guru Nanak Dev Engineering College
More informationGenetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target
.IJCSI.org 67 Genetic Fuzzy Logic Control Technique for a Mobile Robot Tracking a Moving Target Karim Benbouaballah an Zhu Qi-an College of Automation, Harbin Engineering University Harbin, 151, China
More informationJournal of Cybernetics and Informatics. Slovak Society for Cybernetics and Informatics
Journal of Cybernetics an Informatics publishe by Slovak Society for Cybernetics an Informatics Volume 13, 1 http://www.sski.sk/casopis/inex.php (home page) ISSN: 1336-4774 Journal of Cybernetics an Informatics
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationOverlap Interval Partition Join
Overlap Interval Partition Join Anton Dignös Department of Computer Science University of Zürich, Switzerlan aignoes@ifi.uzh.ch Michael H. Böhlen Department of Computer Science University of Zürich, Switzerlan
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationHandling missing values in kernel methods with application to microbiology data
an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos
More informationMR DAMPER OPTIMAL PLACEMENT FOR SEMI-ACTIVE CONTROL OF BUILDINGS USING AN EFFICIENT MULTI- OBJECTIVE BINARY GENETIC ALGORITHM
24th International Symposium on on Automation & Robotics in in Construction (ISARC 2007) Construction Automation Group I.I.T. Maras MR DAMPER OPTIMAL PLACEMENT FOR SEMI-ACTIVE CONTROL OF BUILDINGS USING
More informationConsidering bounds for approximation of 2 M to 3 N
Consiering bouns for approximation of to (version. Abstract: Estimating bouns of best approximations of to is iscusse. In the first part I evelop a powerseries, which shoul give practicable limits for
More informationACE: And/Or-parallel Copying-based Execution of Logic Programs
ACE: An/Or-parallel Copying-base Execution of Logic Programs Gopal GuptaJ Manuel Hermenegilo* Enrico PontelliJ an Vítor Santos Costa' Abstract In this paper we present a novel execution moel for parallel
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationTop-down Connectivity Policy Framework for Mobile Peer-to-Peer Applications
Top-own Connectivity Policy Framework for Mobile Peer-to-Peer Applications Otso Kassinen Mika Ylianttila Junzhao Sun Jussi Ala-Kurikka MeiaTeam Department of Electrical an Information Engineering University
More informationIndexing the Edges A simple and yet efficient approach to high-dimensional indexing
Inexing the Eges A simple an yet efficient approach to high-imensional inexing Beng Chin Ooi Kian-Lee Tan Cui Yu Stephane Bressan Department of Computer Science National University of Singapore 3 Science
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationAnimated Surface Pasting
Animate Surface Pasting Clara Tsang an Stephen Mann Computing Science Department University of Waterloo 200 University Ave W. Waterloo, Ontario Canaa N2L 3G1 e-mail: clftsang@cgl.uwaterloo.ca, smann@cgl.uwaterloo.ca
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationWilliam S. Law. Erik K. Antonsson. Engineering Design Research Laboratory. California Institute of Technology. Abstract
Optimization Methos for Calculating Design Imprecision y William S. Law Eri K. Antonsson Engineering Design Research Laboratory Division of Engineering an Applie Science California Institute of Technology
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationProvisioning Virtualized Cloud Services in IP/MPLS-over-EON Networks
Provisioning Virtualize Clou Services in IP/MPLS-over-EON Networks Pan Yi an Byrav Ramamurthy Department of Computer Science an Engineering, University of Nebraska-Lincoln Lincoln, Nebraska 68588 USA Email:
More informationInvestigation into a new incremental forming process using an adjustable punch set for the manufacture of a doubly curved sheet metal
991 Investigation into a new incremental forming process using an ajustable punch set for the manufacture of a oubly curve sheet metal S J Yoon an D Y Yang* Department of Mechanical Engineering, Korea
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationOptimal Distributed P2P Streaming under Node Degree Bounds
Optimal Distribute P2P Streaming uner Noe Degree Bouns Shaoquan Zhang, Ziyu Shao, Minghua Chen, an Libin Jiang Department of Information Engineering, The Chinese University of Hong Kong Department of EECS,
More informationOptimization of cable-stayed bridges with box-girder decks
Avances in Engineering Software 31 (2000) 417 423 www.elsevier.com/locate/avengsoft Optimization of cable-staye briges with box-girer ecks L.M.C. Simões*, J.H.J.O. Negrão Department of Civil Engineering,
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationComparative Study of Projection/Back-projection Schemes in Cryo-EM Tomography
Comparative Stuy of Projection/Back-projection Schemes in Cryo-EM Tomography Yu Liu an Jong Chul Ye Department of BioSystems Korea Avance Institute of Science an Technology, Daejeon, Korea ABSTRACT In
More informationResearch Article Hydrological Cycle Algorithm for Continuous Optimization Problems
Hinawi Journal of Optimization Volume 217, Article ID 382842, 25 pages https://oi.org/1.1155/217/382842 Research Article Hyrological Cycle Algorithm for Continuous Optimization Problems Ahma Weyan, Jacqueline
More informationKinematic Analysis of a Family of 3R Manipulators
Kinematic Analysis of a Family of R Manipulators Maher Baili, Philippe Wenger an Damien Chablat Institut e Recherche en Communications et Cybernétique e Nantes, UMR C.N.R.S. 6597 1, rue e la Noë, BP 92101,
More informationA Plane Tracker for AEC-automation Applications
A Plane Tracker for AEC-automation Applications Chen Feng *, an Vineet R. Kamat Department of Civil an Environmental Engineering, University of Michigan, Ann Arbor, USA * Corresponing author (cforrest@umich.eu)
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationAd-Hoc Networks Beyond Unit Disk Graphs
A-Hoc Networks Beyon Unit Disk Graphs Fabian Kuhn, Roger Wattenhofer, Aaron Zollinger Department of Computer Science ETH Zurich 8092 Zurich, Switzerlan {kuhn, wattenhofer, zollinger}@inf.ethz.ch ABSTRACT
More informationClustering using Particle Swarm Optimization. Nuria Gómez Blas, Octavio López Tolic
24 International Journal Information Theories an Applications, Vol. 23, Number 1, (c) 2016 Clustering using Particle Swarm Optimization Nuria Gómez Blas, Octavio López Tolic Abstract: Data clustering has
More information