[PDF] Top 20 Applying genetic algorithms to convoy scheduling

Applying genetic algorithms to convoy scheduling

... ability to adapt local business rules into the ...easy to explain and validate with the domain experts as changes were ...ability to refine the fitness function with data collected from probes ... See full document

9

A genetic approach using direct representation of solution for the parallel task scheduling problem

... repair algorithms can be used to remedy this situation [Michalewicz ...applied to invalid offspring in order to lower their fitness values but allowing them to remain in the population ... See full document

9

A simple genetic algorithm for a minimal overlapping scheduling problem

... Routing algorithms do not consider fleets having a finite number of vehicles and also do not allow vehicles to perform more than one route in a planning ...routes to vehicles is not a trivial task ... See full document

11

Multiobjective evolutionary algorithms for job shop scheduling

... promising genetic algorithm approach to job-shop scheduling, rescheduling, and open-shop scheduling ...on Genetic Algorithms ... See full document

3

Evolutionary algorithms whit studs and random immigrants to solve E/T scheduling problems

... applied to the common due date problem for single machine ...is to find an equilibrium between exploration and exploitation in the search ...ensures to retain good features of previous solutions ... See full document

3

Solving unrestricted parallel machine scheduling problems via evolutionary algorithms

... of genetic material is limited to pairs of parents from the mating ...that to create offspring all possible pairs could be formed, obtaining 2 children from each pair after a single crossover ... See full document

5

Performance analysis of scheduling algorithms in Next Generation Networks

... For access networks, not only Y.1541 must be considered, but also technical report TR-126, that specifies different subjective and objective tests associated with QoS, like MOS (Mean Opinion Score)[23] and PESQ ... See full document

6

Hardware thread scheduling algorithms for single-ISA asymmetric CMPs

... is to be properly exploited. Thus, dynamic thread scheduling techniques are of paramount importance in ACMP designs since they can make or break performance benefits derived from the asymmetric hardware or ... See full document

124

Evolutionary computing and particle filtering: a hardware-based motion estimation system

... The characteristic properties of the genetic operators make evolutionary algorithms a potential tool in particle filtering, since they are able to reduce to almost negligible values b[r] ... See full document

14

Control self triggered para seguimiento de trayectorias no lineales de robots con adaptación al retardo del canal

... lineal y angular es la mostrada en el apartado de simulación. Los resultados experimentales han sido obtenidos sólo para la solución STC adaptativa, debido a que el bajo índice de comporta- miento de la σ baja (σ = 0,05) ... See full document

134

TítuloUsing genetic algorithms for automatic recurrent ANN development: an application to EEG signal classification

... The data used in this paper is well described by Andrzejak et al. (2001), and is publicly available. The complete dataset consists of five sets (denoted A–D), each containing 100 single- channels EEG signals of 23.6 s., ... See full document

9

Running Genetic Algorithms in the Edge: A First Analysis

... emerging to solve these ...closer to the source of ...necessary to perform some data analysis at the edge instead of sending all data to the ...cloud. To achieve this, edge computing ... See full document

10

Taxonomic evidence applying algorithms of intelligent data mining . Asteroids families

... respect to the dynamical parameters and any physical study that is accomplished on the same should be ...addition to the methodological doubt [the ... See full document

7

Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem

... 6XSSRVLQJ D -663 ZLWK MREV DQG PDFKLQHV D SRVVLEOH FKURPRVRPH XQGHU RSHUDWLRQ EDVHG UHSUHVHQWDWLRQ PLJKW EH [ > @ 1RZ VRPH HYDOXDWLRQ IXQFWLRQ WKDW SURYLGHV IHHGEDFN IRU WKH[r] ... See full document

11

Distributed Estimation of Distribution Algorithms for continuous optimization: how does the exchanged information influence their behavior?

... In general terms, EDAs are similar to Genetic Algorithms (GAs), but their main characteristic is the use of probabilistic models to extract information from the most promising individu[r] ... See full document

24

TítuloA genetic algorithms based approach for optimizing similarity aggregation in ontology matching

... considered to be an appropriate solution to the problem of heterogeneity in data, since ontological methods make it possible to reach a common understanding of concepts in a particular domain, ... See full document

10

Contrasting main selection methods in genetic algorithms

... due to De Jong [9] who introduced several variations of proportional ...associated to each individual, which is decreased each time it is selected for ... See full document

16

Dynamic scheduling in heterogeneous multiprocessor architectures . Efficiency analysis

... To run the applications, a heterogeneous architecture formed by two clusters interconnected by a switch is used. The first (cluster 1) is composed by 25 processors (Pentium IV 2.4Ghz, 1Gb RAM), and the second ... See full document

10

Contrasting termination criteria for genetic algorithms

... According to this category a genetic algorithm stops if the fitness of the best individual, or the mean population fitness does not change afier certain number of [r] ... See full document

5

MCPC: another approach to crossover in genetic algorithms

... This set of initial experiments were designed in such a way that for each mating pair, the Multiple Crossover Per Couple (MCPC) approach would allow a variable [r] ... See full document

10