Shortest path count : a new concept for identifying potentially congested portions of a road network / Kalvin Mesias Balucanag.

By:

Balucanag, Kalvin Mesias

Material type: Text

TextLanguage: English Publication details: 2008Description: 32 leavesSubject(s):

Dissertation note: Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2008 Abstract: This study introduces the new concept of shortest path count as a measure of congestion in a network. The specific objectives of this study were to present first and apply the concept of shortest path count in identifying potentially congested portions of a road network, then to introduce the concept of shortest path count as a measure possible shortest paths in a given network and counting how many times each road was used in every shortest path derived. Finally, this concept was applied to a certain potential for congestion and using graduated colors this study showed how the road network behaves in terms of road congestion.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 2 )
Title notes ( 2 )
Comments ( 0 )
Images

Holdings
Cover image	Item type	Current library	Collection	Call number	Status	Date due	Barcode
	Thesis	University Library General Reference	Room-Use Only	LG993.5 2008 A64 B34 (Browse shelf(Opens below))	Not For Loan		3UPML00012281
	Thesis	University Library Archives and Records	Preservation Copy	LG993.5 2008 A64 B34 (Browse shelf(Opens below))	Not For Loan		3UPML00032507

Browsing University Library shelves, Shelving location: Archives and Records, Collection: Preservation Copy Close shelf browser (Hides shelf browser)

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	LG993.5 2007 F62 D56 A major plant practice at the Philippine Carabao Center at the University of the Philippines Los Baños, Laguna /	LG993.5 2008 A64 A66 A K-nearest neighbor imputation method based on locally weighted scatterplot smoothing (LOESS) for ordinal data	LG993.5 2008 A64 B33 A super-efficiency data envelopment analysis (DEA) sensitivity analysis algorithm for fixed input allocation /	LG993.5 2008 A64 B34 Shortest path count : a new concept for identifying potentially congested portions of a road network /	LG 993.5 2008 A64 B47 Stochastic programming approach on organic fertilizer formulation /	LG993.5 2008 A64 B63 Reduction of alternatives in multi-attribute decision analysis /	LG993.5 2008 A64 G6 A modified shuffled frog leaping algorithm for the bin packing problem /	Next

Thesis (BS Applied Mathematics) -- University of the Philippines Mindanao, 2008

This study introduces the new concept of shortest path count as a measure of congestion in a network. The specific objectives of this study were to present first and apply the concept of shortest path count in identifying potentially congested portions of a road network, then to introduce the concept of shortest path count as a measure possible shortest paths in a given network and counting how many times each road was used in every shortest path derived. Finally, this concept was applied to a certain potential for congestion and using graduated colors this study showed how the road network behaves in terms of road congestion.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer