Ant Colony Optimisation
|
|
- Jonah McLaughlin
- 5 years ago
- Views:
Transcription
1 Ant Colony Optimisation Alexander Mathews, Angeline Honggowarsito & Perry Brown 1 Image Source:
2 Contents Introduction to Ant Colony Optimisation Natural Inspiration Ant System Advanced Ant Colony Optimisation Extensions to Ant System Max-Min Ant System Best-Worst Ant System Applications of Ant Colony Optimisation The Generalised Assignment Problem (Static) Packet-switched network Routing (Dynamic) 2
3 ACO:Introduction Originally proposed by Marco Dorigo in 1992 To solve the Travelling Salesman Problem (TSP) By simulation the movements of ants The original ACO was not competitive with specialised TSP algorithms Many improvements have been proposed ACO can be extended to solve generic optimisation problems Most applications are to routing and scheduling problems 3
4 Natural Inspiration Model the behaviour of ants searching for food Model based on experimental observations Ants mark a path to food using pheromone Other ants can detect the pheromone trail Ants tend to follow paths with more pheromone This is location based communication An ant trail. Source: Wikipedia, Ants, Retrieved 12/9/12 4
5 Natural Inspiration Example Ants leave the nest at regular intervals 50% take the top path 50% take the lower path Ants which find food return to the nest by a random path Ants taking the top path return first The top path starts to accumulate pheromone at A Ants leaving the nest tend to take the top path Has more pheromone Graphics adapted from: Dorigo et al
6 Towards an Algorithm Want to solve different problems those solved by real ants Intermediate nodes: are components of a solution Edges: are possible connections between components Food Sources: are a complete solutions (with a fitness) Virtual ants are allowed: Perfect memory: ants can exactly retrace their steps Variable pheromone strength: strength related to quality of solution found 6
7 Towards an Algorithm Typical example Travelling Salesman Problem (TSP) (Find the shortest cycle that visits every city once and only once) Intermediate nodes: are cities Edges: are paths between cities Food: A completed cycle of the graph Note: that nodes are cities not partially constructed tours. 7
8 Ant System (AS) We have: A population of ants (starting at random cities) Ants which construct one solution per iteration A simple heuristic giving the 'fitness' of an edge Only pheromone information kept to the next iteration 8
9 Ant System: Overview While not done: randomise ant positions For each ant: Construct a random tour For each edge: Evaporate pheromone For each ant: Lay pheromone on each edge in tour 9
10 Ant System: Overview Initialise the pheromone for every edge Construct a random tour Evaporate pheromone from every edge Increase the pheromone on edges in the random tour 10
11 Ant System: Overview After a number of iterations we get the optimal tour. Hopefully. 11
12 Ant System: Ant Movement Until a solution is completed: For each edge to a node not in the tour: Calculate heuristic for edge Check pheromone strength for edge Calculate attractiveness of edge Randomly select edge with probability based on attractiveness Attractiveness is calculated as: (Pheromone) α ( Heuristic) β (need normalise across outgoing edges to get a probability) 12
13 Ant System: Ant Movement An ant is at the green point trying to complete the tour Discard edges to nodes already in the tour Get the Heuristic and Pheromone values H(A) = = 200 H(B) = = 80 P(A) = 2, P(B) = 1 Calculate Attractiveness A(A) = 28.3 A(B) = 8.9 Convert to Probability P(A) = 0.76 P(B) = 0.24 An edge to (A) is likely 13
14 Parameters N : Number of ants α : Influence of the pheromone trail β : Influence of the heuristic ρ : Fraction of pheromone that evaporates Low evaporation leads to slower convergence & possibly better solutions Q : scales the strength of the pheromone laid Pheromone Strength= Q Length of Tour (Pheromone) α ( Heuristic) β 14
15 Termination Conditions Iteration/Time limit Solution is good enough Stagnation: Only one tour will be tried as the pheromone is too strong. Or: run forever to maintain a good solution to a dynamic problem. 15
16 Contents Introduction to Ant Colony Optimisation Natural Inspiration Ant System Advanced Ant Colony Optimisation Extensions to Ant System Max-Min Ant System Best-Worst Ant System Applications of Ant Colony Optimisation The Generalised Assignment Problem (Static) Packet-switched network Routing (Dynamic) 16
17 Elitist Ant System First improvement on Ant System Also called Elitist Strategy for Ant System Provide strong additional reinforcement to the arcs belonging to the best tour found Pheromone update rule 17
18 Elitist Ant System Appropriate value for parameter e allows EAS to: Find better tours Find them in a lower number of iterations Evaporation rule is implemented as in Ant System 18
19 Rank-Based Ant System Introduced by Bullnheimer, Hartl and Strauss in 1997 Ranking of pheromone update The m ants are ascending ranked based on solutions quality. (S 1, S 2,..., S m) Each ants deposit an amount of pheromone that decrease with its rank Experimental evaluation suggests that this system performs slightly better than EAS and significantly better than AS. 19
20 Ant Colony System Another extensions of Ant System Three major improvements Different transition rule, pseudo-random proportional rule Probability Distribution 20
21 ACS - Improvement Daemon triggers pheromone update Ant with global best solution, Sglobal-best Pheromone evaporation before update Online step-by-step pheromone trail update Rule: 21
22 Max-Min Ant System (MMAS) Developed by Stuzzle and Hoos in 1996 AS extension Similar to ACS, offline pheromone trail update Best Ant chosen to add pheromone Iteration-best ant or best-so-far ant Improve ant s solutions using local optimisers 22
23 MMAS - Extensions Pheromone trails range [ Tmin, Tmax ] Tmax : Tmin : constant factor lower than Tmax Pheromone trails are initialised to maximum allowed value Re-initialization of pheromone trails 23
24 Best-Worst Ant System Proposed by Cordon et al. in 1999 Incorporates Evolutionary Computation Transition rule and pheromone evaporation Similar with MMAS, use local optimisers to improve ant s solutions 24
25 Best-Worst Ant System Improvements: The best-worst pheromone trail update rule. Penalise all connection of the worst solution. Scurrent-worse Update rule: 25
26 BWAS Improvement Pheromone trail mutation for diversity in search process. Pheromone is mutated with probability Pm. Adding or substracting the same amount in each iteration mut(it,tthreshold) depend on the average of pheromone trails Re-initialization of the pheromone trail, setting every pheromone to T0 26
27 Contents Introduction to Ant Colony Optimisation Natural Inspiration Ant System Advanced Ant Colony Optimisation Extensions to Ant System Max-Min Ant System Best-Worst Ant System Applications of Ant Colony Optimisation The Generalised Assignment Problem (Static) Packet-switched network Routing (Dynamic) 27
28 Further applications of ACO Two major types of problem that ACO is particularly suited to (Static) NP-hard problems, including: Routing problems (e.g. TSP) Assignment problems (e.g. university timetabling) Scheduling problems (e.g. scheduling project tasks) Subset problems (e.g. multiple knapsack problem) Dynamic shortest path problems e.g. routing in packet-switched networks N.B.: The terms static and dynamic here refer to whether or not the problem instance changes at run-time 28
29 Defining the pheromone trails Key consideration for applications: decide what the pheromone trails should signify Relative positioning Trails represent the desirability of choosing a particular solution component j directly after some other component i Intuitively suited to problems for which the position of components in the overall sequence is inconsequential (e.g. in TSP, no preference as to which cities get visited sooner or later) Absolute positioning Trails represent the desirability of choosing a particular solution component j at the ith position in the sequence Intuitively suited to problems for which the position of components in the overall sequence is significant (e.g. in scheduling project tasks, different tasks are due by different dates) Either approach is possible for any problem, but the intuitive choices described above generally give much better performance 29
30 Example application: Generalised Assignment Problem (GAP) Example of a static NP-hard problem A number of tasks to be distributed among a number of agents, each with a limited capacity Assigning a particular task to a particular agent involves using a certain amount of that agent s capacity Each task-to-agent assignment also incurs a specific cost Goal is to minimise the total cost of assigning all tasks within the agents capacity constraints 30
31 Representing the problem graphically Both tasks and agents represented by nodes Ants must walk from task to agent to signify assignment, then back to next task until all tasks have been visited and assigned Tasks Agents 31
32 Representing the problem graphically Both tasks and agents represented by nodes Ants must walk from task to agent to signify assignment, then back to next task until all tasks have been visited and assigned Tasks Agents Assignment 32
33 Representing the problem graphically Both tasks and agents represented by nodes Ants must walk from task to agent to signify assignment, then back to next task until all tasks have been visited and assigned Tasks Agents Assignment Move on to next task 33
34 Representing the problem graphically Both tasks and agents represented by nodes Ants must walk from task to agent to signify assignment, then back to next task until all tasks have been visited and assigned Tasks Agents Assignment Move on to next task 34
35 Aspects of the problem representation Two types of pheromone deposits One to determine which agent to assign a particular task to (relative) Other to determine best order in which to assign tasks (absolute) Heuristic information (static) Our pre-existing knowledge of this particular problem suggests that assignments with low cost and/or capacity usage should be preferred Range of feasible solutions limited by capacity constraints Strategy: assign a task to an agent with sufficient remaining capacity whenever possible Ants that produce an infeasible solution (i.e. one that violates capacity constraints) may have their pheromone contribution reduced 35
36 Example application: packet-switched network routing (dynamic) Problem involves a network with links connecting pairs of nodes, reaching one node from another may involve traversing a number of links in sequence Each link has a cost associated with using it Goal to find minimum cost path between every pair of nodes Normally an easy problem, except that in this instance the link costs are subject to change over time ACO compared with several state-of-the-art algorithms for this application, performed superior to all of them 36
37 Aspects of the problem representation Two types of pheromone deposits One to determine which agent to assign a particular task to (relative) Other to determine best order in which to assign tasks (absolute) Heuristic information (static) Our pre-existing knowledge of this particular problem suggests that assignments with low cost and/or capacity usage should be preferred Range of feasible solutions limited by capacity constraints Strategy: assign a task to an agent with sufficient remaining capacity whenever possible Ants that produce an infeasible solution (i.e. one that violates capacity constraints) may have their pheromone contribution reduced 37
38 References M. Dorigo and T. Stutzle, "The ant colony optimization metaheuristic: algorithms, applications, and advances," in Handbook of Metaheuristics, Eds. F. Glover and G. Kochenberger, New York: Springer, 2003, pp M. Dorigo et al., "Ant colony optimization," IEEE Comput. Intell. Mag, vol. 1, (4), pp , Nov G. Di Caro and M. Dorigo, "AntNet: distributed stigmergetic control for communications networks," J. Artif. Int. Res., vol. 9, (1), pp , Aug
39 References B. Bullnheimer, R. F. Hartl and C. Strauss, A New Rank Based Version of the Ant System: A Computational Study. Central European Journal for Operations Research and Economics, 7(1):25-38, O. Cordon, F. Herrera, and T. Stützle, A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends. Mathware and Soft Computing, 9(2-3), pp , 2002h 39
40 References M.Dorigo and L. M. Gambardella. Ant Colony System: A cooperative learning approach to the travelling salesman problem. IEEE Transaction on Evolutionary Computation, 1(1):53-66, T. Stützle and H. H. Hoos, MAX-MIN Ant System. Future Generation Computer Systems 40
41 References O.Cordon, I. Fernandez de Viana and F. Herrera and L. Moreno. A new ACO model integration evolutionary computation concepts: The best-worst Ant System. In M. Dorigo, M. Middendorf, and T.Stutzle, editors, Abstract proceedings of ANTS From Ant Colonies to Artificial Ants: A Series of International Workshops on Ant Algorithms, pages 22-29, IRIDIA, Universite Libre de Bruxelles, Belgium,
Ant Colony Optimization
Ant Colony Optimization Part 4: Algorithms Fall 2009 Instructor: Dr. Masoud Yaghini Ant Colony Optimization: Part 4 Outline The Traveling Salesman Problem ACO Algorithms for TSP Ant System (AS) Elitist
More informationOptimum Design of Water Conveyance System by Ant Colony Optimization Algorithms
Optimum Design of Water Conveyance System by Ant Colony Optimization Algorithms HABIBEH ABBASI, ABBAS AFSHAR, MOHAMMAD REZA JALALI Department of Civil Engineering Iran University of Science and Technology
More informationAnt Colony Optimization
Ant Colony Optimization Part 2: Simple Ant Colony Optimization Fall 2009 Instructor: Dr. Masoud Yaghini Outline Ant Colony Optimization: Part 2 Simple Ant Colony Optimization (S-ACO) Experiments with S-ACO
More informationIncorporating Psychology Model of Emotion into Ant Colony Optimization Algorithm
12th WSEAS Int. Conf. on APPLIED MATHEMATICS Cairo Egypt December 29-31 2007 222 Incorporating Psychology Model of Emotion into Ant Colony Optimization Algorithm Jiann-Horng Lin Department of Information
More informationSWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATION Abstract O. Deepa 1 and Dr. A. Senthilkumar 2 1 Research Scholar, Department of Computer Science, Bharathiar University, Coimbatore,
More informationAnt Colony Optimisation: From Biological Inspiration to an Algorithmic Framework
Ant Colony Optimisation: From Biological Inspiration to an Algorithmic Framework Technical Report: TR013 Daniel Angus dangus@ict.swin.edu.au Centre for Intelligent Systems & Complex Processes Faculty of
More informationIMPLEMENTATION OF EFFECTIVE BED ALLOCATION AND JOB SCHEDULING IN HOSPITALS USING ANT COLONY OPTIMIZATION
IMPLEMENTATION OF EFFECTIVE BED ALLOCATION AND JOB SCHEDULING IN HOSPITALS USING ANT COLONY OPTIMIZATION N.Gopalakrishnan Department of Biomedical Engineering, SSN College of Engineering, Kalavakkam. Mail
More informationAn Early Exploratory Method to Avoid Local Minima in Ant Colony System
An Early Exploratory Method to Avoid Local Minima in Ant Colony System 33 An Early Exploratory Method to Avoid Local Minima in Ant Colony System Thanet Satukitchai 1 and Kietikul Jearanaitanakij 2, Non-members
More informationRecapitulation of Ant Colony and Firefly Optimization Techniques
International Journal of Bioinformatics and Biomedical Engineering Vol. 1, No. 2, 2015, pp. 175-180 http://www.aiscience.org/journal/ijbbe Recapitulation of Ant Colony and Firefly Optimization Techniques
More informationAn Overview of Minimum Shortest Path Finding System Using Ant Colony Algorithm
An Overview of Minimum Shortest Path Finding System Using Ant Colony Algorithm Nikita G. Mugal Department of Information, Technology,Yeshwantrao Priyanka A. Solanke Nagpur,India. Rinku Dhadse Roshani Chandekar
More informationInternational Journal of Scientific & Engineering Research, Volume 7, Issue 12, December ISSN
International Journal of Scientific & Engineering Research, Volume 7, Issue 12, December-2016 332 Ant Colony Algorithms: A Brief Review and Its Implementation Renu Jangra Ph.D,Research Scholar Department
More informationAnt Systems of Optimization: Introduction and Review of Applications
International Journal of Electronics Engineering Research. ISSN 0975-6450 Volume 9, Number 2 (2017) pp. 275-279 Research India Publications http://www.ripublication.com Ant Systems of Optimization: Introduction
More informationA new idea for train scheduling using ant colony optimization
Computers in Railways X 601 A new idea for train scheduling using ant colony optimization K. Ghoseiri School of Railway Engineering, Iran University of Science and Technology, Iran Abstract This paper
More informationDepartment of Computer Science, BITS Pilani - K. K. Birla Goa Campus, Zuarinagar, Goa, India
Statistical Approach for Selecting Elite Ants Raghavendra G. S. Department of Computer Science, BITS Pilani - K. K. Birla Goa Campus, Zuarinagar, Goa, India Prasanna Kumar N Department of Mathematics,
More informationAPPLY ANT COLONY ALGORITHM TO TEST CASE PRIORITIZATION
APPLY ANT COLONY ALGORITHM TO TEST CASE PRIORITIZATION Chien-Li Shen* and Eldon Y. Li, Department of Information Management, College of Commerce National Chengchi University, Taiwan E-mail: 99356508@nccu.edu.tw,
More informationDesign and Development of Enhanced Optimization Techniques based on Ant Colony Systems
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 04 September 2016 ISSN (online): 2349-6010 Design and Development of Enhanced Optimization Techniques based on
More informationApplication of an Improved Ant Colony Algorithm in TSP Problem Solving
373 A publication of HEMIAL ENGINEERING TRANSATIONS VOL. 51, 2016 Guest Editors: Tichun Wang, Hongyang Zhang, Lei Tian opyright 2016, AIDI Servizi S.r.l., ISBN 978-88-95608-43-3; ISSN 2283-9216 The Italian
More informationA VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES. T. Van Woensel, L. Kerbache, H. Peremans and N. Vandaele
A VEHICLE ROUTING PROBLEM WITH STOCHASTIC TRAVEL TIMES T. Van Woensel, L. Kerbache, H. Peremans and N. Vandaele University of Antwerp, +32 3 220 40 69, tom.vanwoensel@ua.ac.be HEC School of Management,
More informationPresenting a New Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment
Presenting a New Ant Colony Optimization Algorithm (ACO) for Efficient Job Scheduling in Grid Environment Firoozeh Ghazipour Science and Research Branch Islamic Azad University, Kish, Iran Seyyed Javad
More informationSurekha P 1, S.Sumathi 2
Solving Fuzzy based Job Shop Scheduling Problems using Ga and Aco Surekha P 1, S.Sumathi 2 1 Research Scholar, EEE, PSG College of Technology, Coimbatore 2 Asst. Professor, EEE, PSG College of Technology,
More informationAPPLICATION OF ANT COLONY OPTIMISATION IN DISTRIBUTION TRANSFORMER SIZING
Nigerian Journal of Technology (NIJOTECH) Vol. 36, No. 4, October 2017, pp. 1233 1238 Copyright Faculty of Engineering, University of Nigeria, Nsukka, Print ISSN: 0331-8443, Electronic ISSN: 2467-8821
More informationAnt Colony Optimization Algorithm using Back-tracing and Diversification Strategy
, June 29 - July 1, 16, London, U.K. Ant Colony Optimization Algorithm using Bac-tracing and Diversification Strategy SeungGwan Lee and SangHyeo An Abstract We propose a new improved bio-inspired ant colony
More informationOPTIMIZATION OF LOGISTIC PROCESSES USING ANT COLONIES
OPTIMIZATION OF LOGISTIC PROCESSES USING ANT COLONIES C. A. Silva, T.A. Runkler J.M. Sousa, R. Palm Siemens AG Technical University of Lisbon Corporate Technology Instituto Superior Técnico Information
More informationSimulation based layout design of large sized multi-row Flexible Manufacturing Systems
Journal of Engineering & Architecture 1(1); June 13 pp. 34-44 Srinivas et al. Simulation based layout design of large sized multi-row Flexible Manufacturing Systems Srinivas C Dept. of Mechanical Engineering
More informationAn Approach for Solving Multiple Travelling Salesman Problem using Ant Colony Optimization
An Approach for Solving Multiple Travelling Salesman Problem using Ant Colony Optimization Krishna H. Hingrajiya University of Rajiv Gandhi Proudyogiki Vishwavidyalaya, Bhopal (M. P.), India Email: krishnahingrajiya@gmail.com
More informationRelative Study of CGS with ACO and BCO Swarm Intelligence Techniques
Relative Study of CGS with ACO and BCO Swarm Intelligence Techniques Abstract Ms. T.Hashni 1 Ms.T.Amudha 2 Assistant Professor 1, 2 P.S.G.R.Krishnammal College for Women 1, Bharathiar University 2 Coimbatore,
More informationAdvanced Metaheuristics. Daniele Vigo D.E.I. - Università di Bologna
Advanced Metaheuristics Daniele Vigo D.E.I. - Università di Bologna daniele.vigo@unibo.it Main families of Metaheuristics Single-solution methods Basic: Tabu Search, Simulated Annealing Advanced: Iterated
More informationUniversité Libre de Bruxelles
Université Libre de Bruxelles Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle An Experimental Study of Estimation-based Metaheuristics for the Probabilistic
More informationImprovement and Implementation of Best-worst Ant Colony Algorithm
Research Journal of Applied Sciences, Engineering and Technology 5(21): 4971-4976, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: July 31, 2012 Accepted: September
More informationAnt Colony Solution to Optimal Transformer Sizing Problem
Ant Colony Solution to Optimal Transformer Sizing Problem Elefterios I. Amoiralis 1, Marina A. Tsili 2, Pavlos S. Georgilais 1, and Antonios G. Kladas 2 1 Department of Production Engineering and Management
More informationANT COLONY ALGORITHM APPLIED TO FUNDAMENTAL FREQUENCY MAXIMIZATION OF LAMINATED COMPOSITE CYLINDRICAL SHELLS
ANT COLONY ALGORITHM APPLIED TO FUNDAMENTAL FREQUENCY MAXIMIZATION OF LAMINATED COMPOSITE CYLINDRICAL SHELLS Rubem M. Koide 1 *, Marco A. Luersen 1 ** 1 Laboratório de Mecânica Estrutural (LaMEs), Universidade
More informationOptimisation and Operations Research
Optimisation and Operations Research Lecture 17: Genetic Algorithms and Evolutionary Computing Matthew Roughan http://www.maths.adelaide.edu.au/matthew.roughan/ Lecture_notes/OORII/
More informationAn Improved Ant Colony Algorithm for Optimal Path of Travel Research and Simulation
2016 International Conference on Artificial Intelligence: Techniques and Applications (AITA 2016) ISBN: 978-1-60595-389-2 An Improved Ant Colony Algorithm for Optimal Path of Travel Research and Simulation
More informationArtificial Intelligence Breadth-First Search and Heuristic
Artificial Intelligence Breadth-First Search and Heuristic Chung-Ang University, Jaesung Lee The original version of this content is came from MIT OCW of MIT Electrical Engineering and Computer Science
More informationCloud Load Balancing Based on ACO Algorithm
Cloud Load Balancing Based on ACO Algorithm Avtar Singh, Kamlesh Dutta, Himanshu Gupta Department of Computer Science, National Institute of Technology,Hamirpur, HP, India Department of Computer Science,
More informationNatural Computing. Lecture 10: Ant Colony Optimisation INFR /10/2010
Natural Computing Lecture 10: Ant Colony Optimisation Michael Herrmann mherrman@inf.ed.ac.uk phone: 0131 6 517177 Informatics Forum 1.42 INFR09038 21/10/2010 蚁群算法 Marco Dorigo (1992). Optimization, Learning
More informationMetaheuristics. Approximate. Metaheuristics used for. Math programming LP, IP, NLP, DP. Heuristics
Metaheuristics Meta Greek word for upper level methods Heuristics Greek word heuriskein art of discovering new strategies to solve problems. Exact and Approximate methods Exact Math programming LP, IP,
More informationInsertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows. Marc Reimann Karl Doerner Richard F. Hartl
Insertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows Marc Reimann Karl Doerner Richard F. Hartl Report No. 68 June 2002 June 2002 SFB Adaptive Information Systems and Modelling
More informationNotes. Designing of type-i polymeric superlattices using genetic and ant algorithms: A comparative study
Indian Journal of Chemistry Vol. 48A, December 2009, pp. 1652-1656 Notes Designing of type-i polymeric superlattices using genetic and ant algorithms: A comparative study Avneet Kaur, Mohsineen Wazir,
More informationAnt Colony Optimization for Resource-Constrained Project Scheduling
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 6, NO. 4, AUGUST 2002 333 Ant Colony Optimization for Resource-Constrained Project Scheduling Daniel Merkle, Martin Middendorf, and Hartmut Schmeck Abstract
More informationComp215: Genetic Algorithms - Part 1
Comp215: Genetic Algorithms - Part 1 Mack Joyner, Dan S. Wallach (Rice University) Copyright 2016, Mack Joyner, Dan S. Wallach. All rights reserved. Darwin s Theory of Evolution Individual organisms differ
More informationParallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model
Parallel Ant Colony Optimization for 3D Protein Structure Prediction using the HP Lattice Model D. Chu, M. Till, A. Zomaya School of Information Technologies Madsen Building, F09 The University of Sydney
More informationWe are IntechOpen, the first native scientific publisher of Open Access books. International authors and editors. Our authors are among the TOP 1%
We are IntechOpen, the first native scientific publisher of Open Access boos 3,350 108,000 1.7 M Open access boos available International authors and editors Downloads Our authors are among the 151 Countries
More informationINTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION
Proceedings of the 1st International Conference on Computers & Industrial Engineering INTEGRATED PROCESS PLANNING AND SCHEDULING WITH SETUP TIME CONSIDERATION BY ANT COLONY OPTIMIZATION S.Y. Wan, T.N.
More informationOnline Publication. Keywords: Ant colony optimization, data mining, IoT smart device, smart city, smart waste management
Smart City Application: Internet of Things (IoT) Technologies Based Smart Waste Collection Using Data Mining Approach and Ant Colony Optimization Zeki ORALHAN 1, Burcu ORALHAN 2, and Yavuz YİĞİT 3 1 Department
More informationSolving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search
MIC2003: The Fifth Metaheuristics International Conference HASTS-1 Solving Multi-Objective Multi-Constraint Optimization Problems using Hybrid Ants System and Tabu Search Hoong Chuin LAU, Min Kwang LIM,
More informationSolution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization
Solution to a Multi Depot Vehicle Routing Problem Using K-means Algorithm, Clarke and Wright Algorithm and Ant Colony Optimization Pranavi Singanamala 1, Dr.K. Dharma Reddy, Dr.P.Venkataramaiah 3 1 M.Tech,
More informationA Viral Systems Algorithm for the Traveling Salesman Problem
Proceedings of the 2012 International Conference on Industrial Engineering and Operations Management Istanbul, Turkey, July 3 6, 2012 A Viral Systems Algorithm for the Traveling Salesman Problem Dedy Suryadi,
More informationCarleton University. Honours Project in Computer Science. Applying Ant Colony Optimization using local best tours to the Quadratic. Assignment Problem
Carleton University Honours Project in Computer Science Applying Ant Colony Optimization using local best tours to the Quadratic Assignment Problem Chris Kerr Student # 100199307 Supervisor: Dr. Tony White,
More informationF E M M Faculty of Economics and Management Magdeburg
OTTO-VON-GUERICKE-UNIVERSITY MAGDEBURG FACULTY OF ECONOMICS AND MANAGEMENT Metaheuristics for the Order Batching Problem in Manual Order Picking Systems Sebastian Henn Sören Koch Karl Doerner Christine
More informationWe are IntechOpen, the world s leading publisher of Open Access books Built by scientists, for scientists. International authors and editors
We are IntechOpen, the world s leading publisher of Open Access boos Built by scientists, for scientists 3,900 116,000 120M Open access boos available International authors and editors Downloads Our authors
More informationSelecting Quality Initial Random Seed For Metaheuristic Approaches: A Case Of Timetabling Problem
Abu Bakar Md Sultan, Ramlan Mahmod, Md Nasir Sulaiman, and Mohd Rizam Abu Bakar Selecting Quality Initial Random Seed For Metaheuristic Approaches: A Case Of tabling Problem 1 Abu Bakar Md Sultan, 2 Ramlan
More informationA Racing Algorithm for Configuring Metaheuristics
A Racing Algorithm for Configuring Metaheuristics Mauro Birattari Ý IRIDIA Université Libre de Bruxelles Brussels, Belgium Thomas Stützle, Luis Paquete, and Klaus Varrentrapp Intellektik/Informatik Technische
More informationOptimizing Large Scale Combinatorial Problems Using Multiple Ant Colonies Algorithm Based on Pheromone Evaluation Technique
54 Optimizing Large Scale Combinatorial roblems Using ultiple Ant Colonies Algorithm Based on heromone Ealuation Technique Alaa Aljanaby *, Ku Ruhana Ku ahamud **, and Norita d. Norwawi ** * Computer Science
More informationGenerational and steady state genetic algorithms for generator maintenance scheduling problems
Generational and steady state genetic algorithms for generator maintenance scheduling problems Item Type Conference paper Authors Dahal, Keshav P.; McDonald, J.R. Citation Dahal, K. P. and McDonald, J.
More informationA hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments
A hybrid ant algorithm for scheduling independent jobs in heterogeneous computing environments Graham Ritchie and John Levine Centre for Intelligent Systems and their Applications School of Informatics,
More informationModified Ant Colony Algorithm for Grid Scheduling
Modified Ant Colony Algorithm for Grid Scheduling Mr. P.Mathiyalagan 1, S.Suriya 2, Dr.S.N.Sivanandam 3 1 Lecturer, Department of Computer Science and Engineering, PSG College of Technology, Coimbatore.
More informationOptimizing the Construction Job Site Vehicle Scheduling Problem
sustainability Article Optimizing the Construction Job Site Vehicle Scheduling Problem Jaehyun Choi 1, Jia Xuelei 1 and WoonSeong Jeong 2, * ID 1 Department of Architectural Engineering, Korea University
More informationAN ANT COLONY APPROACH TO SOLVE A VEHICLE ROUTING PROBLEM IN A FMCG COMPANY SRINIVAS RAO T & PRAKASH MARIMUTHU K
International Journal of Mechanical and Production Engineering Research and Development (IJMPERD) ISSN(P): 2249-6890; ISSN(E): 2249-8001 Vol. 8, Issue 1 Feb 2018, 1113-1118 TJPRC Pvt. Ltd. AN ANT COLONY
More informationGENETIC ALGORITHMS. Narra Priyanka. K.Naga Sowjanya. Vasavi College of Engineering. Ibrahimbahg,Hyderabad.
GENETIC ALGORITHMS Narra Priyanka K.Naga Sowjanya Vasavi College of Engineering. Ibrahimbahg,Hyderabad mynameissowji@yahoo.com priyankanarra@yahoo.com Abstract Genetic algorithms are a part of evolutionary
More informationMulti Objective Optimization of Time Cost. Quality Quantity Using Multi Colony. Ant Algorithm
Int. J. Contemp. Math. Sciences, Vol. 7, 2012, no. 16, 773-784 Multi Objective Optimization of Time Cost Quality Quantity Using Multi Colony Ant Algorithm Rajesh Shrivastava*, Shweta Singh* and G. C. Dubey**
More informationANT COLONY OPTIMIZATION: SURVEY ON APPLICATIONS IN METALLURGY. Martin ČECH, Šárka VILAMOVÁ
ANT COLONY OPTIMIZATION: SURVEY ON APPLICATIONS IN METALLURGY Martin ČECH, Šárka VILAMOVÁ VŠB Technical University of Ostrava, 17. listopadu 15, Ostrava, 708 33 Ostrava, Czech Republic, EU, martin.cech@vsb.cz,
More informationMetaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example.
Metaheuristics for scheduling production in large-scale open-pit mines accounting for metal uncertainty - Tabu search as an example Amina Lamghari COSMO Stochastic Mine Planning Laboratory! Department
More informationUsing the Ant Colony Algorithm for Real-Time Automatic Route of School Buses
The International Arab Journal of Information Technology, Vol. 13, No. 5, September 2016 559 Using the Ant Colony Algorithm for Real-Time Automatic Route of School Buses Tuncay Yigit and Ozkan Unsal Department
More informationDesigning model protein chains using bioinspired ant algorithm
Indian Journal of Chemistry Vol. 48A, November 2009, pp. 1477-1483 Designing model protein chains using bioinspired ant algorithm Mohsineen Wazir & A K Bakhshi* Department of Chemistry, University of Delhi,
More informationAnt Colony Optimization for Train Scheduling: An Analysis
I.J. Intelligent Systems Applications, 214, 2, 29-36 Published Online January 214 in MECS (http://www.mecs-press.org/) DOI: 1.5815/ijisa.214.2.4 Ant Colony Optimization for Train Scheduling: An Analysis
More informationA Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems
A Solution Approach for the Joint Order Batching and Picker Routing Problem in Manual Order Picking Systems André Scholz Gerhard Wäscher Otto-von-Guericke University Magdeburg, Germany Faculty of Economics
More informationIT PROJECT DISTRIBUTION AUTOMATION
IT PROJECT DISTRIBUTION AUTOMATION 1 Aniket Kale, 2 Ajay Sonune, 3 Om Awagan, 4 Sandeep Chavan, 5 Prof. Rupali Dalvi 1, 2,3,4,5 Department of Computer Engineering, Marathwada Mitra Mandal s College of
More informationThe Nottingham eprints service makes this work by researchers of the University of Nottingham available open access under the following conditions.
Burke, Edmund and Eckersley, Adam and McCollum, Barry and Sanja, Petrovic and Qu, Rong (2003) Using Simulated Annealing to Study Behaviour of Various Exam Timetabling Data Sets. In: The Fifth Metaheuristics
More informationMATHEMATICAL MODELING OF MULTIPLE TOUR
Please refer to the following: Kota László, Jármai Károly Mathematical modeling of multiple tour multiple traveling salesman problem using evolutionary programming APPLIED MATHEMATICAL MODELLING 39:(12)
More informationCHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING
79 CHAPTER 4 PROPOSED HYBRID INTELLIGENT APPROCH FOR MULTIPROCESSOR SCHEDULING The present chapter proposes a hybrid intelligent approach (IPSO-AIS) using Improved Particle Swarm Optimization (IPSO) with
More informationImplementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms
Implementation of CSP Cross Over in Solving Travelling Salesman Problem Using Genetic Algorithms Karishma Mendiratta #1, Ankush Goyal *2 #1 M.Tech. Scholar, *2 Assistant Professor, Department of Computer
More informationUtilizing Optimization Techniques to Enhance Cost and Schedule Risk Analysis
1 Utilizing Optimization Techniques to Enhance Cost and Schedule Risk Analysis Colin Smith, Brandon Herzog SCEA 2012 2 Table of Contents Introduction to Optimization Optimization and Uncertainty Analysis
More informationPost-doc researcher, IRIDIA-CoDE, Université Libre de Bruxelles, Bruxelles, Belgium.
PaolaPellegrini Personal information Name Paola Pellegrini Address Bruxelles, Belgium E-mail paolap@pellegrini.it Nationality Italian Date of birth 11-25-1980 Research Interests Optimization, metaheuristics,
More informationAPPLICATION OF EVOLUTIONARY ALGORITHM IN SUPPLY CHAIN MANAGEMENT
64 International Journal of Computers, Systems and Signals, Vol. 6, No. 1, 2005 APPLICATION OF EVOLUTIONARY ALGORITHM IN SUPPLY CHAIN MANAGEMENT M.H. Lim and Y.L. Xu School of Electrical and Electronic
More informationSolution of a Bi-Objective Purchasing Scheduling Problem with Constrained Funds using Pareto Optimization
Solution of a Bi-Objective Purchasing Scheduling Problem with Constrained Funds using Pareto Optimization José Francisco Delgado-Orta 1, Laura Cruz-Reyes 2, Alejandro Palacios-Espinosa 3, and Christian
More informationApplying ant colony optimization (ACO) metaheuristic to solve forest transportation planning problems with side constraints
University of Montana ScholarWorks at University of Montana Graduate Student Theses, Dissertations, & Professional Papers Graduate School 2006 Applying ant colony optimization (ACO) metaheuristic to solve
More informationA Genetic Algorithm on Inventory Routing Problem
A Genetic Algorithm on Inventory Routing Problem Artvin Çoruh University e-mail: nevin.aydin@gmail.com Volume 3 No 3 (2014) ISSN 2158-8708 (online) DOI 10.5195/emaj.2014.31 http://emaj.pitt.edu Abstract
More informationEvolutionary Algorithms
Evolutionary Algorithms Evolutionary Algorithms What is Evolutionary Algorithms (EAs)? Evolutionary algorithms are iterative and stochastic search methods that mimic the natural biological evolution and/or
More informationImpressum ( 5 TMG) Herausgeber: Fakultät für Wirtschaftswissenschaft Der Dekan. Verantwortlich für diese Ausgabe:
WORKING PAPER SERIES Impressum ( 5 TMG) Herausgeber: Otto-von-Guericke-Universität Magdeburg Fakultät für Wirtschaftswissenschaft Der Dekan Verantwortlich für diese Ausgabe: Otto-von-Guericke-Universität
More informationAn Improved Ant Colony Algorithm with Diversified Solutions based on the Immune Strategy
Georgia State University ScholarWorks @ Georgia State University Computer Science Faculty Publications Department of Computer Science 2006 An Improved Ant Colony Algorithm with Diversified Solutions based
More informationKeywords: STATCOM, 330kv nigerian network, ant colony optimization (ACO), FACTS devices & MATLAB. GJRE-F Classification : FOR Code:
Global Journal of Researches in Engineering: F Electrical and Electronics Engineering Volume 4 Issue 3 Version. Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
More informationEvolutionary Computation
Evolutionary Computation Evolution and Intelligent Besides learning ability, intelligence can also be defined as the capability of a system to adapt its behaviour to ever changing environment. Evolutionary
More informationInternational Journal of Computer Engineering and Applications, Volume XI, Issue IX, September 17, ISSN
COMPARATIVE ANALYSIS OF TASK SCHEDULING ALGORITHMS IN CLOUD ENVIRONMENT D. Gupta 1*, Harmaninder Jit Singh Sidhu 2, G. Kumar 3 1* CSE, Desh Bhagat University, Mandi Gobindgarh, Punjab, India 2 CSE, Desh
More informationA Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests
A Particle Swarm Optimization Algorithm for Multi-depot Vehicle Routing problem with Pickup and Delivery Requests Pandhapon Sombuntham and Voratas Kachitvichayanukul Abstract A particle swarm optimization
More informationLogistics. Final exam date. Project Presentation. Plan for this week. Evolutionary Algorithms. Crossover and Mutation
Logistics Crossover and Mutation Assignments Checkpoint -- Problem Graded -- comments on mycourses Checkpoint --Framework Mostly all graded -- comments on mycourses Checkpoint -- Genotype / Phenotype Due
More informationMultiobjective Optimization. Carlos A. Santos Silva May 29 st, 2009
Multiobjective Optimization Carlos A. Santos Silva May 29 st, 2009 Motivation Usually, in optimization problems, there is more than one objective: Minimize Cost Maximize Performance The objectives are
More informationMultiobjective Optimization. Carlos A. Santos Silva
Multiobjective Optimization Carlos A. Santos Silva Motivation Usually, in optimization problems, there is more than one objective: Minimize Cost Maximize Performance The objectives are often conflicting:
More informationIMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM
IMPLEMENTATION OF AN OPTIMIZATION TECHNIQUE: GENETIC ALGORITHM TWINKLE GUPTA* Department of Computer Science, Hindu Kanya MahaVidyalya, Jind, India Abstract We are encountered with various optimization
More informationOPTIMISATION OF LARGE SCALE MAINTENANCE NETWORKS WITH EVOLUTIONARY PROGRAMMING
DAAAM INTERNATINAL SCIENTIFIC BK 2011 pp 495-512 CHAPTER 40 PTIMISATIN F LARGE SCALE MAINTENANCE NETWRKS WITH EVLUTINARY PRGRAMMING KTA, L Abstract: This study develops a single phase algorithm for the
More informationModeling the evolution of ant foraging strategies with genetic algorithms. Kenneth Letendre CS 365 September 4, 2012
Modeling the evolution of ant foraging strategies with genetic algorithms Kenneth Letendre kletendr@unm.edu CS 365 September 4, 2012 Harvester Ants Genus Pogonomyrmex A model organism for study of central
More informationENHANCED ANT COLONY ALGORITHM FOR GRID SCHEDULING
ENHANCED ANT COLONY ALGORITHM FOR GRID SCHEDULING D.Maruthanayagam Head, Department of computer Applications, Vivekanandha College of Arts Sciences for Women, Tiruchengode, Tamilnadu, India (kesimaruthu@gmail.com)
More informationMetaheuristics and Cognitive Models for Autonomous Robot Navigation
Metaheuristics and Cognitive Models for Autonomous Robot Navigation Raj Korpan Department of Computer Science The Graduate Center, CUNY Second Exam Presentation April 25, 2017 1 / 31 Autonomous robot navigation
More informationModeling and optimization of ATM cash replenishment
Modeling and optimization of ATM cash replenishment PETER KURDEL, JOLANA SEBESTYÉNOVÁ Institute of Informatics Slovak Academy of Sciences Bratislava SLOVAKIA peter.kurdel@savba.sk, sebestyenova@savba.sk
More informationMarco Dorigo, Mauro Birattari, and Thomas Stützle Université Libre de Bruxelles, BELGIUM
Marco Dorigo, Mauro Birattari, and Thomas Stützle Université Libre de Bruxelles, BELGIUM Ant Colony Optimization Artificial Ants as a Computational Intelligence Technique DIGITAL STOCK & COREL Swarm intelligence
More informationUsing Multi-chromosomes to Solve. Hans J. Pierrot and Robert Hinterding. Victoria University of Technology
Using Multi-chromosomes to Solve a Simple Mixed Integer Problem Hans J. Pierrot and Robert Hinterding Department of Computer and Mathematical Sciences Victoria University of Technology PO Box 14428 MCMC
More informationReducing Premature Convergence Problem in Genetic Algorithm: Application on Travel Salesman Problem
Computer and Information Science; Vol. 6, No. 1; 2013 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Science and Education Reducing Premature Convergence Problem in Genetic Algorithm:
More informationHeuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny
Heuristic Techniques for Solving the Vehicle Routing Problem with Time Windows Manar Hosny College of Computer and Information Sciences, King Saud University, Riyadh, Saudi Arabia mifawzi@ksu.edu.sa Keywords:
More informationSTRUCTURAL OPTIMIZATION USING ARTIFICIAL IMMUNE SYSTEM (AIS)
Blucher Mechanical Engineering Proceedings May 2014, vol. 1, num. 1 www.proceedings.blucher.com.br/evento/10wccm STRUCTURAL OPTIMIZATION USING ARTIFICIAL IMMUNE SYSTEM (AIS) Sai Sushank Botu 1, S V Barai
More informationOptimizing Dynamic Flexible Job Shop Scheduling Problem Based on Genetic Algorithm
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2017 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Optimizing
More information