Location:
Search - routing GA
Search list
Description: 带有QoS约束的组播路由问题是一个NP完全问题，遗传模拟退火算法是遗传算法和模拟退火算法的一种融合，可以为这类问题提供一个解决方案-With QoS constraint multicast routing problem is an NP-complete problem, genetic simulated annealing algorithm is a genetic algorithm and simulated annealing algorithm as a fusion, you can provide for such a solution
Platform: |
Size: 2048 |
Author: zhao xian sheng |
Hits:
Description: 提供一个Adhoc各种路由的ns2的tcl文挡和gawk文挡对所生成的trace文件进行跟踪分析-Adhoc routing to provide a variety of the ns2 and gawk block tcl text block of text generated by track analysis of trace file
Platform: |
Size: 2048 |
Author: zhouhao |
Hits:
Description: Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time
the pdf. it s useful to stuy GA for reader.-Ant colony Algorithm for Vehicle Routing Problem wiht ComPleiton Time the pdf. It' s useful to stuy GA for reader.
Platform: |
Size: 199680 |
Author: lisea |
Hits:
Description: GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.-GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.
Platform: |
Size: 1024 |
Author: gardenia_roses |
Hits:
Description: 基于免疫遗传算法的QOS路由选择问题
给予免疫遗传算法的多目标优化问题
-Immune genetic algorithm based QOS routing problems provide the immune genetic algorithm for multi objective optimization problem
Platform: |
Size: 242688 |
Author: 路杨 |
Hits:
Description: QoS Simmulated annuling Multicast routing
Platform: |
Size: 24576 |
Author: matin |
Hits:
Description: 基于遗传算法和模拟退火算法融合的带QoS约束的组播路由算法 Matlab代码- QoS constrained multicast routing algorithm based on GA
Platform: |
Size: 2048 |
Author: 看 |
Hits:
Description: 这是通信学报2004年的一篇论文，一种QoS路由多目标遗传算法-This is the communication of a paper in 2004, a multi-objective genetic algorithm for QoS routing
Platform: |
Size: 166912 |
Author: lizhi |
Hits:
Description: QoS routing in matlab formulticast network
Platform: |
Size: 2048 |
Author: maliheh |
Hits:
Description: program for vehicle routing programming in ga
Platform: |
Size: 4096 |
Author: garima |
Hits:
Description: 这是基于matlab的通过遗传算法解决物流配送车辆路径问题-This is based on matlab by genetic algorithms to solve the logistics distribution vehicle routing problem
Platform: |
Size: 20480 |
Author: |
Hits:
Description: 用遗传算法--模拟退火算法求解车辆路径问题。-Using genetic algorithms- simulated annealing algorithm for vehicle routing problem.
Platform: |
Size: 11264 |
Author: 马文 |
Hits:
Description: 解决车辆路径问题的遗传算法，已经验证，可以运行-Solving vehicle routing problem genetic algorithm has been verified, you can run
Platform: |
Size: 7168 |
Author: 刘长石 |
Hits:
Description: 遗传算法tsp问题 针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。-Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.
Platform: |
Size: 185344 |
Author: |
Hits:
Description: 一种改进的混合遗传算法主要用于解决车辆路径时间窗问题-An improved hybrid genetic algorithm is used to solve vehicle routing time window problem
Platform: |
Size: 2048 |
Author: 曹美轩 |
Hits:
Description: A joint selfish routing and channel assignment game in wireless mesh networks
Platform: |
Size: 735232 |
Author: Nima |
Hits:
Description: Genetic Algorithm(GA) Matlab Codes for Vehicle Routing Problem With Time Window(VRPTW)
Platform: |
Size: 101376 |
Author: diako |
Hits:
Description: Energy is one of the most important items to determine the network lifetime due to low power energy nodes included in the network. Generally, data aggregation tree concept is used to find an energy efficient solution. However, even the best aggregation tree does not share the load of data packets to the transmitting nodes fairly while it is consuming the lowest possible energy of the network. Therefore, after some rounds, this problem causes to consume the whole energy of some heavily loaded nodes and hence results in with the death of the network. In this paper, by using the Genetic Algorithm (GA), we investigate the energy efficient data collecting spanning trees to find a suitable route which balances the data load throughout the network and thus balances the residual energy in the network in addition to consuming totally low power of the network. Using an algorithm which is able to balance the residual energy among the nodes can help the network to withstand more and consequently extend its own lifetime. In this work, we calculate all possible routes represented by the aggregation trees through the genetic algorithm. GA finds the optimum tree which is able to balance the data load and the energy in the network. Simulation results show that this balancing operation practically increases the network lifetime.
Platform: |
Size: 342534 |
Author: atrakpc@yahoo.com |
Hits:
Description: Routing algorithms in networks
Platform: |
Size: 176128 |
Author: srinihp
|
Hits:
Description: 这个代码是采用遗传算法解决车辆路径优化问题，大家一块学习(This code is to solve the vehicle routing optimization problem with genetic algorithm.)
Platform: |
Size: 2048 |
Author: 潇1默 |
Hits: