Recapitulation of Ant Colony and Firefly Optimization Techniques
|
|
- David Ward
- 5 years ago
- Views:
Transcription
1 International Journal of Bioinformatics and Biomedical Engineering Vol. 1, No. 2, 2015, pp Recapitulation of Ant Colony and Firefly Optimization Techniques Anuradha *, Kshitiz Adlakha CSE&IT Dept., ITM University, Gurgaon, India Abstract This paper presents an analysis done on ACO and FFA optimization algorithms. Optimization algorithms have been used successfully to solve various problems in different areas. These algorithms are considered an important part of Swarm Intelligence, which refers to the social interaction of swarms of ants, termites, bees, termites and flock of birds. The methods used for the comparison are Max-Min Ant System, Ant Colony System, Rank-based Ant System and various hybrids/modified firefly algorithms. ACO and FFA can be modified and hybridized to solve diverse engineering problems. In most cases, the results provided by these algorithms meet the expected output. Keywords Ant, Firefly, ACO, Swarm Intelligence, Meta-Heuristic, Pheromone Received: July 1, 2015 / Accepted: August 8, 2015 / Published online: August 26, 2015 The Authors. Published by American Institute of Science. This Open Access article is under the CC BY-NC license Introduction Problems of optimization are found in almost all industries as well as in the scientific community. Logistical traffic routing, reducing the cost of manufacturing of products, travelling salesman problem are all examples of optimization problems. In the creation of Integrated Circuits (ICs) using the VLSI method, the placing of components of the board such as to maximize energy efficiency, minimize production cost is an important problem. Over the past 10 years, Swarm Intelligence [1] has become very popular. It includes the employment of multi-agent systems that are based on the actions of real world insect swarms for solving problems. The swarms that are observed show coordinated behaviour to proceed towards their goals, like searching for food and building sophisticated nests. This coordinated behaviour is a result of the interactions between the individuals of the swarms. Different insects interact in different ways with each other. Ants interact with a chemical pheromone trails to find the shortest path to their food sources, whereas bees interact with each other with a so-called waggle dance where the a few bees known as bee scouts lead the colony of bees towards the new food sources discovered by them. The bee colony must be aware of when to exploit the existing food sources and when to find the new ones, so as to maximize the nectar intake and minimize the scavenging effects. Many of the decisions like reproduction, division of important tasks are made in a distributed manner based on the native information obtained from the exchanges with their transitional surroundings [2]. 2. Ant Algorithms Ant algorithms and firefly algorithms are two of the most recent techniques developed in the field of swarm intelligence. Ant algorithm was originally developed in 1996 by Dorigo, Maniezzo, & Colorni, [3] while Firefly algorithm was developed by Yang in 2008 [4]. Both of these algorithms were later formalized into meta-heuristics. These algorithms are inspired by nature and can be applied to solve the hardest of * Corresponding author address: anudhull1910@gmail.com (Anuradha), kshitizadlakha@gmail.com (K. Adlakha)
2 176 Anuradha and Kshitiz Adlakha: Recapitulation of Ant Colony and Firefly Optimization Techniques optimization problems, including NP-hard problems. Fig 1 shows the shortest path followed by ant from source to food destination. Fig. 1. Shortest Path Experiment. The searching behaviour of ants in the wild was the original motivation towards the development of ant algorithms. Ants interact with each other by laying a pheromone trail, which they tend to follow. Experiments in the past have shown that ants are more likely to follow a trail with a greater concentration of pheromone. The above given figure shows an experiment, called the shortest path experiment [5], conducted to show the path followed by ants when they leave their nests in search for food. In the figure, N represents the nest of the ants and F represents the food. There are two possible paths to reach to the food from the nest, NDCBF and NDHBF. Initially, when the ants leave in search for food, half of the ants follow the left path and half of them follow the right one. The ants following the left path reach the food source quicker. As soon as an ant collects the food from the source it tracks its way back to the nest through the pheromone trail laid down earlier, on its way to the food source, while laying pheromone again, and thus strengthening the pheromone trail along the left path. Now any ants leaving the nest or returning from the food source are more likely to follow the path on the left, due to the high concentration of pheromone on this path. 3. Applications in Computer Science This behaviour of ants can be achieved in the computational world with the use of artificial ants (agents) that communicate through artificial pheromone trails. An artificial ant should have the following properties [6]. It should have an interior memory that stores all the previously visited locations. Each ant should try to find a likely solution to the problem starting from the initial state, iterating through its search environment. A specific pheromone update rule should govern the amount of artificial pheromone each agent/ant deposits while moving. Pheromone may be deposited with states or otherwise, during state transition. While the solution is being created, pheromone may deposit at each state transition. This is called the online step by step pheromone trial update. On the other hand, when ants retrace their path when a solution has been created and only then deposit pheromone on their trails, it is called online delayed pheromone update. Along with these properties on the ants of the wild, artificial ants have extra features which help them in advancing their performance. Some of these features that have been widely used in the past are local search and candidate list. The first ant algorithm was developed by Dorigo et al. in 1996 [3]. It was called the Ant System. It was successfully applied to the classic Travelling Salesman Problem (TSP). A TSP problem involves finding the shortest length to travel each town of a set of towns, M. The success of this algorithm led to the development of a lot of other ant algorithms. The first of these was the ACO meta-heuristic. It was developed in the 1999 by Dorigo & Di Caro [8]. It described the overall way of finding a solution to combinatorial problems by estimated solutions based on the standard behaviour of ants. Given below in Fig.2 is the algorithm of ant colony meta-heuristic: Fig. 2. The ant colony meta-heuristic. The main ACO algorithms are the Max-Min Ant System, Ant Colony System and Rank-based Ant System. In the Max-Min Ant System (MMAS) algorithm [7], the pheromone trail is updated by only the best ant-updates and unlike the original Ant System, the pheromone update function is bound. In the Ant Colony System [9], the pheromone update function is different from the one in the original Ant System. Just like the ants in the wild, in ACS a local pheromone update is applied along with the update of pheromone at the end of the each offline pheromone update. This offline pheromone update is applied by the iteration-best or best so far ant only, which is similar to the MMAS algorithm. In the Rank-based Ant System [10], the solutions of each ant are ranked in a decreasing order of the quality of their tour
3 International Journal of Bioinformatics and Biomedical Engineering Vol. 1, No. 2, 2015, pp length. The pheromone deposited by each ant depends upon the rank of the ant. The global-best solution receives extra amount of pheromone depending on the quality of the solution. Computational results (taken from Stutzle et al. (2000) [7]) displaying the optimum results of four ant algorithms as applied to three different TSP instances is shown in Fig.3. Fig. 3. Computational Results of famous ant colony optimization algorithms. 4. Advanced Ant Algorithms Over the past few years, there has been a lot a development in the field of Optimization, eventually leading to more specialized ant algorithms. Following the research there has been a significant rise in the applications of ant optimization techniques. Below are some notable applications of ant optimization. The Protein Folding Problem: One of the most complex NP hard combinatorial problem yet fundamental in computational molecular biology is protein folding problem. Predicting the native structure of proteins contained in amino acidic sequence by understanding and analysing the bio-cellular level structure in huge conformational space in is highly expensive approach. The Sequence of Hydrophobic and Polar residues from the amino-acidic sequences in proteins are represented as H and P respectively. The solution to Protein folding problem for both 2D [11] and 3D [12] lattices is Ant Algorithms. Using the Gibbs hypothesis the native state of protein is the one with lowest Gibb s free energy - the number of topological contacts between hydrophobic amino-acids that are not neighbours gives the conformation Gibb s free energy. Conformation c, h such H H contacts, it has free energy E(c) = h. (-1). Digital Image Processing using boundary detection algorithms use the pheromones pheromone used in ant algorithm [13], [14]. Boundary detection algorithm along with clustering algorithms [15], [16] is used for the low level image segmentation processes using ant algorithmic techniques. The digital image is the ant arena or the search space for ants, moving around the arena using the pixels in distinct pixel-wise mode. To achieve boundary detection, locating and mapping out the boundary within the image using the heuristic information weighs higher the probability of an ant moving from its current location to the allowed surrounding pixel that has the greatest boundary characteristics, here comes the pheromone characteristic from Ant Algorithm considering every movement to a new pixel in an image depositing pheromones, change in the image gradient and pheromone evaporation occur at a fixed rate per iteration. The pheromone trail leads to the boundary detection considering the transition rule as heuristic function, as the ants converging at the boundary starting at the random positons with the increasing ants following the pheromone trail maps the leaf boundary. Considering the assertions in this application of Ant Algorithm comparing to typical original ant algorithm; final solution is achieved using the pheromones as well as guiding the ant movement and single ant or one ant cannot achieve this boundary detection for image. Clustering mechanism uses ant algorithm as a standard tool for mapping pixels to cluster in the search space; ants searches for low grayscale regions and in an area away from segmentation. Analysis of large amounts of data using various data mining and warehousing techniques by performing various operations such as data clustering, data classification and data forecasting with the aim to find valid patterns and relationships among large data sets leading to extract right knowledge from data [17], [18]. Later development in the field of data analysis, Ant algorithms are also being used as a purpose to deal with classification of large amount of data. Based on the sets of predefined classed each case (object, record or instance) is assigned to a class based on the value of the attributes for the case. 5. Firefly Algorithms There are more than 2000 species of fireflies in the world, which live around in warm environments and are most active during the summer. They have been a topic of research for a long time now and a lot of research papers have been written about them. Their most distinguishing feature is their flashing light which is produced a biochemical procedure bioluminescence. They use this light to attract other partners for mating and for warning off potential predators. Usually, the flying males make the first signal trying to attract the flightless female fireflies on the ground. Females, in turn, emit continuous or flashing lights, which are generally brighter than the lights produced by male fireflies. This flashing light has served the basic foundation towards the development of the firefly algorithm. The FA was given by Yang in 2008 [4], which described the classical firefly algorithm. It was a very efficient optimization algorithm which was able to derive more optimal solutions in the given search space simultaneously.
4 178 Anuradha and Kshitiz Adlakha: Recapitulation of Ant Colony and Firefly Optimization Techniques The algorithm formulated by Yang is given below by Fig 4: A component of the firefly The whole firefly The complete population Another way of classifying the classic firefly algorithms is to divide them into two parts, modified and hybrid. Hybridization was first done when problems arose in finding the appropriate solution of some optimization problems. Fig. 5 shows the categorization of famous firefly algorithms: Clauses used: All fireflies are unisex. Fig. 4. Pseudo Code of Firefly Algorithm. Attraction of a firefly is proportional to their light intensity. The intensity of the light of a firefly is determined by the fitness function. 6. Classification of Firefly Algorithms There are a lot of variants of the popular firefly algorithm; therefore a classification system is essential. The most common way of classifying firefly algorithms is one the basis of the settings of their strategy parameters [19]. Choosing these parameters is a crucial task for the developers, as they directly affect the efficiency of the algorithm. Along with these parameters, other things like what features or modules are modified also determine the behaviour of the FA. The classification can be done on the basis of 1. Features or modules that are modified: Depiction of fireflies (binary, real-valued) Population structure (swarm, multi-swarm) Calculation of the fitness function Determination of the best solution (non-elitism, elitism) Movement of fireflies (uniform, Gaussian, Lévy flights, chaos distribution) 2. Way of modification: Deterministic Adaptive Self-adaptive 3. Range of modifications: Fig. 5. Classification of Firefly Algorithms. 7. Efficiency of Firefly Algorithms The firefly algorithms are one of the most efficient algorithms at solving classification and optimization problems. The reasons for that are many. We can point the major explanations for its success by analysing its features. The first feature of FA is that it can automatically split its population into subdivisions on the basis of the fact that attraction by nearer neighbours is higher than the ones that are far. This helps in FA in solving multi-modal optimization problems more efficiently. The second feature of FA is that it does not use historical individual best or an explicit global best which prevents premature convergence like those in particle swarm optimization (PSO) [26]. Firefly algorithms have the ability to control their scaling parameter which helps them adjust to the problem landscape and switch their modality. Velocities are not used in firefly algorithms, thus there are no problems associated with that unlike the particle swarm optimization.
5 International Journal of Bioinformatics and Biomedical Engineering Vol. 1, No. 2, 2015, pp After analysing all these features, we can consider FA to be a generalization of PSO, simulated annealing and differential evolution. FA takes benefits from all of these 3, hence performing in an extremely efficient manner. 8. Applications of Firefly Algorithms Firefly algorithms are used in various fields for answering optimization and classification problems along with several engineering problems. In the field of optimization, FA is used in combinatorial, constrained, multi-objective, continuous, dynamic and noisy optimization. Most of the past publications about the firefly algorithm, like [20, 21, 22, 23, 24] relate to continuous optimization problems. In the field of classification, FA is used in data mining, neural networks and machine learning. Even though classifications can be measured as optimization, Holland [25] penned that learning, as component part of classification, is looked at as a procedure of adaptation to a particularly unknown environment, not as an optimization problem. FA is used in almost all branches of engineering. It has become of one of the most important technologies in engineering today. The scope of the reviews done on firefly algorithms in engineering practices is very large. Industrial optimization has the greatest number of papers written about in engineering applications. It is followed by image processing and then antenna design [27] [28]. Fig. 6 shows the various areas covered by Firefly algorithms: Fig. 6. Various areas covered by Firefly algorithms. 9. Conclusion Both FA and ACO algorithms have come a long way from their inception. Today, they are practically used in every domain of science and industry. This paper has briefly detailed some of the developments and applications of both of these algorithms with the aim to make them easy to understand for everyone. Due to their large scope of applications, these algorithms are bound to move forward and make even more progress in the coming future. Hybridizing them with other techniques will lead to development of even more efficient algorithms that can be used to solve dynamic problems. This paper shows that ACO and FA are easy to understand, flexible and can be used in a lot of domains. At the same time, it also promotes future development of these algorithms to solve the unanswered questions and deal with even more harder challenges. References [1] C. Blum, X Li, Swarm intelligence in optimization, Swarm Intelligence: Introduction and Applications, Springer Verlag, Berlin, 2008, pp [2] M. Beekman, G. Sword, S.Simpson, Biological foundations of swarm intelligence, Swarm Intelligence: Introduction and Applications, Springer Verlag, Berlin, 2008, pp [3] Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics Part B, 26, [4] X.S. Yang, Firefly algorithm, Nature-Inspired Metaheuristic Algorithms 20 (2008)79 90.
6 180 Anuradha and Kshitiz Adlakha: Recapitulation of Ant Colony and Firefly Optimization Techniques [5] Goss, S., Aron, S., Deneubourg, J. L., & Pasteels, J. M. (1989). Self-organized shortcuts in the argentine ant. Naturwissenschaften, 76, [6] Cordon, O., Herrera, F., & Stutzle, T. (2002). A review on the ant colony optimization metaheuristic: Basis, models and new trends. Mathware and Soft Computing, 9(2 3): [7] Stutzle, T., & Hoos, H. H. (2000). Max min ant system. Future Generation Computer Systems, 16(8), [8] Dorigo, M., & Di Caro, G. (1999). The Ant Colony optimization metaheuristic. New Ideas in Optimization (pp ). [9] Dorigo, M., & Gambardella, L. M. (1997). Ant Colony System: A cooperating learning approach to the travelling salesman problem. IEEE Transactions on Evolutionary Computation, 1(1), [10] Bullnheimer, B., Hartl, R. F., & Strauss, C. (1996). A new rank-based version of the Ant System: A computational study. Central European Journal for Operations Research and Economics, 7(1), [11] Shmygelska, A., Hoos, H. H. (2003). An improved ant colony optimisation algorithm for the 2D HP protein folding problem. In Advances in artificial intelligence: 16th Conference of the Canadian society for computational studies of intelligence, Halifax, Canada, AI 2003 (page 993). [12] Findova, S. (2006). 3D protein folding problem using ant algorithm. In Proceedings of BioPS international conference, Sofia, Bulgaria (pp ). [13] Fernandes, C., Ramos, V., & Rosa, A. C. (2005). Self-regulated artificial ant colonies on digital image habitats. International Journal of Lateral Computing, 2(1), 1 8. [14] Ramos, V. & Almeida, F. (2000). Artificial ant colonies in digital image habitats a mass behaviour effect study on pattern recognition. In Proceedings of ANTS 2000 [15] Channa, A. H., Rajpoot, N. M., & Rajpoot, K. M. (2006). Texture segmentation using ant tree clustering. In 2006 IEEE international conference on engineering of intelligent systems (pp. 1 6). [16] Ouadfel, S., & Batouche, M. (2002). Unsupervised image segmentation using a colony of cooperating ants. In BMCV 02: Proceedings of the second international workshop on biologically motivated computer vision (pp ). Springer-Verlag. [17] Fayyad, U. M., Piatetsky-Shapiro, G., & Smyth, P. (1996). From data mining to knowledge discovery: An overview. In Advances in knowledge discovery and data mining (pp. 1 34). Cambridge, MA: AAAI/MIT. [18] Edelstein, H. A. (1999). Introduction to data mining and knowledge discovery (3rd ed.). Two Crows Corporation. [19] A. Eiben, J. Smith, Introduction to Evolutionary Computing, Springer-Verlag, Berlin, [20] X.S. Yang, Firefly algorithm, stochastic test functions and design optimisa- tion, International Journal of Bio-Inspired Computation 2 (2) (2010) [21] X.S. Yang, Review of meta-heuristics and generalised evolutionary walk algorithm, International Journal of Bio-Inspired Computation 3 (2) (2011) [22] X.S. Yang, Metaheuristic optimization: algorithm analysis and open problems, in: P. Pardalos, S. Rebennack (Eds.), Experimental Algorithms, Lecture notes in Computer Science, vol. 6630, Springer Verlag, Berlin, 2011, pp [23] X.S. Yang, Firefly algorithm, levy flights and global optimization, in: M. Bramer, R. Ellis, M. Petridis (Eds.), Research and Development in Intelligent Systems XXVI, Springer, 2010, pp [24] X.S. Yang, Efficiency analysis of swarm intelligence and randomization techniques, Journal of Computational and Theoretical Nanoscience 9 (2) (2012) [25] J. Holland, Adaptation in Natural and Artificial Systems, 1st edition, MIT Press, Cambridge, USA, [26] J. Kennedy, R. Eberhart, The particle swarm optimization: social adaptation in information processing, in: D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw Hill, London, UK, 1999, pp [27] I. Fister et al. in Swarm and Evolutionary Computation 13 (2013), pp [28] R. Mallipeddi, P. Suganthan, Q. Pan, M. Tasgetiren, Differential evolution algorithm with ensemble of parameters and mutation strategies, Applied Soft Computing 11 (2) (2011)
Ant 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 informationCEng 713 Evolutionary Computation, Lecture Notes
CEng 713 Evolutionary Computation, Lecture Notes Introduction to Evolutionary Computation Evolutionary Computation Elements of Evolution: Reproduction Random variation Competition Selection of contending
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 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 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 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 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 informationLoad Disaggregation with Metaheuristic Optimization
Load Disaggregation with Metaheuristic Optimization Dominik Egarter and Wilfried Elmenreich Institute of Networked and Embedded Systems / Lakeside Labs Alpen-Adria-Universität Klagenfurt, Austria dominik.egarter@aau.at,
More informationANT COLONY ROUTE OPTIMIZATION FOR MUNICIPAL SERVICES
ANT COLONY ROUTE OPTIMIZATION FOR MUNICIPAL SERVICES Nikolaos V. Karadimas, Georgios Kouzas, Ioannis Anagnostopoulos, Vassili Loumos and Elefterios Kayafas School of Electrical & Computer Engineering Department
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 informationAnt Colony System vs ArcGIS Network Analyst: The Case of Municipal Solid Waste Collection
5th WSEAS Int. Conf. on ENVIRONMENT, ECOSYSTEMS and DEVELOPMENT, Tenerife, Spain, December 14-16, 2007 128 Ant Colony System vs ArcGIS Network Analyst: The Case of Municipal Solid Waste Collection NIKOLAOS
More informationCOMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO
COMBINED-OBJECTIVE OPTIMIZATION IN IDENTICAL PARALLEL MACHINE SCHEDULING PROBLEM USING PSO Bathrinath S. 1, Saravanasankar S. 1 and Ponnambalam SG. 2 1 Department of Mechanical Engineering, Kalasalingam
More informationCOMPARISON BETWEEN GENETIC ALGORITHM, PARTICLE SWARM OPTIMIZATION AND ANT COLONY OPTIMIZATION TECHNIQUES FOR NOX EMISSION FORECASTING IN IRAN
International Journal on Technical and Physical Problems of Engineering (IJTPE) Published by International Organization of IOTPE ISSN 2077-3528 IJTPE Journal www.iotpe.com ijtpe@iotpe.com September 2013
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 informationAn Evolutionary Approach involving Training of ANFIS with the help of Genetic Algorithm for PID Controller Tuning
An Evolutionary Approach involving Training of ANFIS with the help of Genetic Algorithm for PID... An Evolutionary Approach involving Training of ANFIS with the help of Genetic Algorithm for PID Controller
More informationMINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH
MINIMIZE THE MAKESPAN FOR JOB SHOP SCHEDULING PROBLEM USING ARTIFICIAL IMMUNE SYSTEM APPROACH AHMAD SHAHRIZAL MUHAMAD, 1 SAFAAI DERIS, 2 ZALMIYAH ZAKARIA 1 Professor, Faculty of Computing, Universiti Teknologi
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 informationProcedia - Social and Behavioral Sciences 109 ( 2014 ) Selection and peer review under responsibility of Organizing Committee of BEM 2013.
Available online at www.sciencedirect.com ScienceDirect Procedia - Social and Behavioral Sciences 109 ( 2014 ) 779 783 2 nd World Conference On Business, Economics And Management-WCBEM 2013 A hybrid metaheuristic
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 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 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 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 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 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 informationEvolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen
INF3490 - Biologically inspired computing Lecture 3: Eiben and Smith, chapter 5-6 Evolutionary Algorithms - Population management and popular algorithms Kai Olav Ellefsen Repetition: General scheme of
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 informationThe Metaphor. Individuals living in that environment Individual s degree of adaptation to its surrounding environment
Genetic Algorithms Sesi 14 Optimization Techniques Mathematical Programming Network Analysis Branch & Bound Simulated Annealing Tabu Search Classes of Search Techniques Calculus Base Techniqes Fibonacci
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 informationComputational Intelligence Lecture 20:Intorcution to Genetic Algorithm
Computational Intelligence Lecture 20:Intorcution to Genetic Algorithm Farzaneh Abdollahi Department of Electrical Engineering Amirkabir University of Technology Fall 2012 Farzaneh Abdollahi Computational
More informationMachine Learning Applications in Supply Chain Management
Machine Learning Applications in Supply Chain Management CII Conference on E2E Trimodal Supply chain: Envisioning Collaborative, Cost Centric, Digital & Cognitive Supply Chain 27-29 July, 2016 Dr. Arpan
More informationGenetic Algorithms in Matrix Representation and Its Application in Synthetic Data
Genetic Algorithms in Matrix Representation and Its Application in Synthetic Data Yingrui Chen *, Mark Elliot ** and Joe Sakshaug *** * ** University of Manchester, yingrui.chen@manchester.ac.uk University
More informationCuckoo Search Algorithm for Model Parameter Identification
Cuckoo Search Algorithm for Model Parameter Identification Olympia Roeva *, Vassia Atanassova Institute of Biophysics and Biomedical Engineering Bulgarian Academy of Sciences 105 Acad. G. Bonchev Str.
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 informationEconomic Load Dispatch Solution Including Transmission Losses Using MOPSO
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 9, Issue 11 (February 2014), PP. 15-23 Economic Load Dispatch Solution Including
More informationAn Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem
Send Orders for Reprints to reprints@benthamscience.ae 560 The Open Cybernetics & Systemics Journal, 2014, 8, 560-565 Open Access An Improved Immune Genetic Algorithm for Capacitated Vehicle Routing Problem
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 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 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 informationBio-Inspired Networking
Contents Bio-Inspired Networking The Road to Efficient and Sustainable Mobile Computing Abbas Jamalipour, PhD; Fellow IEEE, Fellow IEAust Editor-in-Chief, IEEE Wireless Communications IEEE Distinguished
More informationSOLVING CAPACITY PROBLEMS AS ASYMMETRIC TRAVELLING SALESMAN PROBLEMS
SOLVING CAPACITY PROBLEMS AS ASYMMETRIC TRAVELLING SALESMAN PROBLEMS Tad Gonsalves and Takafumi Shiozaki Department of Information and Communication Sciences, Faculty of Science & Technology, Sophia University,
More informationNature Inspired Algorithms in Cloud Computing: A Survey
International Journal of Intelligent Information Systems 2016; 5(5): 60-64 http://www.sciencepublishinggroup.com/j/ijiis doi: 10.11648/j.ijiis.20160505.11 ISSN: 2328-7675 (Print); ISSN: 2328-7683 (Online)
More informationWhat is Evolutionary Computation? Genetic Algorithms. Components of Evolutionary Computing. The Argument. When changes occur...
What is Evolutionary Computation? Genetic Algorithms Russell & Norvig, Cha. 4.3 An abstraction from the theory of biological evolution that is used to create optimization procedures or methodologies, usually
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 informationVISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY. A seminar report on GENETIC ALGORITHMS.
VISHVESHWARAIAH TECHNOLOGICAL UNIVERSITY S.D.M COLLEGE OF ENGINEERING AND TECHNOLOGY A seminar report on GENETIC ALGORITHMS Submitted by Pranesh S S 2SD06CS061 8 th semester DEPARTMENT OF COMPUTER SCIENCE
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 informationCOMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE
COMPARING VARIOUS WORKFLOW ALGORITHMS WITH SIMULATED ANNEALING TECHNIQUE Dr.V.Venkatesakumar #1, R.Yasotha #2 # Department of Computer Science and Engineering, Anna University Regional Centre, Coimbatore,
More informationImplementation of Genetic Algorithm for Agriculture System
Implementation of Genetic Algorithm for Agriculture System Shweta Srivastava Department of Computer science Engineering Babu Banarasi Das University,Lucknow, Uttar Pradesh, India Diwakar Yagyasen Department
More informationThe Age of Intelligent Data Systems: An Introduction with Application Examples. Paulo Cortez (ALGORITMI R&D Centre, University of Minho)
The Age of Intelligent Data Systems: An Introduction with Application Examples Paulo Cortez (ALGORITMI R&D Centre, University of Minho) Intelligent Data Systems: Introduction The Rise of Artificial Intelligence
More informationTIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS. Liviu Lalescu, Costin Badica
TIMETABLING EXPERIMENTS USING GENETIC ALGORITHMS Liviu Lalescu, Costin Badica University of Craiova, Faculty of Control, Computers and Electronics Software Engineering Department, str.tehnicii, 5, Craiova,
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 informationDNA Sequence Assembly using Particle Swarm Optimization
DNA Sequence Assembly using Particle Swarm Optimization Ravi Shankar Verma National Institute of Technology Raipur, India Vikas Singh ABV- Indian Institute of Information Technology and management, Gwalior,
More informationGenetic Algorithm: A Search of Complex Spaces
Genetic Algorithm: A Search of Complex Spaces Namita Khurana, Anju Rathi, Akshatha.P.S Lecturer in Department of (CSE/IT) KIIT College of Engg., Maruti Kunj, Sohna Road, Gurgaon, India ABSTRACT Living
More informationA HYBRID MODERN AND CLASSICAL ALGORITHM FOR INDONESIAN ELECTRICITY DEMAND FORECASTING
A HYBRID MODERN AND CLASSICAL ALGORITHM FOR INDONESIAN ELECTRICITY DEMAND FORECASTING Wahab Musa Department of Electrical Engineering, Universitas Negeri Gorontalo, Kota Gorontalo, Indonesia E-Mail: wmusa@ung.ac.id
More informationCSE 590 DATA MINING. Prof. Anita Wasilewska SUNY Stony Brook
CSE 590 DATA MINING Prof. Anita Wasilewska SUNY Stony Brook 1 References D. E. Goldberg, Genetic Algorithm In Search, Optimization And Machine Learning, New York: Addison Wesley (1989) John H. Holland
More informationGenetic Algorithm: An Optimization Technique Concept
Genetic Algorithm: An Optimization Technique Concept 1 Uma Anand, 2 Chain Singh 1 Student M.Tech (3 rd sem) Department of Computer Science Engineering Dronacharya College of Engineering, Gurgaon-123506,
More informationGenetic Algorithm. Presented by Shi Yong Feb. 1, 2007 Music McGill University
Genetic Algorithm Presented by Shi Yong Feb. 1, 2007 Music Tech @ McGill University Outline Background: Biological Genetics & GA Two Examples Some Applications Online Demos* (if the time allows) Introduction
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 informationCOMPUTATIONAL INTELLIGENCE FOR SUPPLY CHAIN MANAGEMENT AND DESIGN: ADVANCED METHODS
COMPUTATIONAL INTELLIGENCE FOR SUPPLY CHAIN MANAGEMENT AND DESIGN: ADVANCED METHODS EDITED BOOK IGI Global (former IDEA publishing) Book Editors: I. Minis, V. Zeimpekis, G. Dounias, N. Ampazis Department
More informationBio-inspired capacity control for production networks with autonomous work systems
Bio-inspired capacity control for production networks with autonomous work systems Bernd Scholz-Reiter 1, Hamid R. Karimi 2, Neil A. Duffie 3, T. Jagalski 1 1 University of Bremen, Dept. Planning and Control
More informationTRENDS IN MODELLING SUPPLY CHAIN AND LOGISTIC NETWORKS
Advanced OR and AI Methods in Transportation TRENDS IN MODELLING SUPPLY CHAIN AND LOGISTIC NETWORKS Maurizio BIELLI, Mariagrazia MECOLI Abstract. According to the new tendencies in marketplace, such as
More informationTASK SCHEDULING OF AGV IN FMS USING NON-TRADITIONAL OPTIMIZATION TECHNIQUES
ISSN 1726-4529 Int j simul model 9 (2010) 1, 28-39 Original scientific paper TASK SCHEDULING OF AGV IN FMS USING NON-TRADITIONAL OPTIMIZATION TECHNIQUES Udhayakumar, P. & Kumanan, S. Department of Production
More informationMulti-product inventory optimization in a multiechelon supply chain using Genetic Algorithm
Multi-product inventory optimization in a multiechelon supply chain using Genetic Algorithm T.V.S.R.K.Prasad 1, Sk.Abdul Saleem 3, C.Srinivas 2,Kolla srinivas 4 1 Associate Professor, 3 Assistant Professor,
More informationJournal of Water and Soil Vol. 26, No.5, Nov.-Dec. 2012, p BP14 BP Rotational Delivery 4- On- Demand Delivery 5- Arranged Delivery
2 Journal of Water and Soil Vol. 26, No.5, Nov.-Dec. 2012, p. 1109-1118 ( ) 1109-1118. 1391 5 26 BP14 2 *1-1390/6/13 : 1391/5/10 :... BP14. 2100 2/5 6852... 10 90. 0/04. 41 105 :.. 4 3 5..... 3- Rotational
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 informationMachine learning in neuroscience
Machine learning in neuroscience Bojan Mihaljevic, Luis Rodriguez-Lujan Computational Intelligence Group School of Computer Science, Technical University of Madrid 2015 IEEE Iberian Student Branch Congress
More informationApplication of Intelligent Methods for Improving the Performance of COCOMO in Software Projects
Application of Intelligent Methods for Improving the Performance of COCOMO in Software Projects Mahboobeh Dorosti,. Vahid Khatibi Bardsiri Department of Computer Engineering, Kerman Branch, Islamic Azad
More informationFOM: A Framework for Metaheuristic Optimization
FOM: A Framework for Metaheuristic Optimization 1 J.A. Parejo 1, J. Racero 1, F. Guerrero 1, T. Kwok 2, and K.A. Smith 2 Escuela Superior de Ingenieros, Camino de los Descubrimientos, s/n, 41092 Sevilla,
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 informationAn Evolutionary Algorithm Based On The Aphid Life Cycle
International Journal of Computer Information Systems and Industrial Management Applications. ISSN 2150-7988 Volume 8 (2016) pp. 155 162 c MIR Labs, www.mirlabs.net/ijcisim/index.html An Evolutionary Algorithm
More informationEvolutionary Algorithms
Evolutionary Algorithms with Mixed Strategy Liang Shen Supervisors: Dr. Jun He Prof. Qiang Shen Ph.D. Thesis Department of Computer Science Institute of Mathematics, Physics and Computer Science Aberystwyth
More informationINTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN
INTEGRATING VEHICLE ROUTING WITH CROSS DOCK IN SUPPLY CHAIN Farshad Farshchi Department of Industrial Engineering, Parand Branch, Islamic Azad University, Parand, Iran Davood Jafari Department of Industrial
More informationMethod of Optimal Scheduling of Cascade Reservoirs based on Improved Chaotic Ant Colony Algorithm
Sensors & Transducers 2013 by IFSA http://www.sensorsportal.com Method of Optimal Scheduling of Cascade Reservoirs based on Chaotic Ant Colony Algorithm 1 Hongmin Gao, 2 Baohua Xu, 1 Zhenli Ma, 1 Lin Zhang,
More informationA Survey on Various Task Scheduling Algorithm in cloud Environment
A Survey on Various Task Scheduling Algorithm in cloud Environment Gurjeet kaur [1], Gurjot singh sodhi [2] Shaheed Udham Singh College of Engineering & Technology,(Tangori) Abstract - Cloud computing
More informationRule Minimization in Predicting the Preterm Birth Classification using Competitive Co Evolution
Indian Journal of Science and Technology, Vol 9(10), DOI: 10.17485/ijst/2016/v9i10/88902, March 2016 ISSN (Print) : 0974-6846 ISSN (Online) : 0974-5645 Rule Minimization in Predicting the Preterm Birth
More informationGenetic Algorithm and Neural Network
Proceedings of the 7th WSEAS International Conference on Applied Informatics and Communications, Athens, Greece, August 24-26, 2007 345 Genetic Algorithm and Neural Network JIRI STASTNY*, VLADISLAV SKORPIL**
More informationMachine Learning. Genetic Algorithms
Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:
More informationMachine Learning. Genetic Algorithms
Machine Learning Genetic Algorithms Genetic Algorithms Developed: USA in the 1970 s Early names: J. Holland, K. DeJong, D. Goldberg Typically applied to: discrete parameter optimization Attributed features:
More informationGenetic Algorithms using Populations based on Multisets
Genetic Algorithms using Populations based on Multisets António Manso 1, Luís Correia 1 1 LabMAg - Laboratório de Modelação de Agentes Faculdade de Ciências da Universidade de Lisboa Edifício C6, Piso
More informationComparison of a Job-Shop Scheduler using Genetic Algorithms with a SLACK based Scheduler
1 Comparison of a Job-Shop Scheduler using Genetic Algorithms with a SLACK based Scheduler Nishant Deshpande Department of Computer Science Stanford, CA 9305 nishantd@cs.stanford.edu (650) 28 5159 June
More informationGENETIC ALGORITHM A NOBLE APPROACH FOR ECONOMIC LOAD DISPATCH
International Journal of Engineering Research and Applications (IJERA) ISSN: 48-96 National Conference on Emerging Trends in Engineering & Technology (VNCET-30 Mar 1) GENETIC ALGORITHM A NOBLE APPROACH
More informationISE480 Sequencing and Scheduling
ISE480 Sequencing and Scheduling INTRODUCTION ISE480 Sequencing and Scheduling 2012 2013 Spring term What is Scheduling About? Planning (deciding what to do) and scheduling (setting an order and time for
More informationFeature Selection of Gene Expression Data for Cancer Classification: A Review
Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 50 (2015 ) 52 57 2nd International Symposium on Big Data and Cloud Computing (ISBCC 15) Feature Selection of Gene Expression
More informationAnalysis of NEAT and application in swarm intelligence
Bachelor Informatica Informatica Universiteit van Amsterdam Analysis of NEAT and application in swarm intelligence Frank van Beem June 9, 2017 Supervisor(s): Rein van den Boomgaard 2 Abstract In this paper
More informationJournal of Global Research in Computer Science PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING PROBLEM
Volume, No. 5, December 00 Journal of Global Research in Computer Science RESEARCH PAPER Available Online at www.jgrcs.info PREMATURE CONVERGENCE AND GENETIC ALGORITHM UNDER OPERATING SYSTEM PROCESS SCHEDULING
More informationGenetic Algorithm with Upgrading Operator
Genetic Algorithm with Upgrading Operator NIDAPAN SUREERATTANAN Computer Science and Information Management, School of Advanced Technologies, Asian Institute of Technology, P.O. Box 4, Klong Luang, Pathumthani
More informationMulti-depot Vehicle Routing Problem with Pickup and Delivery Requests
Multi-depot Vehicle Routing Problem with Pickup and Delivery Requests Pandhapon Sombuntham a and Voratas Kachitvichyanukul b ab Industrial and Manufacturing Engineering, Asian Institute of Technology,
More informationOptimized Enhanced Control System for the Unibadan s Virtual Power Plant Project Using Genetic Algorithm
Optimized Enhanced Control System for the Unibadan s Virtual Power Plant Project Using Genetic Algorithm 1 Corresponding Author 1 C. G. Monyei, 2 O. A. Fakolujo 1, 2 Department of Electrical and Electronic
More informationA Survey: Spider Monkey Optimization Algorithm
A Survey: Spider Monkey Optimization Algorithm Neetu Agarwal a, Kushboo Gupta b, Shailesh Porwal c, and Prof S.C. Jain d a,b,c,d Rajasthan Technical University, Kota, India. Abstract. Swarm intelligence
More informationCHAPTER 2 REACTIVE POWER OPTIMIZATION A REVIEW
14 CHAPTER 2 REACTIVE POWER OPTIMIZATION A REVIEW 2.1 INTRODUCTION Reactive power optimization is an important function both in planning for the future and day-to-day operations of power systems. It uses
More informationBRIDGE_ SIM: FRAMEWORK FOR PLANNING AND OPTIMIZING BRIDGE DECK CONSTRUCTION USING COMPUTER SIMULATION. Mohamed Marzouk Hisham Zein Moheeb Elsaid
Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. BRIDGE_ SIM: FRAMEWORK FOR PLANNING AND OPTIMIZING BRIDGE
More informationApplying Computational Intelligence in Software Testing
www.stmjournals.com Applying Computational Intelligence in Software Testing Saumya Dixit*, Pradeep Tomar School of Information and Communication Technology, Gautam Buddha University, Greater Noida, India
More informationWorkflow Scheduling of Scientific Application in Cloud A Survey
Workflow Scheduling of Scientific Application in Cloud A Survey Priyanka M. Kadam 1 Priyankakadam222@gmail. com Prof. S. R.Poojara. 2 Assistant Professor shivananda.poojara@ritindi a.edu Prof. N.V.Dharwadkar.
More informationUsing Harmony Search for Optimising University Shuttle Bus Driver Scheduling for Better Operational Management
Available online at www.globalilluminators.org GlobalIlluminators Full Paper Proceeding ITMAR -2014, Vol. 1, 614-621 FULL PAPER PROCEEDING Multidisciplinary Studies ISBN: 978-969-9948-24-4 ITMAR-14 Using
More informationPARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM
PARALLEL LINE AND MACHINE JOB SCHEDULING USING GENETIC ALGORITHM Dr.V.Selvi Assistant Professor, Department of Computer Science Mother Teresa women s University Kodaikanal. Tamilnadu,India. Abstract -
More informationThe Weapon Target Assignment Strategy Research on Genetic Algorithm
2010 3rd International Conference on Computer and Electrical Engineering (ICCEE 2010) IPCSIT vol. 53 (2012) (2012) IACSIT Press, Singapore DOI: 10.7763/IPCSIT.2012.V53.No.1.75 The Weapon Target Assignment
More informationLeonora Bianchi. October Tel: (+41) Fax: (+41) Web page:
Leonora Bianchi October 2008 Home Address Via Bellini 1 22010 Moltrasio - CO, Italy Tel: (+39)031.291068 Professional Address Dalle Molle Institute for Artificial Intelligence (IDSIA) Via Cantonale, Galleria
More information10. Lecture Stochastic Optimization
Soft Control (AT 3, RMA) 10. Lecture Stochastic Optimization Genetic Algorithms 10. Structure of the lecture 1. Soft control: the definition and limitations, basics of epert" systems 2. Knowledge representation
More informationThe Optimization of Section of Embankment Dams with Multiple Platforms and Rock Foundation through Bee Colony Optimization Method
J. Appl. Environ. Biol. Sci., 5(9)6-6, 05 05, TextRoad Publication ISSN: 090-474 Journal of Applied Environmental and Biological Sciences www.textroad.com The Optimization of Section of Embankment Dams
More informationData Mining and Applications in Genomics
Data Mining and Applications in Genomics Lecture Notes in Electrical Engineering Volume 25 For other titles published in this series, go to www.springer.com/series/7818 Sio-Iong Ao Data Mining and Applications
More informationResearch on the Distribution System Simulation of Large Company s Logistics under Internet of Things Based on Traveling Salesman Problem Solution
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 16, No 5 Special Issue on Application of Advanced Computing and Simulation in Information Systems Sofia 2016 Print ISSN: 1311-9702;
More information