Corne,D.;Dorigo, M.; Glover,F.;(Eds.) 1999: , UK. McGraw Hill. New ideas in optimization  Home/Search   Document Not in Database   Summary   Related Articles   Check

....di#erent examples. The results presented show that linear lists perform better in terms of CPU time for small population sizes whereas tree structures perform better for large population sizes. I. Introduction Multi objective optimization (MO) has been investigated a lot during the last years [1], and it is proven that stochastic search methods such as evolutionary algorithms (EA) simulated annealing (SA) and Tabu search (TS) often provide the best solutions for complex optimization problems. Up to now there are a few multiobjective evolutionary algorithms (MOEA) which can be divided ....

....problems. These functions are shown in Table I. In this table, h and g are defined as below: minimize f(#x) f 1 (x 1 ) f 2 (x) subject to f 2 (#x) g(x 2 , h(f 1 (x 1 ) g(x 2 , x n ) where #x = x 1 , x n ) TABLE I TEST FUNCTIONS TF i Function x i , xn ) x1 [0, 1], 1 10(n (x i 10 cos(4#x i ) x2 , f1 g) sin(10#f1 ) 5, 5] TF6 f1 (x1 ) 1 u(x1 ) n = 11, xn ) v(u(x i ) x1 # 0, 30 , h(f1 , g) 1 f1 x2 , 0, TF7 f1 (#x) x1 n = 3, f2 (#x) x1 1) x i [ 1, 1] f3 (#x) ....

[Article contains additional citation context not shown here]

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. Mc Graw Hill, 1999.

....in the domain of Answer Set Programming. 10] uses local search techniques being inspired by works on SAT problems. 17] transforms the computation of an answer set into a graph coloring problem, solved by a genetic algorithm. 14, 15] use genetic algorithms and Ant Colony Optimization (ACO) [5, 4] to compute an extension of a Default Theory [18] The purpose of our present work is to show how ACO can be used to propose a speci c system for ASP in order to be able to exploit the peculiarities of logic programs and therefore to compute a stable model of a logic program. This approach is ....

....) and then any rule like r = c : not a; cannot belong to P . This characteristic is similar to the notion developed in [13] about compatibility between default rules. 3 Ant Colony Optimization for Stable Models 3. 1 Ant Colony Optimization principles Ant Colony Optimization (ACO) [5, 4] has been inspired by the observation of the collective behavior of ants when they are seeking food. Every ant puts a little bit of pheromone all along its walk and directs itself by choosing its way taking into account the amount of pheromone left by previous ants on each possible path. Since the ....

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. Mac Graw Hill, 1999.

....of several cycles: it is placed in a randomly chosen spot, after which the agent has to find the sought for object within the least possible number of steps. For LCSME to operate, there must be a graph of the environment s model. The construction of the graph is based on the artificial ant colony [4]. 4.1. Partial environment model construction by using ant colony optimization An artificial ant colony generates a partial model of environment. Although ants use the environment model for navigation, the model is not fully available to them. Each agent (ant) is characterized by the local ....

Corne, D., Dorigo, M., Glover, F. (ed.). New Ideas in Optimization. McGraw-Hill, London, pages 450, 1999, ISBN: 0077095065.

....G such that eval(CGD(D; G) appears in a population then the method stops and CE(G) is an extension for the given default theory. Otherwise, it stops when a maximal number of populations to be explored is reached. 4 Ant Colony Optimization Ant Colony Optimization (ACO) metaheuristics [4, 3] have been inspired by the observation of the collective behaviour of ants when they are seeking food. Let us suppose that there are many ants in a nest and that we deposit food in a place linked to the nest by two di erent paths P 1 and P 2 , such that P 1 is shorter than P 2 . At the beginning ....

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. Mac Graw Hill, 1999.

....is placed in an occasional place, after which the agent has to find the sought for object within the least possible number of steps. For an LCSME classifier system to operate it is necessary to have a graph of the environment s model. Construction of the graph based on the artificial ant colony [5]. 4.1. Partial model environment construction by using ant colony optimization An artificial ant colony generates a partial model of environment. Although ants use the environment model for navigation, the model is not fully available to them. Each agent (ant) is characterized by a local state ....

Corne, D., Dorigo, M., Glover, F. (ed.). New Ideas in Optimization. McGraw-Hill, London, pages 450, 1999, ISBN: 0077095065.

....is vast, encompassing dozens of books and a great number of papers. Heuristics such as simulated annealing [8] genetic algorithms [5] and tabu search [4] are particularly popular. We refer the interested reader to reviews of search heuristics for combinatorial optimization problems, including [1, 2, 18]. Our view on search algorithms has been shaped by our own combinatorial dominance theory of search, developed in [12] A review of six black box optimization systems is given by Mongeau, Karsenty, Rouz, and Hiriart Urruty [11] They tested the engines on three types of problems: least median ....

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, London, 1999.

....the search space is therefore the total number of weights and biases. The tness function is the mean squared error (MSE) over the training set, or the test set (as measure of generalization) The PSO algorithm is summarized below to illustrate its simplicity. The interested reader is referred to [1, 3] for more information on the swarm approach to optimization. PSO Algorithm 1. Initialize a swarm of P D dimensional particles, where D is the number of weights and biases. 2. Evaluate the tness f p of each particle p as the MSE over a given data set. 3. If f p BEST p then BEST p = f p and ....

D Corne, M Dorigo, F Glover (eds), New Ideas in Optimization, McGraw Hill, 1999.

....is vast, encompassing dozens of books and a great number of papers. Heuristics such as simulated annealing [10] genetic algorithms [5] and tabu search [4] are particularly popular. We refer the interested reader to reviews of search heuristics for combinatorial optimization problems, including [1, 2, 20]. Our view on search algorithms has been shaped by our own combinatorial dominance theory of search, developed in [14] Johnson, Aragon, McGeoch, and Schevon [8, 9] conducted experimental evaluations of simulated annealing on graph partitioning, graph coloring and number partitioning. They found ....

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, London, 1999.

....commuNjB ULNkU This collection of ongoing motivations has led to a fairly steady stream of ideas for approximate algorithms to solve hard optimization problems. In particuUjZ some of the new ideas over the past decade have given improved approaches to many well known hard optimization problems [CDG99]. 1.2 A NP Optimization Problem and Its Approximate Solution One of the most accepted ways to prove that a problem is hard is to prove it NP complete. If a decision problem is NP complete we are almost certain that it cannot be solved optimally in polynomial time. If we are given an algorithm to ....

....research e#ort to ujHBUNkUH popuZWKZN based and local search algorithms. The idea itself is to hybridize the two types of methods, and Memetic Algorithms represent a particu lar way of achieving the hybridization, and one which has achieved a considerable nu mber of suZBWUNk in recent years [CDG99]. 1.4 Thesis Outline We now give a su mmary of the following chapters of this thesis: Chapter 2: This chapter presents a general description of Memetic Algorithj . we also describe some fu LLGH tal concepts for fuHjWB analysis and design, sugn, a description of the Local search and ....

D. Corne, M. Dorigo, and F. Glover, editors. New Ideas in Optimization. McGraw-Hill. 1999.

....means to tune the equations. Despite the seeming benefit from combining GAs with synthetic pheromones, most of the literature has focused on contrasting ant optimization algorithms and GAs. Perhaps this is due to the rather simple forms most ant optimization algorithms have taken to date [3]. Some issues that GAs could address: 1. Is there a single set of parameters that would suffice for a wide range of scenarios This would avoid the need to develop new parameter settings for each new scenario. 2. There are certain non linearities in the behavior that are undesirable. For ....

D. Coren, M. Dorigo, and F. Glover, New Ideas in Optimization. McGraw Hill, 1999.

....to formulate and tune the equations. Despite the seeming benefit from combining EC with synthetic pheromones, most of the literature has focused on contrasting ant optimization algorithms and EC. Perhaps this is due to the rather simple forms most ant optimization algorithms have taken to date (Coren, 1999). Some issues that EC could address: 1. Evolving the form of the equation A parse tree could represent the equation with the operators from the set [ 2. Offline tuning for a wide range of scenarios this would avoid the need to develop new parameter settings for each new scenario. ....

D. Coren, M. Dorigo, and F. Glover, New Ideas in Optimization. McGraw Hill, 1999.

....solutions, and some existing solutions are discarded, according to criteria that tend to promote the survival of the best solutions. Other local search methods of current interest include ant colony optimization, differential evolution, immune system methods, memetic algorithms, and scatter search (Corne, Dorigo and Glover 1999). Numerous refinements have enabled such methods to adapt more readily to varying circumstances and to deal with constraints. Although a kind of asymptotic global optimality can be assured for some local search methods, as a practical matter these methods are used where circumstances do not ....

D. Corne, M. Dorigo and F. Glover, eds., 1999. New Ideas in Optimization, McGraw-Hill.

.... approach to dicult combinatorial optimization problems like the traveling salesman problem (TSP) and the quadratic assignment problem (QAP) There is currently a lot of ongoing activity in the scienti c community to extend apply ant based algorithms to many di erent discrete optimization problems [5, 21]. Recent applications cover problems like vehicle routing, sequential ordering, graph coloring, routing in communications networks, and so on. Ant algorithms were inspired by the observation of real ant colonies. Ants are social insects, that is, insects that live in colonies and whose behavior ....

D. Corne, M. Dorigo, and F. Glover, editors. New Ideas in Optimization. McGrawHill, 1999.

.... to di#cult combinatorial optimization problems like the traveling salesman problem (TSP) and the quadratic assignment problem (QAP) There is currently a lot of ongoing activity in the scientific community to extend apply ant based algorithms to many di#erent discrete optimization problems [5, 21]. Recent applications cover problems like vehicle routing, sequential ordering, graph coloring, routing in communications networks, and so on. Ant algorithms were inspired by the observation of real ant colonies. Ants are social insects, that is, insects that live in colonies and whose behavior ....

D. Corne, M. Dorigo, and F. Glover, editors. New Ideas in Optimization. McGrawHill, 1999.

No context found.

Corne,D.;Dorigo, M.; Glover,F.;(Eds.) 1999: , UK. McGraw Hill. New ideas in optimization

No context found.

Corne, D., Dorigo, M. and Glover, F., (1999), "New Ideas in Optimization".

No context found.

D. Corne, M. Dorigo, and F. Glover, editors. New Ideas in Optimization. McGraw-Hill, 1999.

No context found.

D. Corne, M. Dorigo, and F. Glover, editors. New Ideas in Optimization. McGraw-Hill, 1999.

No context found.

D. Corne, M. Dorigo, and F. Glover, eds., New Ideas in Optimization. McGraw-Hill, London, 1999.

No context found.

D. Corne, M. Dorigo, and F. Glover, eds., New Ideas in Optimization. McGraw-Hill, London, 1999.

No context found.

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, London, UK, 1999.

No context found.

D. Corne, M. Dorigo, and F. Glover. New Ideas in Optimization. McGraw-Hill, 1999.

No context found.

David Corne, Marco Dorigo and Fred Glover, eds., New Ideas in Optimization, McGraw-Hill (London, 1999).

No context found.

D. Come, M. Dorigo, and F. Glover. New Ideas in Optimization. Mc Graw Hill, 1999.

No context found.

Corne, D., Dorigo, M., & Glover, F., Eds. (1999). New Ideas in Optimization. McGraw-Hill, London.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC