Ant Algorithms for Discrete Optimization
Artificial LifePublished 1 April 1999
Marco Dorigo, Gianni A. Di, Luca Maria Gambardella
Citations2,819
SJR quartileQ3
SJR score0.34
SNIP0.77
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented.
Abstract
This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and introduces the ant colony optimization (ACO) metaheuristic. In the first part of the article the basic biological findings on real ants are reviewed and their artificial counterparts as well as the ACO metaheuristic are defined. In the second part of the article a number of applications of ACO algorithms to combinatorial optimization and routing in communications networks are described. We conclude with a discussion of related work and of some of the most important aspects of the ACO metaheuristic.
Keywords
Engineering
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The MIT Press eBooksAdaptation in Natural and Artificial Systems
35,568 Citations1992John H. Holland
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways.
Choice Reviews OnlineNeural networks for pattern recognition
18,687 Citations1994
This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Genetic Algorithms in Search, Optimization and Machine Learning
17,773 Citations1988David E. Goldberg, David Robson
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Ant system: optimization by a colony of cooperating agents
11,908 Citations1996Marco Dorigo, Vittorio Maniezzo +1 more
IEEE Transactions on Evolutionary ComputationAnt colony system: a cooperative learning approach to the traveling salesman problem
7,994 Citations1997Marco Dorigo, Luca Maria Gambardella
The results show that the ACS outperforms other nature-inspired algorithms such as simulated annealing and evolutionary computation, and it is concluded comparing ACS-3-opt, a version of the ACS augmented with a local search procedure, to some of the best performing algorithms for symmetric and asymmetric TSPs.
MIT Press eBooksIntroduction to Reinforcement Learning
6,868 Citations1998Richard S. Sutton, Andrew G. Barto
In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the key ideas and algorithms of reinforcement learning.
INFORMS Journal on ComputingTabu Search—Part II
5,643 Citations1990Fred Glover
The elements of staged search and structured move sets are characterized, which bear on the issue of finiteness, and new dynamic strategies for managing tabu lists are introduced, allowing fuller exploitation of underlying evaluation functions.
INFORMS Journal on ComputingTabu Search—Part I
4,974 Citations1989Fred Glover
The fundamental principles underlying tabu search as a strategy for combinatorial optimization problems are presented and more advanced considerations are examined, applying the basic ideas to special settings and outlining a dynamic move structure to insure finiteness.
Operations ResearchScheduling of Vehicles from a Central Depot to a Number of Delivery Points
3,846 Citations1964Graham Clarke, J. W. Wright
An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
Wiley series in probability and statisticsSimulation and the Monte Carlo Method
3,251 Citations2016Reuven Y. Rubinstein, Dirk P. Kroese
Future Generation Computer Systems– Ant System
2,698 Citations2000Thomas Stützle, Holger H. Hoos
Computational results on the Traveling Salesman Problem and the Quadratic Assignment Problem show that MM AS is currently among the best performing algorithms for these problems.
Mathematics of Operations ResearchThe Complexity of Flowshop and Jobshop Scheduling
2,601 Citations1976M. R. Garey, David Johnson +1 more
The results are strong in that they hold whether the problem size is measured by number of tasks, number of bits required to express the task lengths, or by the sum of thetask lengths.
Distributed Optimization by Ant Colonies
2,580 Citations1992Alberto Colorni, Marco Dorigo +3 more
A distributed problem solving environment is introduced and its use to search for a solution to the travelling salesman problem is proposed.
New Ideas In Optimization
2,135 Citations1999David Corne, Marco Dorigo +5 more
The techniques treated in this text represent research as elucidated by the leaders in the field and are applied to real problems, such as hilllclimbing, simulated annealing, and tabu search.
BiosystemsAnt colonies for the travelling salesman problem
1,991 Citations1997Marco Dorigo, Luca Maria Gambardella
An artificial ant colony capable of solving the travelling salesman problem (TSP) is described, an example of the successful use of a natural metaphor to design an optimization algorithm.
Bell System Technical JournalComputer Solutions of the Traveling Salesman Problem
1,960 Citations1965Shen Lin
Two algorithms for solving the (symmetric distance) traveling salesman problem have been programmed for a high-speed digital computer and are based on a general heuristic approach believed to be of general applicability to various optimization problems.
Journal of the ACMP-Complete Approximation Problems
1,715 Citations1976Sartaj Sahni, Teofilo F. Gonzalez
For P- complete problems such as traveling salesperson, cycle covers, 0-1 integer programming, multicommodity network flows, quadratic assignment, etc., it is shown that the approximation problem is also P-complete.
Scientific AmericanThe Connection Machine
1,614 Citations1987W. Daniel Hillis
The Connection Machine describes a fundamentally different kind of computer that Daniel Hillis and others are now developing to perform tasks that no conventional, sequential machine can solve in a reasonable time.
Journal of Artificial Intelligence ResearchAntNet: Distributed Stigmergetic Control for Communications Networks
1,582 Citations1998Gianni A. Di, Marco Dorigo
AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems, and showed superior performance under all the experimental conditions with respect to its competitors.
Communications of the ACMNew methods to color the vertices of a graph
1,564 Citations1979Daniel Brélaz
An exact method is given which performs better than the Randall-Brown algorithm and is able to color larger graphs and the new heuristic methods, the classical methods, and the exact method are compared.
CERN Document Server (European Organization for Nuclear Research)Learning Automata: An Introduction
1,559 Citations1989Kumpati S. Narendra, Mandayam A. L. Thathachar
From the combination of knowledge and actions, someone can improve their skill and ability and this learning automata an introduction tells you that any book will give certain knowledge to take all benefits.
Operations ResearchA Method for Solving Traveling-Salesman Problems
1,532 Citations1958G. A. Croes
A method of solution for the traveling-salesman problem that is applicable to both symmetric and asymmetric problems with random elements, and does not use subjective decisions, so that it can be completely mechanized.
Journal of Insect BehaviorThe self-organizing exploratory pattern of the argentine ant
918 Citations1990J. L. Deneubourg, Serge Aron +2 more
A minimal model shows how the exploratory pattern may be generated by the individual workers' simple trail-laying and -following behavior, illustrating how complex collective structures in insect colonies may be based on self-organization.
MAX-MIN Ant System and local search for the traveling salesman problem
825 Citations2002Thomas Stützle, Holger H. Hoos
The results clearly show that MAX-MIN Ant System has the property of effectively guiding the local search heuristics towards promising regions of the search space by generating good initial tours.
Future Generation Computer SystemsAnt algorithms and stigmergy
804 Citations2000Marco Dorigo, Eric Bonabeau +1 more
This paper overviews some models derived from the observation of real ants, emphasizing the role played by stigmergy as distributed communication paradigm, and shows how these models have inspired a number of novel algorithms for the solution of distributed optimization and distributed control problems.
ePubWU Institutional Repository (Wirtschaftsuniversität Wien)A new rank based version of the Ant System. A computational study.
802 Citations1997B. Bullnheimer, Richard F. Hartl +1 more
It turns out that the new rank based ant system can compete with the other methods in terms of average behavior, and shows even better worst case behavior.
IEEE Transactions on Knowledge and Data EngineeringThe ant system applied to the quadratic assignment problem
745 Citations1999Vittorio Maniezzo, A. Colorni
A distributed heuristic algorithm that was inspired by the observation of the behavior of ant colonies is described and its use for the quadratic assignment problem is proposed.
Adaptive BehaviorAnt-Based Load Balancing in Telecommunications Networks
744 Citations1997Ruud Schoonderwoerd, Owen Holland +2 more
A novel method of achieving load balancing in telecommunications networks using ant-based control, which is shown to result in fewer call failures than the other methods, while exhibiting many attractive features of distributed control.
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
726 Citations1999Luca Maria Gambardella, Éric D. Taillard +1 more
It is shown that MACS-VRPTW is competitive with the best known existing methods both in terms of solution quality and computation time and improves some of the best solutions known for a number of problem instances in the literature.
Journal of the Operational Research SocietyAnt colonies for the quadratic assignment problem
676 Citations1999L. M. Gambardella, Éeric D. Taillard +1 more
Experimental results show that HAS-QAP and the hybrid genetic algorithm perform best on real world, irregular and structured problems due to their ability to find the structure of good solutions, while HAS–QAP performance is less competitive on random, regular and unstructured problems.
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)Ant system for Job-shop scheduling
618 Citations1994Alberto Colorni, Marco Dorigo +2 more
This paper shows how a new heuristic called ant system, in which the search task is distributed over many simple, loosely interacting agents, can be successfully applied to find good solutions of job-shop scheduling problems.
Elsevier eBooksAnt-Q: A Reinforcement Learning approach to the traveling salesman problem
601 Citations1995Luca Maria Gambardella, Marco Dorigo
Ant-Q algorithms were inspired by work on the ant system (AS), a distributed algorithm for combinatorial optimization based on the metaphor of ant colonies and are applied to the solution of symmetric and asymmetric instances of the traveling salesman problem.
Elsevier eBooksRemoving the Genetics from the Standard Genetic Algorithm
577 Citations1995Shumeet Baluja, Rich Caruana
An abstraction of the genetic algorithm, termed population-based incremental learning (PBIL), that explicitly maintains the statistics contained in a GA''s population, but which abstracts away the crossover operator and redefines the role of the population results in PBIL being simpler, both computationally and theoretically, than the GA.
Solving symmetric and asymmetric TSPs by ant colonies
502 Citations2002Luca Maria Gambardella, Marco Dorigo
ACS is presented, a distributed algorithm for the solution of combinatorial optimization problems which was inspired by the observation of real colonies of ants and is able to find good solutions to these problems.
Journal of the Operational Research SocietyAnts can colour graphs
501 Citations1997Davide Costa, Alain Hertz
An evolutionary search procedure for tackling assignment type problems that repeatedly constructs feasible solutions of the problem under study by taking account of two complementary notions, namely the trace factor and the desirability factor is presented.
Journal of Research of the National Bureau of StandardsA graph coloring algorithm for large scheduling problems
486 Citations1979Frank Thomson Leighton
A new graph coloring algorithm is presented and shown to exhibit O(n 2) time behavior for most sparse graphs and thus is found to be particularly well suited for use with large-scale scheduling problems.
Applying the ANT System to the Vehicle Routing Problem
412 Citations1999B. Bullnheimer, Richard F. Hartl +1 more
A recently proposed metaheuristic, the Ant System, is used to solve the Vehicle Routing Problem in its basic form, i.e., with capacity and distance restrictions, one central depot and identical vehicles.
INFORMS journal on computingAn Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
371 Citations2000Luca Maria Gambardella, Marco Dorigo
A new local optimizer called SOP-3-exchange is presented for the sequential ordering problem that extends a local search for the traveling salesman problem to handle multiple constraints directly without increasing computational complexity.
Future Generation Computer SystemsA Graph-based Ant System and its convergence
369 Citations2000Walter J. Gutjahr
It is shown that under certain conditions, the solutions generated in each iteration of this Graph-based Ant System converge with a probability that can be made arbitrarily close to 1 to the optimal solution of the given problem instance.
Cognitive ScienceConnectionist models and their properties
345 Citations1982Jerome A. Feldman, D.H. Ballard
INFORMS journal on computingExact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
340 Citations1999Vittorio Maniezzo
Two new techniques for solving the Quadratic Assignment Problem are introduced, one of which is a heuristic technique, defined in accordance with the Ant System metaphor, and includes as a distinctive feature the use of a new lower bound at each constructive step.
Annals of Operations ResearchGenetic and hybrid algorithms for graph coloring
307 Citations1996Charles Fleurent, Jacques A. Ferland
It is illustrated that genetic operators can fulfill long-term strategic functions for a tabu search implementation that is chiefly founded on short-term memory strategies.
AntNet: A Mobile Agents Approach to Adaptive Routing
286 Citations1999Gianni A. Di
AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor which is applied to a datagram network and compared with both static and adaptive state-of-the-art routing algorithms.
Oxford University Press eBooksFrom Natural to Artificial Swarm Intelligence
281 Citations1999Eric Bonabeau, Marco Dorigo +1 more
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
280 Citations2002Bernd Freisleben, P. Merz
The combination of local search heuristics and genetic algorithms is a promising approach for finding near-optimum solutions to the traveling salesman problem (TSP) and the results indicate that it is possible to arrive at high quality solutions in reasonable time.
Ant-like agents for load balancing in telecommunications networks
274 Citations1997Ruud Schoonderwoerd, Owen Holland +1 more
A novel method of achieving load balancing in telecommunications networks using an ant-based system, shown to drop fewer calls than the other methods, while exhibiting many attractive features of distributed control.
ACO algorithms for the quadratic assignment problem
264 Citations1999Thomas Stützle, Marco Dorigo
Artificial Neural Nets and Genetic AlgorithmsImprovements on the Ant-System: Introducing the MAX-MIN Ant System
259 Citations1998Thomas Stützle, Holger H. Hoos
This paper describes in detail the improvements on Ant system, discusses the addition of local search to MMAS, and reports on the computational results, showing that the system also improves over other variations of Ant system.
Ants and reinforcement learning: a case study in routing in dynamic networks
228 Citations1997Devika Subramanian, Peter Druschel +1 more
Two new distributed routing algorithms for data networks based on simple biological "ants" that explore the network and rapidly learn good routes, using a novel variation of reinforcement learning are investigated, and they scale well with increase in network size-using a realistic topology.
Mobile agents for adaptive routing
216 Citations2002Gianni A. Di, Marco Dorigo
AntNet is an adaptive, distributed, mobile-agents-based algorithm which was inspired by recent work on the ant colony metaphor and showed both very good performances and robustness under all the experimental conditions with respect to its competitors.
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)Self-organization mechanisms in ant societies. I: Trail recruitment to newly discovered food sources
206 Citations1987Jacques M. Pasteéls, Jean‐Louis Deneubourg +1 more
European Journal of Operational ResearchThe savings algorithm for the vehicle routing problem
199 Citations1988Heinrich Paessens
Modifications of the savings method are presented which show less CPU time and reduced storage requirements, therefore, the Savings method can be implemented on microcomputers.
A Computational Study
183 Citations1996Dirk C. Mattfeld
This chapter continues with a detailed computational study of the most powerful algorithm on 162 benchmark problems and discusses the suitability of the algorithm for either very large or very difficult JSP instances.
Lecture notes in computer scienceA study of some properties of Ant-Q
178 Citations1996Marco Dorigo, Luca Maria Gambardella
This article focuses on the experimental study of the sensitivity of the Ant-Q algorithm to its parameters and on the investigation of synergistic effects when using more than a single ant.
Lecture notes in computer scienceParallelization strategies for Ant Colony Optimization
175 Citations1998Thomas Stützle
The empirical tests are performed applying MAX-MIN Ant System, one of the most efficient ACO algorithms, to the Traveling Salesman Problem and show that using parallel independent runs is very effective.
Lecture notes in computer scienceNew genetic local search operators for the traveling salesman problem
168 Citations1996Bernd Freisleben, Peter Merz
An approach is presented to incorporate problem specific knowledge into a genetic algorithm which is used to compute near-optimum solutions to traveling salesman problems (TSP).
Lecture notes in computer scienceAnt colonies for adaptive routing in packet-switched communications networks
164 Citations1998Gianni A. Di, Marco Dorigo
Comp compelling evidence is presented that AntNet, when measuring performance by standard measures such as network throughput and average packet delay, outperforms the current Internet routing algorithm (OSPF), some old Internet routing algorithms (SPF and distributed adaptive Bellman-Ford), and recently proposed forms of asynchronous online BellMan-Ford (Q-routing and Predictive Q- routing).
Applied optimizationParallelization Strategies for the Ant System
150 Citations1998B. Bullnheimer, Gabriele Kotsis +1 more
Two parallelization strategies for an Ant System implementation are developed and evaluated: the synchronous parallel algorithm and the partially asynchronous parallel algorithm.
Artificial IntelligenceTheory and algorithms for plan merging
147 Citations1992David E. Foulser, Ming Li +1 more
This paper provides a formal theory for plan merging and presents both optimal and efficient heuristic algorithms for finding minimum cost merged plans and demonstrates that efficient and well-behaved approximation algorithms are applicable for optimizing plans with large sizes.
Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks
138 Citations1998Gianni A. Di, Marco Dorigo
Two versions of AntNet, a novel approach to adaptive learning of routing tables in wide area best-effort datagram networks, are presented, showing superior performance with respect to the current Internet routing algorithm (OSPF), some improved old Internet routing algorithms, and recently proposed forms of asynchronous online Bellman-Ford.
Lecture notes in computer scienceRouting in telecommunications networks with ant-like agents
133 Citations1998Eric Bonabeau, Florian Hénaux +4 more
In the present work, agents are very similar to those proposed by Schoonderwoerd et al.
European Journal of Operational ResearchAn inexact algorithm for the sequential ordering problem
129 Citations1988Laureano F. Escudero
The AP-based lower bound on the optimal solution to ATSP is tightened by using some of the procedures given in [1]; a local search for improving the initial FSO is performed; it uses 3- and 4-changed based procedures.
Routing high-bandwidth traffic in max-min fair share networks
127 Citations1996Qingming Ma, Peter Steenkiste +1 more
This work identifies a link-cost or cost metric for "shortest-path" routing that performs uniformly better than the minimal-hop routing and shortest-widest path routing algorithms and proposes a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths.
Lecture notes in computer scienceAn island model based ant system with lookahead for the shortest supersequence problem
123 Citations1998René Michel, Martin Middendorf
An Ant Colony Optimisation (ACO) algorithm for the Shortest Common Supersequence (SCS) problem, which has applications in production system planning, mechanical engineering and molecular biology is introduced.
Theoretical Computer ScienceThe shortest common supersequence problem over binary alphabet is NP-complete
121 Citations1981Kari‐Jouko Räihä, Esko Ukkonen
The SCS problem is shown to be NP-complete for strings over an alphabet of size ⩾ 2 and the complexity of the Shortest Common Supersequence problem is considered.
The Max-Min ANT System and Local Search for Combinatorial Optimization Problems
121 Citations1999Thomas Stützle, Holger H. Hoos
The computational results show that this algorithm can be used to efficiently find near-optimal solutions to hard combinatorial optimization problems and that it is one of the best methods for the solution of structured quadratic assignment problems.
Advances in Complex SystemsAdaptive Agent-Driven Routing and Load Balancing in Communication Networks
114 Citations1998Martin Heusse, Dominique Snyers +2 more
This paper presents an unified overview of a new family of distributed algortithms for routing and load balancing in dynamic communication networks that combine the ideas of online asynchronous distance vector routing with adaptive link state routing.
RePEc: Research Papers in EconomicsRouting in Telecommunications Networks with ``Smart'' Ant-Like Agents
103 Citations1998Eric Bonabeau, Florian Hénaux +4 more
Results of the first international contest on evolutionary optimisation (1st ICEO)
93 Citations2002Hugues Bersini, Marco Dorigo +3 more
The paper is dedicated to the presentation of the results of the first ICEO contest, where 8 participants tested their algorithm on the real function benchmark and 3 on the TSP problems.
Journal of HeuristicsEmbedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
91 Citations1995Daniel Costa, Alain Hertz +1 more
An evolutionary procedure for solving general optimization problems that combines efficiently the mechanism of a simple descent method and of genetic algorithms is presented.
Management ScienceThree Heuristic Rules for Sequencing Jobs to a Single Production Facility
84 Citations1965J. William Gavett
The study consists of examining the performance of the three heuristic rules in terms of the optimal downtime obtained by the branch and bound algorithm and the downtime which results from a random sequencing of jobs through the facility.
Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles)Parallel Genetic Algorithms: Introduction and Overview of Current Research
62 Citations1993Marco Dorigo, Vittorio Maniezzo +1 more
IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)Colonies of learning automata
61 Citations2002Katja Verbeeck, Ann Nowé
It is shown that a set of interconnected LAs is also able to describe the behavior of an ant colony, capable of finding the shortest path from their nest to food sources and back.
ACM SIGCOMM Computer Communication ReviewRouting high-bandwidth traffic in max-min fair share networks
61 Citations1996Qingming Ma, Peter Steenkiste +1 more
Ant colonies are good at solving constraint satisfaction problems
58 Citations2002L. Schoofs, Bart Naudts
It turns out that the ant algorithm outperforms all other algorithms and that bivariate distribution algorithms perform worse than the univariate ones, the latter largely due to the fact that they cannot model the randomly generated instances.
An adaptive multi-agent routing algorithm inspired by ants behavior
57 Citations1998Gianni A. Di, Marco Dorigo +2 more
AntNet is a novel adaptive approach to routing tables learning in connectionless communications networks inspired by the stigmergy communication model observed in ant colonies that outperforms the competing algorithms.
OR SpectrumImproved heuristics and a genetic algorithm for finding short supersequences
40 Citations1998J�rgen Branke, Martin Middendorf +1 more
Several heuristics and a genetic algorithm are described for the Shortest Common Supersequence (SCS) problem, an NP-complete problem with applications in production planning, mechanical engineering and data compression.
Future Generation Computer SystemsANTS: Agents on Networks, Trees, and Subgraphs
40 Citations2000Israel A. Wagner, Michael Lindenbaum +1 more
It is proved that if a certain spanning subgraph S is stable during the period of covering, then the VAW method is guaranteed to cover the graph within time nd s, and if a failure occurs on each edge with probability p , then the expected cover time is bounded from above by nd.
An ACO algorithm for the shortest common supersequence problem
33 Citations1999René Michel, Martin Middendorf
Discrete Event Dynamic SystemsVariance reduction algorithms for parallel replicated simulation of uniformized Markov chains
18 Citations1996Simon Streltsov, Pirooz Vakili
This work investigates various ways of inducing correlation across replications in order to reduce the variance of estimators obtained from the M replications of a uniformizable Markov chain.
Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsSimple learning algorithm for the traveling salesman problem
15 Citations1997Kan Chen
A learning algorithm for solving the traveling salesman problem based on a simple strategy of trial and adaptation is proposed and near-optimal tours can be obtained with the average tour lengths close to the lower bounds for the shortest tour lengths.
International Journal of Modern Physics CPARALLEL ARCHITECTURES AND INTRINSICALLY PARALLEL ALGORITHMS: GENETIC ALGORITHMS
7 Citations1994R. Campanini, Gianni A. Di +3 more
Two versions of genetic algorithms are developed, differing in the way the population is organized and their characteristics and performances when applied to the optimization of multidimensional function problems are studied.
…