Please use this identifier to cite or link to this item: http://localhost:8081/xmlui/handle/123456789/10106
Full metadata record
DC FieldValueLanguage
dc.contributor.authorJain, Praveen Kumar-
dc.date.accessioned2014-11-22T11:22:58Z-
dc.date.available2014-11-22T11:22:58Z-
dc.date.issued1984-
dc.identifierM.Techen_US
dc.identifier.urihttp://hdl.handle.net/123456789/10106-
dc.guidePanday, P. C.-
dc.guideSingh, Samar-
dc.description.abstractIn a network a rooting problem consists of finding a path between two or more nodes which 08ximiSes or minimises some measure of p2rfnr0ance along the p8th4 A number of different constraints may be placed on acceptable paths or the arcs may have several measures of performance. As these measures can not be converted to only one measore, it is necessary to optimise the path keep in in view other measures of performance or the other performances along the path may be constrained. In this presentation an algorithm 8 a software package has been developed to rind the shortest path from are node (called source node or origin node) to another node (called sink node or terminal nodg) in a network which is having side constraints on arcs, Direct Dynamic Programing principle has been applied making extensive use of sophisticated data structures for staring the network data managing the labels and facilitating the alSorithm^ The developed algorithm has been tested on various set of random data to see 1t 's computational efficiencyen_US
dc.language.isoenen_US
dc.subjectMECHANICAL INDUSTRIAL ENGINEERINGen_US
dc.subjectROOTING PROBLEMen_US
dc.subjectSOURCE NODEen_US
dc.subjectSHORTEST PATHen_US
dc.titleCOMPUTER IMPLEMENTATION TO FIND THE SHORTEST PATH SUBJECTED TO SIDE CONSTRAINTSen_US
dc.typeM.Tech Dessertationen_US
dc.accession.number178137en_US
Appears in Collections:MASTERS' DISSERTATIONS (MIED)

Files in This Item:
File Description SizeFormat 
MIED178137.pdf1.98 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.