WEB-ENABLED SOFTWARE PLATFORM FOR IDENTIFICATION OF MINIMUM-COST POWER TRANSMISSION LINES WITH REDUNDANCY CONSTRAINTS

Simple item page
dc.contributor.advisorZinchenko, Yuriy
dc.contributor.authorJha, Amit
dc.contributor.committeememberGreenberg, Matthew
dc.contributor.committeememberWare, Antony
dc.date2022-11
dc.date.accessioned2022-09-28T21:10:59Z
dc.date.available2022-09-28T21:10:59Z
dc.date.issued2022-09
dc.description.abstractPath redundancy is essential for safety and reliability in many real-world routing problems, such as the design of networks for power transmission or oil transportation. These problems typically involve finding the shortest path on a weighted graph. Instead, in the shortest path with constrained path redundancy, two disjoint shortest paths are desired, such that the combined weight of the two paths is minimized and a minimum physical path separation is maintained. Finding two disjoint shortest paths subject to constraints on a graph is generally an NP-hard problem. Conventionally, the task of planning for a redundant transmission line requires a large-scale graph and a mixed integer programming (MIP) formulation of the problem. However, due to the the large model dimension MIP is practically intractable. To overcome the intractability, a new 3D embedding scheme has been proposed by [18], which allows avoiding many common pitfalls of available heuristic approaches, while maintaining a modest computation time requirement. To enable this scheme, we developed a software package containing (1) an optimized implementation of a 3D embedding scheme and algorithms which uses it for the identification of disjoint shortest paths with separation constraint on a graph, and (2) a graphical user interface that allows user inputs as well as visualization of the solution on Google Maps. We deployed this software on cloud.en_US
dc.identifier.citationJha, A. (2022). Web-enabled software platform for identification of minimum-cost power transmission lines with redundancy constraints (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca.en_US
dc.identifier.urihttp://hdl.handle.net/1880/115320
dc.identifier.urihttps://dx.doi.org/10.11575/PRISM/40326
dc.language.isoengen_US
dc.publisher.facultyScienceen_US
dc.publisher.institutionUniversity of Calgaryen
dc.rightsUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.en_US
dc.subjectDisjoint two shortest pathsen_US
dc.subjectBezier surface Interpolationen_US
dc.subjectPower transmission line routingen_US
dc.subjectWeb-applicationen_US
dc.subject.classificationEducation--Mathematicsen_US
dc.titleWEB-ENABLED SOFTWARE PLATFORM FOR IDENTIFICATION OF MINIMUM-COST POWER TRANSMISSION LINES WITH REDUNDANCY CONSTRAINTSen_US
dc.typemaster thesisen_US
thesis.degree.disciplineMathematics & Statisticsen_US
thesis.degree.grantorUniversity of Calgaryen_US
thesis.degree.nameMaster of Science (MSc)en_US
ucalgary.item.requestcopytrueen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ucalgary_2022_jha_amit.pdf
Size:
2.56 MB
Format:
Adobe Portable Document Format
Description:
Master's thesis
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.62 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Open Theses and Dissertations