CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - app
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - app - List
[
AI-NN-PR
]
edrk
DL : 0
主要包括免疫识别、免疫学习、免疫 记忆、克隆选择、个体多样性、分布式和自适应等,-It is the real engineering app licat ion s that draw the b road at ten2 t ion of compu ter scien t ist s to recogn ize the great po ten t ial of A IS, hereby som e impo rtan t app li2 cat ion f ields as info rm at ion secu rity, pat tern recogn it ion, op t im izat ion, m ach ine learn ing, data m in ing, robo t ics, diagno st ics and cybernet ics etc. are review ed
Date
: 2026-01-09
Size
: 1kb
User
:
小蓝
[
AI-NN-PR
]
TSPandMTSP
DL : 0
MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。-M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2 brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive.
Date
: 2026-01-09
Size
: 212kb
User
:
liqiubin
[
AI-NN-PR
]
AHybidGeneticAgorithmtoSolveTSPandMTSP
DL : 0
求解TSP和MTSP的混合遗传算法_英文_-Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2 brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive. Key words: TSP op t im izat ion genet ic algo rithm 2op t
Date
: 2026-01-09
Size
: 212kb
User
:
Notics
[
AI-NN-PR
]
8Queen
DL : 0
8 Queen game with c++ console app
Date
: 2026-01-09
Size
: 1kb
User
:
Saeed Torabzadeh
[
AI-NN-PR
]
App (2)
DL : 0
Backpropagartion in java Neural Network
Date
: 2026-01-09
Size
: 2.93mb
User
:
victor39
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.