• No results found

[PDF] Top 20 Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods

Has 10000 "Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods" found on our website. Below are the top 20 most common "Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods".

Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods

Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods

... SA algorithm is that the transition probability P is always non-zero, even when δE is positive, ...the algorithm accepts fewer moves to increase the system’s ... See full document

10

Information Theory optimization algorithm for efficient service orchestration in distributed systems

Information Theory optimization algorithm for efficient service orchestration in distributed systems

... multitier design where data processing and transmission are ...This network routing challenge can be modeled as a variation of the Travelling Salesman Problem ...new optimization ... See full document

48

Memetic Computing using Simulated Annealing for Dynamic Vehicle Routing Protocol Rincy N

Memetic Computing using Simulated Annealing for Dynamic Vehicle Routing Protocol Rincy N

... route optimization heuristic. In both methods the working day is divided into discrete number of time slices, with the instance of the DVRP problem “frozen” within each time ...continuous ... See full document

7

A Comparative Study of Simulated Annealing and Genetic Algorithm for Solving the Travelling Salesman Problem

A Comparative Study of Simulated Annealing and Genetic Algorithm for Solving the Travelling Salesman Problem

... Genetic Algorithm is a technique used for estimating computer models based on methods adapted from the field of genetics in ...Also, Genetic Algorithm describes a variety of modeling or ... See full document

7

Fire Fly and Artificial Bees Colony Algorithm for Synthesis of Scanned and Broadside Linear Array Antenna

Fire Fly and Artificial Bees Colony Algorithm for Synthesis of Scanned and Broadside Linear Array Antenna

... the wireless communication systems as well as reduce the inter-channel ...mobile network capacity and quality with better ...[6]. Simulated annealing [7, 8], genetic algorithm ... See full document

22

Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem

Enhanced genetic algorithm with simulated annealing in solving travelling salesman problem

... routing problem. The algorithm proposed can be used in many other important applications in VLSI design, job sequencing, data clustering, production scheduling, curve reconstruction and cutting ... See full document

12

Genetic Algorithm Performance with Different Selection Methods in Solving Multi Objective Network Design Problem

Genetic Algorithm Performance with Different Selection Methods in Solving Multi Objective Network Design Problem

... the algorithm is likely to be stuck in a local optimum due to the lack of diversity in the ...selection methods tune the selection pressure, which in turn determines the convergence rate of the ...when ... See full document

5

Job Scheduling in Grid Computing with Cuckoo Optimization Algorithm

Job Scheduling in Grid Computing with Cuckoo Optimization Algorithm

... evolutionary methods such as Genetic, Simulated Annealing (SA), Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) to solve the problem in the grid ... See full document

6

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

Solving Asymmetric Travelling Salesman Problem using Memetic Algorithm

... Salesman Problem is a problem that is not deterministic and hard and quite known in combinatorial optimization studied in theory based computer science and operation research ...a network ... See full document

6

A Hybrid Method to Solve Travelling Salesman Problem

A Hybrid Method to Solve Travelling Salesman Problem

... hybrid algorithm to solve the TSP . Their algorithm consists of the ACO algorithm hybridized with local search ...ACOMAC algorithm for solving the TSP ...parallel genetic ... See full document

5

Adaptive Relevance Feature Discovery for Text Mining with Simulated Annealing Approximation

Adaptive Relevance Feature Discovery for Text Mining with Simulated Annealing Approximation

... selected using the knowledge currently held by the ...Different methods have been used to merge and revise the weights of features in a vector ...system using the proposed model is significantly ... See full document

8

Online Full Text

Online Full Text

... article, genetic algorithm and simulated anneal- ing based categorical data clustering algorithms have been ...Keywords: Genetic Algorithm based Clustering (GAC), Simulated ... See full document

6

EFFICIENT DYNAMIC RESOURCE ALLOCATION IN CLOUD ENVIRONMENT USING SALB ALGORITHM

EFFICIENT DYNAMIC RESOURCE ALLOCATION IN CLOUD ENVIRONMENT USING SALB ALGORITHM

... the VMs in descending order according to their loads, allocating them to the physical servers in sequence. Then, we map the first virtual machine in the list which has the most workload to a physical machine which has ... See full document

8

A simulated annealing based genetic local search algorithm for multi objective multicast routing problems

A simulated annealing based genetic local search algorithm for multi objective multicast routing problems

... the simulated annealing strategies and genetic local search, we develop the first multi-objective simulated annealing based genetic local search (MOSAGLS) algorithm to ... See full document

28

Using Simulated Annealing and Ant Colony Optimization Algorithms to Solve the Scheduling Problem

Using Simulated Annealing and Ant Colony Optimization Algorithms to Solve the Scheduling Problem

... timetabling problem to be NP-complete in 1971, then Karp[8] showed in 1972 that the general problem of constructing a schedule for a set of partially ordered tasks among k -processors (where k is a ... See full document

17

Hybrid of Particle Swarm Optimization, Simulated Annealing and Tabu Search for the Reconstruction of Two-Dimensional Targets from Laboratory-Controlled Data

Hybrid of Particle Swarm Optimization, Simulated Annealing and Tabu Search for the Reconstruction of Two-Dimensional Targets from Laboratory-Controlled Data

... forward problem consists in determining the scattered field by knowing the object function and the incident ...inverse problem is reformulated as a nonlinear global optimization problem and is ... See full document

18

Clustering Routing Protocol for Energy Efficiency of Wireless Sensor Network using Genetic Algorithm

Clustering Routing Protocol for Energy Efficiency of Wireless Sensor Network using Genetic Algorithm

... heads using simulated annealing and genetic ...done using simulated annealing and genetic ...the network and which is near to the cluster center is selected ... See full document

7

Water Flow-Like Algorithm with Simulated Annealing for Travelling Salesman Problems

Water Flow-Like Algorithm with Simulated Annealing for Travelling Salesman Problems

... in solving TSP, as it characterized with dynamic population size which make it more suitable of solving variant instance size of TSP without reconfiguring the parameter ...for solving TSP ... See full document

7

Use of Evolutionary Techniques for Symbolic Execution Based Testing

Use of Evolutionary Techniques for Symbolic Execution Based Testing

... When a software product is treated as a black box for generation of test cases, it is called black box testing. Its internal structure is irrelevant. This technique of testing is also termed testing to specifications, ... See full document

6

Survey of Metaheuristic Algorithms for Combinatorial Optimization

Survey of Metaheuristic Algorithms for Combinatorial Optimization

... a genetic algorithm to solve quadratic assignment ...that genetic algorithms find a better solution than those of the best previously known heuristics ...proposed genetic algorithm to ... See full document

11

Show all 10000 documents...