Results 11  20
of
1,502
A Survey of Automated Timetabling
 ARTIFICIAL INTELLIGENCE REVIEW
, 1999
"... The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which diff ..."
Abstract

Cited by 143 (13 self)
 Add to MetaCart
The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. A large number of variants of the timetabling problem have been proposed in the literature, which differ from each other based on the type of institution involved (university or high school) and the type of constraints. This problem, that has been traditionally considered in the operational research field, has recently been tackled with techniques belonging also to artificial intelligence (e.g. genetic algorithms, tabu search, simulated annealing, and constraint satisfaction). In this paper, we survey the various formulations of the problem, and the techniques and algorithms used for its solution.
Tackling RealCoded Genetic Algorithms: Operators and Tools for Behavioural Analysis
 Artificial Intelligence Review
, 1998
"... . Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the natural evolution principles of ..."
Abstract

Cited by 127 (24 self)
 Add to MetaCart
. Genetic algorithms play a significant role, as search techniques for handling complex spaces, in many fields such as artificial intelligence, engineering, robotic, etc. Genetic algorithms are based on the underlying genetic process in biological organisms and on the natural evolution principles of populations. These algorithms process a population of chromosomes, which represent search space solutions, with three operations: selection, crossover and mutation. Under its initial formulation, the search space solutions are coded using the binary alphabet. However, the good properties related with these algorithms do not stem from the use of this alphabet; other coding types have been considered for the representation issue, such as real coding, which would seem particularly natural when tackling optimization problems of parameters with variables in continuous domains. In this paper we review the features of realcoded genetic algorithms. Different models of genetic operators and some me...
Algorithms for the Satisfiability (SAT) Problem: A Survey
 DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1996
"... . The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computeraided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, compute ..."
Abstract

Cited by 124 (3 self)
 Add to MetaCart
. The satisfiability (SAT) problem is a core problem in mathematical logic and computing theory. In practice, SAT is fundamental in solving many problems in automated reasoning, computeraided design, computeraided manufacturing, machine vision, database, robotics, integrated circuit design, computer architecture design, and computer network design. Traditional methods treat SAT as a discrete, constrained decision problem. In recent years, many optimization methods, parallel algorithms, and practical techniques have been developed for solving SAT. In this survey, we present a general framework (an algorithm space) that integrates existing SAT algorithms into a unified perspective. We describe sequential and parallel SAT algorithms including variable splitting, resolution, local search, global optimization, mathematical programming, and practical SAT algorithms. We give performance evaluation of some existing SAT algorithms. Finally, we provide a set of practical applications of the sat...
Cooperative MultiAgent Learning: The State of the Art
 Autonomous Agents and MultiAgent Systems
, 2005
"... Cooperative multiagent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among the agents, multiagent problem complexity can rise rapidly with the number of agents or their behavioral sophistication. ..."
Abstract

Cited by 117 (6 self)
 Add to MetaCart
Cooperative multiagent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among the agents, multiagent problem complexity can rise rapidly with the number of agents or their behavioral sophistication. The challenge this presents to the task of programming solutions to multiagent systems problems has spawned increasing interest in machine learning techniques to automate the search and optimization process. We provide a broad survey of the cooperative multiagent learning literature. Previous surveys of this area have largely focused on issues common to specific subareas (for example, reinforcement learning or robotics). In this survey we attempt to draw from multiagent learning work in a spectrum of areas, including reinforcement learning, evolutionary computation, game theory, complex systems, agent modeling, and robotics. We find that this broad view leads to a division of the work into two categories, each with its own special issues: applying a single learner to discover joint solutions to multiagent problems (team learning), or using multiple simultaneous learners, often one per agent (concurrent learning). Additionally, we discuss direct and indirect communication in connection with learning, plus open issues in task decomposition, scalability, and adaptive dynamics. We conclude with a presentation of multiagent learning problem domains, and a list of multiagent learning resources. 1
SelfAdaptation in Genetic Algorithms
 Proceedings of the First European Conference on Artificial Life
, 1992
"... Within Genetic Algorithms (GAs) the mutation rate is mostly handled as a global, external parameter, which is constant over time or exogeneously changed over time. In this paper a new approach is presented, which transfers a basic idea from Evolution Strategies (ESs) to GAs. Mutation rates are chang ..."
Abstract

Cited by 115 (2 self)
 Add to MetaCart
Within Genetic Algorithms (GAs) the mutation rate is mostly handled as a global, external parameter, which is constant over time or exogeneously changed over time. In this paper a new approach is presented, which transfers a basic idea from Evolution Strategies (ESs) to GAs. Mutation rates are changed into endogeneous items which are adapting during the search process. First experimental results are presented, which indicate that environment dependent selfadaptation of appropriate settings for the mutation rate is possible even for GAs. Furthermore, the reduction of the number of external parameters of a GA is seen as a first step towards achieving a problemdependent selfadaptation of the algorithm. Introduction Natural evolution has proven to be a powerful mechanism for emergence and improvement of the living beings on our planet by performing a randomized search in the space of possible DNAsequences. Due to this knowledge about the qualities of natural evolution, some resea...
Evolutionary Algorithms
 IEEE Transactions on Evolutionary Computation
, 1996
"... . Evolutionary algorithms have been gaining increased attention the past few years because of their versatility and are being successfully applied in several different fields of study. We group under this heading a family of new computing techniques rooted in biological evolution that can be used fo ..."
Abstract

Cited by 109 (31 self)
 Add to MetaCart
. Evolutionary algorithms have been gaining increased attention the past few years because of their versatility and are being successfully applied in several different fields of study. We group under this heading a family of new computing techniques rooted in biological evolution that can be used for solving hard problems. In this chapter we present a survey of genetic algorithms and genetic programming, two important evolutionary techniques. We discuss their parallel implementations and some notable extensions, focusing on their potential applications in the field of evolvable hardware. 1 Introduction The performance of modern computers is quite impressive; it seems fair to say that computers are far better than humans in many domains and that they comprise a powerful tool that is constantly changing our view of the world. On scientific and engineering numbercrunching problems performance increases steadily and we are able to tackle socalled "grand challenge" problems with gigaflop...
Evolving cellular automata to perform computations: Mechanisms and impediments
 Physica D
, 1994
"... We present results from experiments in which a genetic algorithm (GA) was used to evolve cellular automata (CAs) to perform a particular computational task—onedimensional density classification. We look in detail at the evolutionary mechanisms producing the GA’s behavior on this task and the impedi ..."
Abstract

Cited by 105 (15 self)
 Add to MetaCart
We present results from experiments in which a genetic algorithm (GA) was used to evolve cellular automata (CAs) to perform a particular computational task—onedimensional density classification. We look in detail at the evolutionary mechanisms producing the GA’s behavior on this task and the impediments faced by the GA. In particular, we identify four “epochs of innovation ” in which new CA strategies for solving the problem are discovered by the GA, describe how these strategies are implemented in CA rule tables, and identify the GA mechanisms underlying their discovery. The epochs are characterized by a breaking of the task’s symmetries on the part of the GA. The symmetry breaking results in a shortterm fitness gain but ultimately prevents the discovery of the most highly fit strategies. We discuss the extent to which symmetry breaking and other impediments are general phenomena in any GA search. 1.
COPASI  a COmplex PAthway SImulator
 BIOINFORMATICS
, 2006
"... Motivation: Simulation and modeling is becoming a standard approach to understand complex biochemical processes. Therefore, there is a big need for software tools that allow access to diverse simulation and modeling methods as well as support for the usage of these methods. Results: Here, we present ..."
Abstract

Cited by 104 (1 self)
 Add to MetaCart
Motivation: Simulation and modeling is becoming a standard approach to understand complex biochemical processes. Therefore, there is a big need for software tools that allow access to diverse simulation and modeling methods as well as support for the usage of these methods. Results: Here, we present COPASI, a platformindependent and userfriendly biochemical simulator that offers several unique features. We discuss numerical issues with these features, in particular the criteria to switch between stochastic and deterministic simulation methods, hybrid deterministicstochastic methods, and the importance of random number generator numerical resolution in stochastic simulation. Availability: The complete software is available in binary (executable) for MS Windows, OS X, Linux (Intel), and Sun Solaris (SPARC), as well as the full source code under an open source license from
Theoretical and Numerical ConstraintHandling Techniques used with Evolutionary Algorithms: A Survey of the State of the Art
, 2002
"... This paper provides a comprehensive survey of the most popular constrainthandling techniques currently used with evolutionary algorithms. We review approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations of the imm ..."
Abstract

Cited by 102 (21 self)
 Add to MetaCart
This paper provides a comprehensive survey of the most popular constrainthandling techniques currently used with evolutionary algorithms. We review approaches that go from simple variations of a penalty function, to others, more sophisticated, that are biologically inspired on emulations of the immune system, culture or ant colonies. Besides describing briefly each of these approaches (or groups of techniques), we provide some criticism regarding their highlights and drawbacks. A small comparative study is also conducted, in order to assess the performance of several penaltybased approaches with respect to a dominancebased technique proposed by the author, and with respect to some mathematical programming approaches. Finally, we provide some guidelines regarding how to select the most appropriate constrainthandling technique for a certain application, ad we conclude with some of the the most promising paths of future research in this area.
On the Use of NonStationary Penalty Functions to Solve Nonlinear Constrained Optimization Problems with GA's
 In
, 1994
"... In this paper we discuss the use of nonstationary penalty functions to solve general nonlinear programming problems (NP ) using realvalued GAs. The nonstationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty i ..."
Abstract

Cited by 101 (7 self)
 Add to MetaCart
In this paper we discuss the use of nonstationary penalty functions to solve general nonlinear programming problems (NP ) using realvalued GAs. The nonstationary penalty is a function of the generation number; as the number of generations increases so does the penalty. Therefore, as the penalty increases it puts more and more selective pressure on the GA to find a feasible solution. The ideas presented in this paper come from two basic areas: calculusbased nonlinear programming and simulated annealing. The nonstationary penalty methods are tested on four NP test cases and the effectiveness of these methods are reported.. 1 Introduction Constrained function optimization is an extremely important tool used in almost every facet of engineering, operations research, mathematics, and etc. Constrained optimization can be represented as a nonlinear programming problem. The general nonlinear programming problem is defined as follows: (NP ) minimize f(X) subject to (nonlinear and linear)...