{"id":{"repo_id":"lethbridge","oai_identifier":"oai:opus.uleth.ca:10133/5451"},"canonical_url":"https://search.ndltd.org/etd/lethbridge/oai:opus.uleth.ca:10133/5451","repository":{"repo_id":"lethbridge","name":"University of Lethbridge","base_url":"https://opus.uleth.ca/server/oai/request"},"display":{"title":"Minsum sink location and evacuation problem on dynamic cycle networks","abstract":"In this thesis, we study 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the optimal location of the 1 sink, while the k-sink evacuation problem is to find the optimal evacuation protocol for the given locations of the k sinks. Both results minimize the sum of the evacuation times of all the supply located at the vertices to the sink/s of a given cycle network of n vertices. We present an efficient algorithm with a useful data structure that finds the optimal location of the 1 sink in O(n) time when the capacity of the edges are uniform. If the edges have arbitrary capacities, we solve the problem in O(nlogn)$ time by an extension of the data structure. We also propose an O(n) time algorithm to solve the k-sink evacuation problem with uniform edge capacity.","abstract_html":"In this thesis, we study 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the optimal location of the 1 sink, while the k-sink evacuation problem is to find the optimal evacuation protocol for the given locations of the k sinks. Both results minimize the sum of the evacuation times of all the supply located at the vertices to the sink/s of a given cycle network of n vertices. We present an efficient algorithm with a useful data structure that finds the optimal location of the 1 sink in O(n) time when the capacity of the edges are uniform. If the edges have arbitrary capacities, we solve the problem in O(nlogn)$ time by an extension of the data structure. We also propose an O(n) time algorithm to solve the k-sink evacuation problem with uniform edge capacity.","abstract_has_math":false,"creators":["Bashar, Md Khairul","University of Lethbridge. Faculty of Arts and Science"],"institution":"Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science","degree_name":null,"degree_level":"Masters","degree_discipline":null,"degree_department":null,"school":null,"contributors":[],"advisors":["Benkoczi, Robert"],"committee_chairs":[],"committee_members":[],"year":2018,"date_issued":"2018","date_published":"2018","updated_at":"2026-11-19T05:21:30Z","subjects":["dynamic cycle networks","evacuation problem","facility location problems","minsum sink","sink location","Dissertations, Academic"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10133/5451","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/10133/5451","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://opus.uleth.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aopus.uleth.ca%3A10133%2F5451","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Benkoczi, Robert"]},{"key":"dc:creator","label":"Author","values":["Bashar, Md Khairul","University of Lethbridge. Faculty of Arts and Science"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2019-07-09T15:57:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2019-07-09T15:57:17Z"]},{"key":"dc:date.issued","label":"Date","values":["2018"]},{"key":"dc:publisher","label":"Institution","values":["Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science"]},{"key":"dc:publisher.department","label":"Dc Publisher Department","values":["Department of Mathematics & Computer Science"]},{"key":"dc:publisher.faculty","label":"Dc Publisher Faculty","values":["Arts and Science"]},{"key":"dc:relation.ispartofseries","label":"Dc Relation Ispartofseries","values":["Thesis (University of Lethbridge. Faculty of Arts and Science)"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Masters"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["dynamic cycle networks","evacuation problem","facility location problems","minsum sink","sink location","Dissertations, Academic"]},{"key":"dc:subject.proquest","label":"Dc Subject Proquest","values":["984"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]},{"key":"dc:rights.proquest","label":"Dc Rights Proquest","values":["Yes"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10133/5451"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["In this thesis, we study 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the optimal location of the 1 sink, while the k-sink evacuation problem is to find the optimal evacuation protocol for the given locations of the k sinks. Both results minimize the sum of the evacuation times of all the supply located at the vertices to the sink/s of a given cycle network of n vertices. We present an efficient algorithm with a useful data structure that finds the optimal location of the 1 sink in O(n) time when the capacity of the edges are uniform. If the edges have arbitrary capacities, we solve the problem in O(nlogn)$ time by an extension of the data structure. We also propose an O(n) time algorithm to solve the k-sink evacuation problem with uniform edge capacity."]},{"key":"dc:embargo.terms","label":"Dc Embargo Terms","values":["No"]},{"key":"dc:title","label":"Title","values":["Minsum sink location and evacuation problem on dynamic cycle networks"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.supervisor":["Benkoczi, Robert"],"dc:creator":["Bashar, Md Khairul","University of Lethbridge. Faculty of Arts and Science"],"dc:date.accessioned":["2019-07-09T15:57:17Z"],"dc:date.available":["2019-07-09T15:57:17Z"],"dc:date.issued":["2018"],"dc:description.abstract":["In this thesis, we study 1-sink location and k-sink evacuation problem on dynamic cycle networks. We consider the 1-sink location problem is to find the optimal location of the 1 sink, while the k-sink evacuation problem is to find the optimal evacuation protocol for the given locations of the k sinks. Both results minimize the sum of the evacuation times of all the supply located at the vertices to the sink/s of a given cycle network of n vertices. We present an efficient algorithm with a useful data structure that finds the optimal location of the 1 sink in O(n) time when the capacity of the edges are uniform. If the edges have arbitrary capacities, we solve the problem in O(nlogn)$ time by an extension of the data structure. We also propose an O(n) time algorithm to solve the k-sink evacuation problem with uniform edge capacity."],"dc:embargo.terms":["No"],"dc:identifier.uri":["https://hdl.handle.net/10133/5451"],"dc:language.iso":["en_US"],"dc:publisher":["Lethbridge, Alta. : Universtiy of Lethbridge, Department of Mathematics and Computer Science"],"dc:publisher.department":["Department of Mathematics & Computer Science"],"dc:publisher.faculty":["Arts and Science"],"dc:relation.ispartofseries":["Thesis (University of Lethbridge. Faculty of Arts and Science)"],"dc:rights.proquest":["Yes"],"dc:subject":["dynamic cycle networks","evacuation problem","facility location problems","minsum sink","sink location","Dissertations, Academic"],"dc:subject.proquest":["984"],"dc:title":["Minsum sink location and evacuation problem on dynamic cycle networks"],"dc:type":["Thesis"],"others:access_status":["open.access"],"thesis:degree_level":["Masters"]},"updated_at":"2026-11-19T05:21:30Z"}