• Nenhum resultado encontrado

[PDF] Top 20 A Genetic Algorithm for the Undirected Rural Postman Problem

Has 10000 "A Genetic Algorithm for the Undirected Rural Postman Problem" found on our website. Below are the top 20 most common "A Genetic Algorithm for the Undirected Rural Postman Problem".

A Genetic Algorithm for the Undirected Rural Postman Problem

A Genetic Algorithm for the Undirected Rural Postman Problem

... delivery, the collection of household refuse or parking meter coins, street sweepers, school buses, and the inspection of electric power or oil or gas pipelines, see Pearn (et al) ...in the area of ... See full document

13

Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms

Cutting path as a Rural Postman Problem: solutions by Memetic Algorithms

... explain the existence of dedicated heuristics and the research on new approaches that may be based on ...is the first time that MA have been employed in such a context and thus represents a good ... See full document

16

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

Optimized Crossover Genetic Algorithm for Vehicle Routing Problem with Time Windows

... Abstract: Problem statement: In this study, we considered the application of a genetic algorithm to vehicle routing problem with time windows where a set of vehicles with limits on ... See full document

7

Comparison Study for Clonal Selection Algorithm and Genetic Algorithm

Comparison Study for Clonal Selection Algorithm and Genetic Algorithm

... in the UVA Microwaves and Semiconductor Devices Laboratory between 1996-2001 as a research ...been the vice-rector of the Girne American University responsible from academic ...in the areas of ... See full document

12

Project Scheduling problem using metaheuristic algorithm

Project Scheduling problem using metaheuristic algorithm

... of the common methods is CPM (Critical Path ...On the other hand, determining project time is based on resources boundless assumption and vice versa to the real ...defects; the most ... See full document

11

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines

Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines

... whether the differences in the solution quality of the methods have statistical significance within a certain degree of ...on the relative gaps between the solution values and ... See full document

30

Recommending Recommender Systems: tackling the Collaborative Filtering algorithm selection problem

Recommending Recommender Systems: tackling the Collaborative Filtering algorithm selection problem

... to the analysis reported in Section 3.2.3 , we aim to assess the computational cost re- quired to calculate the proposed ...metafeatures. The overall results show these metafeatures require ... See full document

196

An approximation algorithm for vertex cover problem

An approximation algorithm for vertex cover problem

... 7KHSURSRVHGDOJRULWKPLVPXFKEHWWHUWKDQDSSUR[LPDWLRQDOJRULWKP,QWKHEUHDNLQJSKDVHZHDUHVHOHFWLQJWKH YHUWLFHVRQWKHEDVLVRIDSSUR[LPDWLRQZLWKVRPHPRGLILFDWLRQVWDNLQJWKHPD[GHJUHHYHUWH[DQGLWVQHLJKERU[r] ... See full document

7

Specialized genetic algorithm of Chu-Beasley applied to the Distribution System Reconfiguration problem considering several demand scenarios

Specialized genetic algorithm of Chu-Beasley applied to the Distribution System Reconfiguration problem considering several demand scenarios

... applying the Specialized Genetic Algorithm of Chu-Beasley (SGACB) described in [10] to solve the DSR problem considering different demand ...scenarios. The SGACB is a population ... See full document

5

A transgenetic algorithm for the quadratic minimum spanning tree problem

A transgenetic algorithm for the quadratic minimum spanning tree problem

... to the QMST problem being NP-hard, finding optimal solutions with exact al- gorithms takes a large amount of time even for small test ...for the optimal solution proves to be impossible for large ... See full document

49

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

Improving the Solution of Traveling Salesman Problem Using Genetic, Memetic Algorithm and Edge assembly Crossover

... Cupidity Algorithm, Dynamic Programming Algorithm, are all facing the same obstacle, which is when the problem scale N reaches to a certain degree, the so- called “Combination ... See full document

4

Uma análise do Parâmetro Big M do Modelo Matemático para o Problema do Carteiro Rural Capacitado com Janelas de Tempo/  An Analysis of the Big M Parameter of the Mathematical Model for the Capacitated Rural Postman Problem with Time Windows

Uma análise do Parâmetro Big M do Modelo Matemático para o Problema do Carteiro Rural Capacitado com Janelas de Tempo/ An Analysis of the Big M Parameter of the Mathematical Model for the Capacitated Rural Postman Problem with Time Windows

... Routing Problem with Time Windows, generally, contains a set of constraints formed by non-linear inequalities and to use exact method of resolution “Branch-and-Bound” there is a need of linearization of this set ... See full document

14

Genetic algorithm in Chemistry.

Genetic algorithm in Chemistry.

... GENETIC ALGORITHM IN CHEMISTRY. Genetic algorithm is an optimization technique based on Darwin evolution ...due the special characteristics for optimization of complex systems. ... See full document

7

An Exact Algorithm for the Maximum Weight K3-free Subgraph Problem

An Exact Algorithm for the Maximum Weight K3-free Subgraph Problem

... dicts the definition that k is the minimum. ✷ In a directed acyclic graph with vertex weights, we de- fine the length of a path Π to be the sum of the weights of the vertices on ... See full document

4

Um Algoritmo Híbrido para o Problema da Clique Máxima / A Hybrid Algorithm for the Maximum Clique Problem

Um Algoritmo Híbrido para o Problema da Clique Máxima / A Hybrid Algorithm for the Maximum Clique Problem

... Cada vértice recebe um peso que representa sua importância para a clique, sendo que os pesos são iniciados de duas formas diferentes: proporcionalmente aos graus dos vértices e com peso[r] ... See full document

25

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

SOLUTION OF TRAVELING SALESMAN PROBLEM ON SCX BASED SELECTION WITH PERFORMANCE ANALYSIS USING GENETIC ALGORITHM

... The Genetic Algorithms using SCXBS, has been coded in Visual Basic 6 on a Pentium 4 personal computer with speed 3 GHz and 2 GB MB RAM under MS Windows XP, Initial population is generated ...randomly. ... See full document

8

An Efficient Algorithm For Variant Bulk Transportation Problem

An Efficient Algorithm For Variant Bulk Transportation Problem

... share the following properties: They are Optimization Problems, are easy to state, and have a finite but usually very large number of feasible ...far the mostly used tool for solving large scale NP-hard ... See full document

6

A SearchCol Algorithm for the unrelated parallel machine scheduling problem with job splitting

A SearchCol Algorithm for the unrelated parallel machine scheduling problem with job splitting

... studied the UPMSP, with job splitting and distinct release dates for jobs and machines, to minimize total weighted ...tardiness. The authors present a MIP model using assignment and positional decision ... See full document

163

A Binary particle swarm optimization algorithm for a variant of the maximum coing problem

A Binary particle swarm optimization algorithm for a variant of the maximum coing problem

... by the theory of evolution of species, by recombining solutions, and thus aiming at performing an intelligent search of the solution ...have Genetic Algorithms (GA) and optimization based on colonies ... See full document

7

Algorithm design for the fleet sizing problem in grocery retail distribution

Algorithm design for the fleet sizing problem in grocery retail distribution

... represents the separation of products requested by a single ...if the demand is higher than the vehicle capacity, it may be also beneficial even when the demand is lower than the ... See full document

62

Show all 10000 documents...