{"created":"2020-09-01T13:44:54.837269+00:00","id":3888,"links":{},"metadata":{"_buckets":{"deposit":"4c2bca23-1adf-48d4-bbc6-7cda5f7aba59"},"_deposit":{"id":"3888","owners":[],"pid":{"revision_id":0,"type":"recid","value":"3888"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/3888","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Web Based Bus Directory Service and Route Planning Using Dijkstra’s Shortest Path Algorithm","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Yangon city is a highly populated city and bustransportation is an essential portion of most of the city people.Bus transport system in Yangon is facing multiple problems toimprove efficiency. One of the problems is finding the path to getthe destination that the commuter has never been there before.There are a lot of bus line information books but cannot providefor the above problem. Another problem is low occupancy rate,that a commuter normally does not know the bus routes. Aframework for Bus Directory Service and Route Planning usingDijkstra’s shortest path algorithm is implemented in this paper.For the route planning service, Dijkstra’s shortest algorithmwill be used to get the best path to the destination. This thesiswill provide user selects source and destination to calculate bestpath by using Dijkstra’s shortest algorithm and display theshortest paths for user select Bus Directory. Information of busline and bus-stops can be retrieved in this bus directory serviceand route planning. In this paper, Yangon Bus Directory is alsoprovided. Bus information is collected from Bus lines andYangon Bus Directory, 2007-08, First Edition."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-08-02"}],"displaytype":"preview","filename":"Web Based Bus Directory Service and Route Planning Using Dijkstra.pdf","filesize":[{"value":"10 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/3888/files/Web Based Bus Directory Service and Route Planning Using Dijkstra.pdf"},"version_id":"dbe0a1ca-5781-4519-aab8-38337e0996f6"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Third Local Conference on Parallel and Soft Computing","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Oo, Kyaw Zayar"},{"subitem_authors_fullname":"Nge, Mi Mi"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2009-08-03"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/1610"},"item_title":"Web Based Bus Directory Service and Route Planning Using Dijkstra’s Shortest Path Algorithm","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-08-02","publish_status":"0","recid":"3888","relation_version_is_last":true,"title":["Web Based Bus Directory Service and Route Planning Using Dijkstra’s Shortest Path Algorithm"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T01:12:31.169768+00:00"}