Solving shortest path problem using gravitational search algorithm and neural networks
For many years, scientists have aware the importance of conducting research related to actual problems, and Shortest Path Problem (SPP) is one of such examples. SPP is meant to find the shortest path between two given cities or nodes. The travelled distance in such a path obviously depends on the or...
Saved in:
主要作者: | |
---|---|
格式: | Thesis |
语言: | English |
出版: |
2010
|
主题: | |
在线阅读: | http://eprints.utm.my/id/eprint/11402/5/SamanSinaieMFSKSM2010.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|