An Ant Colony Optimization Approach to the Software Release Planning Problem
|
|
|
- Emerald Weaver
- 10 years ago
- Views:
Transcription
1 SBSE for Early Lifecyle Software Engineering 23 rd February 2011 London, UK An Ant Colony Optimization Approach to the Software Release Planning Problem with Dependent Requirements Jerffeson Teixeira de Souza, Ph.D Optimization in Software Engineering Group (GOES.UECE) State University of Ceará, Brazil
2 Nice to meet you, Jerffeson Teixeira de Souza, Ph.D. State University of Ceará, Brazil Professor
3 Our little time will be divided as follows Motivation Problem Definition Research Questions Problem Encoding The ACO Algorithm Experimental Evaluation Conclusion
4 Motivation The Search Based Software Engineering (SBSE) field has been benefited from a number of general search methods. Surprisingly, even with the large applicability and the significant results obtained by the Ant Colony Optimization (ACO) metaheuristic, very little has been done regarding the employment of this strategy to tackle software engineering problems modeled as optimization problems.
5 Ant Colony Optimization swarm intelligence framework, inspired by the behavior of ants during food search in nature. ACO mimics the indirect communication strategy employed by real ants mediated by pheromone trails, allowing óri individual ants to adapt their behavior to reflect the colony s search experience.
6 The software release planning problem addresses the selection and assignment of requirements to a sequence of releases, such that the most important and riskier requirements are anticipated, and both cost and precedence constraints are met.
7 The software release planning problem addresses the selection and assignment of requirements to a sequence of releases, such that the most important and riskier requirements are anticipated, and both cost and precedence constraints are met.
8 The software release planning problem addresses the selection and assignment of requirements to a sequence of releases, such that the most important and riskier requirements are anticipated, and both cost and precedence constraints are met.
9 The software release planning problem addresses the selection and assignment of requirements to a sequence of releases, such that the most important and riskier requirements are anticipated, and both cost and precedence constraints are met.
10 How can the ACO framework be adapted to solve the Software Release Planning problem in the presence of dependent requirements? ACO for the Software Release Planning problem
11 How can the ACO frameworkbe adapted to solve the Software Release Planning problem in the presence of dependent requirements? ACO for the Software Release Planning problem How does the proposed ACO adaptation compare to other metaheuristics in solving the Software Release Planning problem in the presence of dependent requirements? ACO versus Other Metaheuristics?
12 How can the ACO algorithm be adapted to solve the Software Release Planning problem in the presence of dependent requirements? ACO for the Software Release Planning problem THE ACO ALGORITHM
13 PROBLEM ENCONDING The problem will be encoded as a directed graph,, where, with representing mandatory moves, and representing optional ones. i. each vertex in represents a requirement ; ii. a directed mandatory edge, if ; iii. a directed optional edge, if and.
14 MORE PROBLEM ENCONDING if requirement has no precedent requirements and, for all unvisited requirements where
15 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) THE PROPOSED ACO ALGORITHM FOR THE SOFTWARE RELEASE PLANNING PROBLEM MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
16 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
17 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
18 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
19 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
20 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
21 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
22 OVERALL INITIALIZATION COUNT 1 MAIN LOOP REPEAT MAIN LOOP INITIALIZATION FOR ALL vertices r i V, visited i False FOR ALL vertices r i V, current_planning i 0 SINGLE RELEASE PLANNING LOOP // FINDS A NEW RELEASE PLANNING (current_planning) MAIN LOOP FINALIZATION IF current_planning.eval( ) > best_planning.eval( ) THEN best_planning current_planning COUNT ++ UNTIL COUNT > MAX_COUNT RETURN best_planning
23 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
24 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
25 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
26 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
27 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
28 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
29 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
30 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
31 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
32 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
33 // Besides r i, adds to release k all of its dependent requirements, and, repeatedly, their dependent requirements ADDS (r i, k) ENQUEUE (Q, r i ) WHILE Q DO r d DEQUEUE (Q) FOR EACH r s opt_vis k (i) DO ENQUEUE (Q, r s ) visited d True current_planning d k
34 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
35 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
36 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
37 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
38 SINGLE RELEASE PLANNING LOOP FOR EACH Release, k Randomly place ant k in a vertex r i V, where visited i False and overall_cost i budgetrelease k ADDS (r i, k) WHILE opt_vis k (i) 0 DO Move ant k to a vertex r j opt_vis k (i) with probability p k ij ADDS (r j, k) i j
39 EXPERIMENTAL EVALUATION RESULTS AND ANALYSES How does the proposed ACO adaptation compare to other metaheuristics in solving the Software Release Planning problem in the presence of dependent requirements? ACO versus Other Metaheuristics?
40 The Experimental Data Table below presents the number of releases, requirements and clients of the three synthetically generated instances used in the experiments. Instance Instance Features Name # Releases # Requirements # Clients INST.A INST.B INST.C
41 The Algorithms Genetic Algorithm (GA) widely applied evolutionary algorithm, inspired by Darwin s theory of natural selection, which simulates biological processes such as Inheritance, mutation, crossover, and selection Simulated Annealing (SA) it is a procedure for solving arbitrary optimization problems based on an analogy with the annealing process in solids.
42 Comparison Metrics Quality it relates to the quality of each generated solution, measured by the value of the objective function. Execution Time it measures the required execution time of each strategy.
43 RESULTS Instance GA SA ACO INST.A 8, ± , ± , ± INST.B 29, ± , ± 1, , ± INST.C 211, ± 3, , ± 8, , ± 2, Quality of Results for Instaces A, B anc C averages and standard deviations, over 100 executions
44 RESULTS Instance GA SA ACO INST.A ± ± ± INST.B 2, ± ± ± INST.C 125, ± , ± , ± Execution time (in milliseconds) for Instaces A, B anc C averages and standard deviations, over 100 executions
45 I N S T A Genetic Algorithm Simulated Annealing Ant Colony Optimization Boxplots showing maximum ( ), minimum ( ) and 25% - 75% quartile ranges of quality for all instances, for GA, SA and ACO.
46 Genetic Algorithm Simulated Annealing Ant Colony Optimization I N S T B Boxplots showing maximum ( ), minimum ( ) and 25% - 75% quartile ranges of quality for all instances, for GA, SA and ACO.
47 I N S T C Genetic Algorithm Simulated Annealing Ant Colony Optimization Boxplots showing maximum ( ), minimum ( ) and 25% - 75% quartile ranges of quality for all instances, for GA, SA and ACO.
48 Threats to Validity Small number, size and diversity of instances Artificial instances Parameterization of algorithms
49 Very little has been done regarding the employment of the Ant Colony Optimization (ACO) framework to tackle software engineering problems modeled as optimization problems. This talk described a novel ACO-based approach for the Software Release Planning problem with the presence of dependent requirement. All experimental results pointed out to the ability of the proposed ACO approach to generate precise solutions with very little computational effort. CONCLUSIONS
50 INVITATION II Brazilian Workshop on Optimization in Software Engineering along with XXV Brazilian Symposium on Software Engineering (SBES 2011) XV Brazilian Symposium on Programming Languages (SBLP 2011) XIV Brazilian Symposium on Formal Methods (SBMF 2011) V Brazilian Symposium on Software Components, Architectures and Reuse (SBCARS 2011) SÃO PAULO - SP, BRAZIL SEPTEMBER 26-30,
51 That is it! Thanks for your time and attention.
An Ant Colony Optimization Approach to the Software Release Planning Problem with Dependent Requirements
3rd InternaIonal Symposium on Search Based SoKware Engineering September 10 12, Szeged, Hungary An Ant Colony Optimization Approach to the Software Release Planning Problem with Dependent Requirements
Ant Colony Optimization Resource Allocation for Software Release Planning
Ant Colony Optimization Resource Allocation for Software Release Planning Jasmine Sabeena, K.Sree Divya, K.Santhi Department of CSE, S V College of Engineering, Tirupathi,India Abstract- Release planning
MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines
MuACOsm A New Mutation-Based Ant Colony Optimization Algorithm for Learning Finite-State Machines Daniil Chivilikhin and Vladimir Ulyantsev National Research University of IT, Mechanics and Optics St.
An ACO Approach to Solve a Variant of TSP
An ACO Approach to Solve a Variant of TSP Bharat V. Chawda, Nitesh M. Sureja Abstract This study is an investigation on the application of Ant Colony Optimization to a variant of TSP. This paper presents
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK
vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1
STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 [email protected],
Projects - Neural and Evolutionary Computing
Projects - Neural and Evolutionary Computing 2014-2015 I. Application oriented topics 1. Task scheduling in distributed systems. The aim is to assign a set of (independent or correlated) tasks to some
Ant Colony Optimization and Constraint Programming
Ant Colony Optimization and Constraint Programming Christine Solnon Series Editor Narendra Jussien WILEY Table of Contents Foreword Acknowledgements xi xiii Chapter 1. Introduction 1 1.1. Overview of the
Finding Liveness Errors with ACO
Hong Kong, June 1-6, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the
An Integer Programming Model for the School Timetabling Problem
An Integer Programming Model for the School Timetabling Problem Geraldo Ribeiro Filho UNISUZ/IPTI Av. São Luiz, 86 cj 192 01046-000 - República - São Paulo SP Brazil Luiz Antonio Nogueira Lorena LAC/INPE
An Improved ACO Algorithm for Multicast Routing
An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China [email protected]
Ant Colony Optimization (ACO)
Ant Colony Optimization (ACO) Exploits foraging behavior of ants Path optimization Problems mapping onto foraging are ACO-like TSP, ATSP QAP Travelling Salesman Problem (TSP) Why? Hard, shortest path problem
D A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
CHAPTER 6 MAJOR RESULTS AND CONCLUSIONS
133 CHAPTER 6 MAJOR RESULTS AND CONCLUSIONS The proposed scheduling algorithms along with the heuristic intensive weightage factors, parameters and ß and their impact on the performance of the algorithms
EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks
2 EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks Dac-Nhuong Le, Hanoi University of Science, Vietnam National University, Vietnam Optimizing location of controllers
TEST CASE SELECTION & PRIORITIZATION USING ANT COLONY OPTIMIZATION
TEST CASE SELECTION & PRIORITIZATION USING ANT COLONY OPTIMIZATION Bharti Suri Computer Science Department Assistant Professor, USIT, GGSIPU New Delhi, India [email protected] Shweta Singhal Information
14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
Numerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan [email protected],
Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine
Biogeography Based Optimization (BBO) Approach for Sensor Selection in Aircraft Engine V.Hymavathi, B.Abdul Rahim, Fahimuddin.Shaik P.G Scholar, (M.Tech), Department of Electronics and Communication Engineering,
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling
Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning
QoS Guaranteed Intelligent Routing Using Hybrid PSO-GA in Wireless Mesh Networks
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 1 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0007 QoS Guaranteed Intelligent Routing
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, [email protected]
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
ACO Based Dynamic Resource Scheduling for Improving Cloud Performance
ACO Based Dynamic Resource Scheduling for Improving Cloud Performance Priyanka Mod 1, Prof. Mayank Bhatt 2 Computer Science Engineering Rishiraj Institute of Technology 1 Computer Science Engineering Rishiraj
Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms
Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms Daniil Chivilikhin PhD student ITMO University Vladimir Ulyantsev PhD student ITMO University Anatoly Shalyto Dr.Sci.,
Requirements Selection: Knowledge based optimization techniques for solving the Next Release Problem
Requirements Selection: Knowledge based optimization techniques for solving the Next Release Problem José del Sagrado, Isabel M. del Águila, Francisco J. Orellana, and S. Túnez Dpt. Languages and Computation,
HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM. Jin-Lee KIM 1, M. ASCE
1560 HYBRID GENETIC ALGORITHM PARAMETER EFFECTS FOR OPTIMIZATION OF CONSTRUCTION RESOURCE ALLOCATION PROBLEM Jin-Lee KIM 1, M. ASCE 1 Assistant Professor, Department of Civil Engineering and Construction
A Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS
HYBRID ACO-IWD OPTIMIZATION ALGORITHM FOR MINIMIZING WEIGHTED FLOWTIME IN CLOUD-BASED PARAMETER SWEEP EXPERIMENTS R. Angel Preethima 1, Margret Johnson 2 1 Student, Computer Science and Engineering, Karunya
AN APPROACH FOR SOFTWARE TEST CASE SELECTION USING HYBRID PSO
INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 AN APPROACH FOR SOFTWARE TEST CASE SELECTION USING HYBRID PSO 1 Preeti Bala Thakur, 2 Prof. Toran Verma 1 Dept. of
. 1/ CHAPTER- 4 SIMULATION RESULTS & DISCUSSION CHAPTER 4 SIMULATION RESULTS & DISCUSSION 4.1: ANT COLONY OPTIMIZATION BASED ON ESTIMATION OF DISTRIBUTION ACS possesses
International Journal of Emerging Technologies in Computational and Applied Sciences (IJETCAS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) International Journal of Emerging Technologies in Computational
Management of Software Projects with GAs
MIC05: The Sixth Metaheuristics International Conference 1152-1 Management of Software Projects with GAs Enrique Alba J. Francisco Chicano Departamento de Lenguajes y Ciencias de la Computación, Universidad
A Comparative Study of Scheduling Algorithms for Real Time Task
, Vol. 1, No. 4, 2010 A Comparative Study of Scheduling Algorithms for Real Time Task M.Kaladevi, M.C.A.,M.Phil., 1 and Dr.S.Sathiyabama, M.Sc.,M.Phil.,Ph.D, 2 1 Assistant Professor, Department of M.C.A,
A Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0
212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET)
INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY (IJCET) International Journal of Computer Engineering and Technology (IJCET), ISSN 0976 6367(Print), ISSN 0976 6367(Print) ISSN 0976 6375(Online)
Optimization and Ranking in Web Service Composition using Performance Index
Optimization and Ranking in Web Service Composition using Performance Index Pramodh N #1, Srinath V #2, Sri Krishna A #3 # Department of Computer Science and Engineering, SSN College of Engineering, Kalavakkam-
An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem
An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem Challenge ROADEF/EURO 2010 Roman Steiner, Sandro Pirkwieser, Matthias Prandtstetter Vienna University of Technology, Austria Institute
Introduction. Swarm Intelligence - Thiemo Krink EVALife Group, Dept. of Computer Science, University of Aarhus
Swarm Intelligence - Thiemo Krink EVALife Group, Dept. of Computer Science, University of Aarhus Why do we need new computing techniques? The computer revolution changed human societies: communication
A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation
A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION
A DISTRIBUTED APPROACH TO ANT COLONY OPTIMIZATION Eng. Sorin Ilie 1 Ph. D Student University of Craiova Software Engineering Department Craiova, Romania Prof. Costin Bădică Ph. D University of Craiova
ACO Hypercube Framework for Solving a University Course Timetabling Problem
ACO Hypercube Framework for Solving a University Course Timetabling Problem José Miguel Rubio, Franklin Johnson and Broderick Crawford Abstract We present a resolution technique of the University course
Ant Colony Optimization for RDF Chain Queries for Decision Support
Ant Colony Optimization for RDF Chain Queries for Decision Support Alexander Hogenboom a,, Flavius Frasincar a, Uzay Kaymak b a Erasmus University Rotterdam, P.O. Box 1738, 3000 DR, Rotterdam, The Netherlands
Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware
Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Mahyar Shahsavari, Zaid Al-Ars, Koen Bertels,1, Computer Engineering Group, Software & Computer Technology
Ant colony optimization techniques for the vehicle routing problem
Advanced Engineering Informatics 18 (2004) 41 48 www.elsevier.com/locate/aei Ant colony optimization techniques for the vehicle routing problem John E. Bell a, *, Patrick R. McMullen b a Department of
A Review And Evaluations Of Shortest Path Algorithms
A Review And Evaluations Of Shortest Path Algorithms Kairanbay Magzhan, Hajar Mat Jani Abstract: Nowadays, in computer networks, the routing is based on the shortest path problem. This will help in minimizing
Computational intelligence in intrusion detection systems
Computational intelligence in intrusion detection systems --- An introduction to an introduction Rick Chang @ TEIL Reference The use of computational intelligence in intrusion detection systems : A review
Modified Ant Colony Optimization for Solving Traveling Salesman Problem
International Journal of Engineering & Computer Science IJECS-IJENS Vol:3 No:0 Modified Ant Colony Optimization for Solving Traveling Salesman Problem Abstract-- This paper presents a new algorithm for
ISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
Swarm Intelligence Algorithms Parameter Tuning
Swarm Intelligence Algorithms Parameter Tuning Milan TUBA Faculty of Computer Science Megatrend University of Belgrade Bulevar umetnosti 29, N. Belgrade SERBIA [email protected] Abstract: - Nature inspired
Optimised Realistic Test Input Generation
Optimised Realistic Test Input Generation Mustafa Bozkurt and Mark Harman {m.bozkurt,m.harman}@cs.ucl.ac.uk CREST Centre, Department of Computer Science, University College London. Malet Place, London
Manjeet Kaur Bhullar, Kiranbir Kaur Department of CSE, GNDU, Amritsar, Punjab, India
Volume 5, Issue 6, June 2015 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Multiple Pheromone
A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM
A SURVEY ON GENETIC ALGORITHM FOR INTRUSION DETECTION SYSTEM MS. DIMPI K PATEL Department of Computer Science and Engineering, Hasmukh Goswami college of Engineering, Ahmedabad, Gujarat ABSTRACT The Internet
Comparing Algorithms for Search-Based Test Data Generation of Matlab R Simulink R Models
Comparing Algorithms for Search-Based Test Data Generation of Matlab R Simulink R Models Kamran Ghani, John A. Clark and Yuan Zhan Abstract Search Based Software Engineering (SBSE) is an evolving field
Genetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
Intelligent Modeling of Sugar-cane Maturation
Intelligent Modeling of Sugar-cane Maturation State University of Pernambuco Recife (Brazil) Fernando Buarque de Lima Neto, PhD Salomão Madeiro Flávio Rosendo da Silva Oliveira Frederico Bruno Alexandre
A Performance Comparison of GA and ACO Applied to TSP
A Performance Comparison of GA and ACO Applied to TSP Sabry Ahmed Haroun Laboratoire LISER, ENSEM, UH2C Casablanca, Morocco. Benhra Jamal Laboratoire LISER, ENSEM, UH2C Casablanca, Morocco. El Hassani
Application Partitioning on Programmable Platforms Using the Ant Colony Optimization
Application Partitioning on Programmable Platforms Using the Ant Colony Optimization Gang Wang, Member, IEEE, Wenrui Gong, Student Member, IEEE, and Ryan Kastner, Member, IEEE Manuscript received Month
The ACO Encoding. Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson
The ACO Encoding Alberto Moraglio, Fernando E. B. Otero, and Colin G. Johnson School of Computing and Centre for Reasoning, University of Kent, Canterbury, UK {A.Moraglio, F.E.B.Otero, C.G.Johnson}@kent.ac.uk
Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms
Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti
Bachelor Thesis Performance comparison of heuristic algorithms in routing optimization of sequencing traversing cars in a warehouse
Bachelor Thesis Performance comparison of heuristic algorithms in routing optimization of sequencing traversing cars in a warehouse Minh Hoang Technische Universität Hamburg-Harburg supervised by: Prof.
A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS
A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS Mahdi Abbasi Iranagh 1 and Rifat Sonmez 2 Dept. of Civil Engrg, Middle East Technical University, Ankara, 06800, Turkey Critical path
An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment
IJCSC VOLUME 5 NUMBER 2 JULY-SEPT 2014 PP. 110-115 ISSN-0973-7391 An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment 1 Sourabh Budhiraja,
SmartPATH: An Efficient Hybrid. ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots
International Journal of Advanced Robotic Systems ARTICLE SmartPATH: An Efficient Hybrid immediate ACO-GA Algorithm for Solving the Global Path Planning Problem of Mobile Robots Regular Paper Imen Châari1,3,*,
A SURVEY ON WORKFLOW SCHEDULING IN CLOUD USING ANT COLONY OPTIMIZATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 2, February 2014,
Praktikum Wissenschaftliches Rechnen (Performance-optimized optimized Programming)
Praktikum Wissenschaftliches Rechnen (Performance-optimized optimized Programming) Dynamic Load Balancing Dr. Ralf-Peter Mundani Center for Simulation Technology in Engineering Technische Universität München
Proposed Software Testing Using Intelligent techniques (Intelligent Water Drop (IWD) and Ant Colony Optimization Algorithm (ACO))
www.ijcsi.org 91 Proposed Software Testing Using Intelligent techniques (Intelligent Water Drop (IWD) and Ant Colony Optimization Algorithm (ACO)) Laheeb M. Alzubaidy 1, Baraa S. Alhafid 2 1 Software Engineering,
Multi-Objective Ant Colony Optimization for Solving the Twin- Screw Extrusion Configuration Problem
Multi-Objective Ant Colony Optimization for Solving the Twin- Screw Extrusion Configuration Problem Cristina Teixeira*, J. A. Covas*, Thomas Stützle** and A. Gaspar-Cunha* *IPC/I3N-Institute for Polymer
Time-line based model for software project scheduling
Time-line based model for software project scheduling with genetic algorithms Carl K. Chang, Hsin-yi Jiang, Yu Di, Dan Zhu, Yujia Ge Information and Software Technology(IST), 2008 2010. 3. 9 Presented
Application of GA for Optimal Location of FACTS Devices for Steady State Voltage Stability Enhancement of Power System
I.J. Intelligent Systems and Applications, 2014, 03, 69-75 Published Online February 2014 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijisa.2014.03.07 Application of GA for Optimal Location of Devices
Resource Scheduling in Cloud using Bacterial Foraging Optimization Algorithm
Resource Scheduling in Cloud using Bacterial Foraging Optimization Algorithm Liji Jacob Department of computer science Karunya University Coimbatore V.Jeyakrishanan Department of computer science Karunya
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
BMOA: Binary Magnetic Optimization Algorithm
International Journal of Machine Learning and Computing Vol. 2 No. 3 June 22 BMOA: Binary Magnetic Optimization Algorithm SeyedAli Mirjalili and Siti Zaiton Mohd Hashim Abstract Recently the behavior of
COMPE 564/ MODES 662 Natural Computing
COMPE 564/ MODES 662 Natural Computing 2013 Fall Murat KARAKAYA Department of Computer Engineering COMPE 564 / MODES 662 Natural Computing Instructors : Murat KARAKAYA Email : [email protected]
GA as a Data Optimization Tool for Predictive Analytics
GA as a Data Optimization Tool for Predictive Analytics Chandra.J 1, Dr.Nachamai.M 2,Dr.Anitha.S.Pillai 3 1Assistant Professor, Department of computer Science, Christ University, Bangalore,India, [email protected]
Architectural Design for Space Layout by Genetic Algorithms
Architectural Design for Space Layout by Genetic Algorithms Özer Ciftcioglu, Sanja Durmisevic and I. Sevil Sariyildiz Delft University of Technology, Faculty of Architecture Building Technology, 2628 CR
Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm
Effective Load Balancing for Cloud Computing using Hybrid AB Algorithm 1 N. Sasikala and 2 Dr. D. Ramesh PG Scholar, Department of CSE, University College of Engineering (BIT Campus), Tiruchirappalli,
International Journal of Emerging Technology & Research
International Journal of Emerging Technology & Research An Implementation Scheme For Software Project Management With Event-Based Scheduler Using Ant Colony Optimization Roshni Jain 1, Monali Kankariya
An ant colony optimization for single-machine weighted tardiness scheduling with sequence-dependent setups
Proceedings of the 6th WSEAS International Conference on Simulation, Modelling and Optimization, Lisbon, Portugal, September 22-24, 2006 19 An ant colony optimization for single-machine weighted tardiness
HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL SEARCH
HYBRID OPTIMIZATION FOR GRID SCHEDULING USING GENETIC ALGORITHM WITH LOCAL SEARCH 1 B.RADHA, 2 Dr. V.SUMATHY 1 Sri Ramakrishna Engineering College, Department of MCA, Coimbatore, INDIA 2 Government College
Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm
Solving Traveling Salesman Problem by Using Improved Ant Colony Optimization Algorithm Zar Chi Su Su Hlaing and May Aye Khine, Member, IACSIT Abstract Ant colony optimization () is a heuristic algorithm
Cellular Automaton: The Roulette Wheel and the Landscape Effect
Cellular Automaton: The Roulette Wheel and the Landscape Effect Ioan Hălălae Faculty of Engineering, Eftimie Murgu University, Traian Vuia Square 1-4, 385 Reşiţa, Romania Phone: +40 255 210227, Fax: +40
Evolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,
An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling
An Improved Ant Colony Optimization Algorithm for Software Project Planning and Scheduling Avinash Mahadik Department Of Computer Engineering Alard College Of Engineering And Management,Marunje, Pune [email protected]
Optimal PID Controller Design for AVR System
Tamkang Journal of Science and Engineering, Vol. 2, No. 3, pp. 259 270 (2009) 259 Optimal PID Controller Design for AVR System Ching-Chang Wong*, Shih-An Li and Hou-Yi Wang Department of Electrical Engineering,
Coverage Criteria for Search Based Automatic Unit Testing of Java Programs
ISSN (Online): 2409-4285 www.ijcsse.org Page: 256-263 Coverage Criteria for Search Based Automatic Unit Testing of Java Programs Ina Papadhopulli 1 and Elinda Meçe 2 1, 2 Department of Computer Engineering,
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison
Random vs. Structure-Based Testing of Answer-Set Programs: An Experimental Comparison Tomi Janhunen 1, Ilkka Niemelä 1, Johannes Oetsch 2, Jörg Pührer 2, and Hans Tompits 2 1 Aalto University, Department
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis
Genetic Algorithm Based Interconnection Network Topology Optimization Analysis 1 WANG Peng, 2 Wang XueFei, 3 Wu YaMing 1,3 College of Information Engineering, Suihua University, Suihua Heilongjiang, 152061
Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
American J. of Engineering and Applied Sciences 3 (1): 7-14, 2010 ISSN 1941-7020 2010 Science Publications Production Scheduling for Dispatching Ready Mixed Concrete Trucks Using Bee Colony Optimization
Comparison of ACO and GA Techniques to Generate Neural Network Based Bezier-PARSEC Parameterized Airfoil
Comparison of ACO and GA Techniques to Generate Neural Network Based Bezier-PARSEC Parameterized Airfoil Waqas Saleem 1, Riaz Ahmad 2, Athar Kharal 3, Ayman Saleem 4 Abstract This research uses Neural
Alpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm
www.ijcsi.org 54 Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm Linan Zhu 1, Qingshui Li 2, and Lingna He 3 1 College of Mechanical Engineering, Zhejiang