| Type of Material: | Thesis |
| Title: | Network design using Genetic Algorithm |
| Researcher: | Kumar, Anand |
| Guide: | Jani, N N |
| Department: | Department of Computer Science |
| Publisher: | Saurashtra University, Rajkot |
| Place: | Rajkot |
| Year: | April, 2010 |
| Language: | English |
| Subject: | Network design | Networking | Genetic algorithm | Computer Science and Applications | Engineering and Technology |
| Dissertation/Thesis Note: | PhD |
| Fulltext: | Shodhganga |
| 000 | 00000ntm a2200000ua 4500 | |
| 001 | 447247 | |
| 003 | IN-AhILN | |
| 005 | 2023-07-05 16:38:23 | |
| 008 | __ | 230705t2023||||ii#||||g|m||||||||||eng|| |
| 035 | __ | |a(IN-AhILN)th_447247 |
| 040 | __ | |aSAUR_360005|dIN-AhILN |
| 041 | __ | |aeng |
| 100 | __ | |aKumar, Anand|eResearcher |
| 110 | __ | |aDepartment of Computer Science|bSaurashtra University, Rajkot|dRajkot|ein |
| 245 | __ | |aNetwork design using Genetic Algorithm |
| 260 | __ | |aRajkot|bSaurashtra University, Rajkot|cApril, 2010 |
| 300 | __ | |dDVD|a238p. |
| 500 | __ | |aAbstract includs, Bibliography p.232-236 |
| 502 | __ | |bPhD |
| 520 | __ | |aNetwork Design Problems are becoming increasingly critical & complex as telecommunication networks (and others) are expanded & upgraded in response to consumer’s information needs. Network design is used extensively in practice in an ever expanding spectrum of applications. Network optimization models such as shortest path, assignment, maxflow, transportation, transshipment, spanning tree, matching, traveling salesman, generalized assignment, vehicle routing, and multicommodity flow constitute the most common class of practical network optimization problems. In this research work, a generalized network design problems (NDPs) is focused in the form of a large scale backbone network which belong to the family of NP-hard combinatorial optimization problems. The purpose of the backbone is to connect regional distribution networks and, in some instances, to provide connectivity to other peer networks. The primary objective of this research work is to develop a robust method based on genetic algorithm to solve |
| 650 | __ | |aComputer Science and Applications|2UGC |
| 650 | __ | |aEngineering and Technology|2AIU |
| 653 | __ | |aNetwork design |
| 653 | __ | |aNetworking |
| 653 | __ | |aGenetic algorithm |
| 700 | __ | |aJani, N N|eGuide |
| 856 | __ | |uhttp://shodhganga.inflibnet.ac.in/handle/10603/2298|yShodhganga |
| 905 | __ | |afromsg |
User Feedback Comes Under This section.