Evolutionary Computation in Combinatorial Optimization: 4th by Adnan Acan (auth.), Jens Gottlieb, Günther R. Raidl (eds.)

By Adnan Acan (auth.), Jens Gottlieb, Günther R. Raidl (eds.)

This ebook constitutes the refereed court cases for the 4th eu convention on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2004, held in Coimbra, Portugal, in April including EuroGP 2004 and 6 workshops on evolutionary computing.

The 23 revised complete papers awarded have been rigorously reviewed and chosen from 86 submissions. one of the issues addressed are evolutionary algorithms in addition to metaheuristics like memetic algorithms, ant colony optimization, and scatter seek; the papers are facing representations, operators, seek areas, model, comparability of algorithms, hybridization of other tools, and idea. one of the combinatorial optimization difficulties studied are graph coloring, community layout, slicing, packing, scheduling, timetabling, touring salesman, car routing, and numerous different real-world purposes.

Show description

Read or Download Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings PDF

Similar computational mathematicsematics books

Bio-Inspired Modeling of Cognitive Tasks: Second International Work-Conference on the Interplay between Natural and Artificial Computation, Iwinac 200

The two-volume set LNCS 4527 and LNCS 4528 constitutes the refereed complaints of the second one foreign Work-Conference at the interaction among ordinary and synthetic Computation, IWINAC 2007, held in l. a. Manga del Mar Menor, Spain in June 2007. The 126 revised papers offered are thematically divided into volumes; the 1st comprises all of the contributions ordinarily comparable with theoretical, conceptual and methodological points linking AI and information engineering with neurophysiology, clinics and cognition.

Numerical Methods

This graduate textbook introduces numerical tools for approximating mathematical difficulties which regularly ensue as subproblems or computational info of bigger difficulties. initially released as Numeriska metoder via CWK Gleerup in 1969, this can be an unabridged reprint of the English translation released by means of Prentice-Hall in 1974.

Computational Science and Its Applications - ICCSA 2006: International Conference, Glasgow, UK, May 8-11, 2006. Proceedings, Part II

This ? ve-volume set was once compiled following the 2006 foreign convention on Computational technological know-how and its purposes, ICCSA 2006, held in Glasgow, united kingdom, in the course of might 8–11, 2006. It represents the phenomenal selection of virtually 664 refereed papers chosen from over 2,450 submissions to ICCSA 2006.

Proceedings of COMPSTAT'2010: 19th International Conference on Computational StatisticsParis France, August 22-27, 2010 Keynote, Invited and Contributed Papers

Lawsuits of the nineteenth overseas symposium on computational information, held in Paris august 22-27, 2010. including three keynote talks, there have been 14 invited classes and greater than a hundred peer-reviewed contributed communications.

Additional resources for Evolutionary Computation in Combinatorial Optimization: 4th European Conference, EvoCOP 2004, Coimbra, Portugal, April 5-7, 2004. Proceedings

Sample text

Furthermore, the steady state evolutionary approach is replaced by a generational elitist EA. Preliminary experiments showed that these modifications gave better results and faster convergence (results not shown). Parameter settings: Window of adaptation (W): 100 individuals, Interval of adaptation (I): 20–50 evaluations, Shift percentage (S): 15%, Percentage of reward to pass back (P): 90%, Number of generations to pass back (M): 10. 2 The ADOPP Algorithm Julstrom’s Adaptive Operator Probabilities algorithm (ADOPP) [4] from 1995 is very similar to Davis’ approach.

First, we follow Levine and Ducatelle (2004) and group items according to their lengths. However, we then relate the lengths of an item to be packed to the filling degree of the current bin. Thus, we disregard the information about which items are already in the bin. Rather, the only thing that is important is how much space is left in the bin. 1 An entry in this matrix is thus denoted by where is the length of item and is the filling degree of a bin before item is to be filled in. By doing so we directly emphasize the importance to fill a bin as good as possible as opposed to emphasizing certain combinations of items that fill a bin as good as possible.

More precisely, a Hybrid Max-Min Ant System (denoted by HACO) is used. The solution construction mechanism used in this approach is based on the FFD heuristic and pheromone decoding is based on the pairwise favorability of item lengths in the same bin. The local search employed to improve the ants’ solutions is again based on the dominance result of Martello and Toth (1990). However, Levine and Ducatelle (2004) restrict the number of items to be replaced to two. The results show that the HACO approach finds comparable results to the HGGA.

Download PDF sample

Rated 4.20 of 5 – based on 35 votes