Index Link

  • RootNode
    • Co-operative College, Mandalay
    • Cooperative College, Phaunggyi
    • Co-operative University, Sagaing
    • Co-operative University, Thanlyin
    • Dagon University
    • Kyaukse University
    • Laquarware Technological college
    • Mandalay Technological University
    • Mandalay University of Distance Education
    • Mandalay University of Foreign Languages
    • Maubin University
    • Mawlamyine University
    • Meiktila University
    • Mohnyin University
    • Myanmar Institute of Information Technology
    • Myanmar Maritime University
    • National Management Degree College
    • Naypyitaw State Academy
    • Pathein University
    • Sagaing University
    • Sagaing University of Education
    • Taunggyi University
    • Technological University, Hmawbi
    • Technological University (Kyaukse)
    • Technological University Mandalay
    • University of Computer Studies, Mandalay
    • University of Computer Studies Maubin
    • University of Computer Studies, Meikhtila
    • University of Computer Studies Pathein
    • University of Computer Studies, Taungoo
    • University of Computer Studies, Yangon
    • University of Dental Medicine Mandalay
    • University of Dental Medicine, Yangon
    • University of Information Technology
    • University of Mandalay
    • University of Medicine 1
    • University of Medicine 2
    • University of Medicine Mandalay
    • University of Myitkyina
    • University of Public Health, Yangon
    • University of Veterinary Science
    • University of Yangon
    • West Yangon University
    • Yadanabon University
    • Yangon Technological University
    • Yangon University of Distance Education
    • Yangon University of Economics
    • Yangon University of Education
    • Yangon University of Foreign Languages
    • Yezin Agricultural University
    • New Index

Item

{"_buckets": {"deposit": "e5794372-e1ed-4df9-afca-a676086a8146"}, "_deposit": {"id": "3500", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3500"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3500", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Comparing Shortest Path Algorithms for Real Road Network", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "This system deals with the problem of finding shortest paths in traversing some location within Myanmar. In particular, it explores the use of three approaches, Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm in constructing the minimum spanning tree considering the carriage ways in the road network of Myanmar. The result shows a remarkable reduction in the actual distances as compared with the ordinary routing. Comparing Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm which can produce the minimum calculating time to reach the goal. This result indicates, clearly the importance of these types of algorithm in optimization of network flows. This thesis is implemented by using Microsoft Visual Studio 2008 and Microsoft SQL Server 2005."}]}, "item_1583103108160": {"attribute_name": "Keywords", "attribute_value_mlt": [{"interim": "Dijkstra’s algorithm"}, {"interim": "Bellman-Ford, A*"}]}, "item_1583103120197": {"attribute_name": "Files", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_access", "date": [{"dateType": "Available", "dateValue": "2019-07-24"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (41).pdf", "filesize": [{"value": "331 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 331000.0, "url": {"url": "https://meral.edu.mm/record/3500/files/psc2010paper (41).pdf"}, "version_id": "8d7bd462-2cf3-400b-838f-94f0546ecbf0"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "Fifth  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": "Hmon, Moh Moh Wut"}, {"subitem_authors_fullname": "Htway, Thin Thin"}]}]}, "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": "2010-12-16"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/1244"}, "item_title": "Comparing Shortest Path Algorithms for Real Road Network", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003500", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-24"}, "publish_date": "2019-07-24", "publish_status": "0", "recid": "3500", "relation": {}, "relation_version_is_last": true, "title": ["Comparing Shortest Path Algorithms for Real Road Network"], "weko_shared_id": -1}

Comparing Shortest Path Algorithms for Real Road Network

http://hdl.handle.net/20.500.12678/0000003500
82efc1bb-3a55-4baa-9695-c87cd886afaa
e5794372-e1ed-4df9-afca-a676086a8146
None
Name / File License Actions
psc2010paper psc2010paper (41).pdf (331 Kb)
Publication type
Article
Upload type
Publication
Title
Title Comparing Shortest Path Algorithms for Real Road Network
Language en
Publication date 2010-12-16
Authors
Hmon, Moh Moh Wut
Htway, Thin Thin
Description
This system deals with the problem of finding shortest paths in traversing some location within Myanmar. In particular, it explores the use of three approaches, Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm in constructing the minimum spanning tree considering the carriage ways in the road network of Myanmar. The result shows a remarkable reduction in the actual distances as compared with the ordinary routing. Comparing Dijkstra’s shortest path algorithm, Bellman-Ford shortest path algorithm and A* algorithm which can produce the minimum calculating time to reach the goal. This result indicates, clearly the importance of these types of algorithm in optimization of network flows. This thesis is implemented by using Microsoft Visual Studio 2008 and Microsoft SQL Server 2005.
Keywords
Dijkstra’s algorithm, Bellman-Ford, A*
Identifier http://onlineresource.ucsy.edu.mm/handle/123456789/1244
Journal articles
Fifth Local Conference on Parallel and Soft Computing
Conference papers
Books/reports/chapters
Thesis/dissertations
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats