Log in
Language:

MERAL Myanmar Education Research and Learning Portal

  • Top
  • Universities
  • Ranking
To
lat lon distance
To

Field does not validate



Index Link

Index Tree

Please input email address.

WEKO

One fine body…

WEKO

One fine body…

Item

{"_buckets": {"deposit": "d7cd2cf6-69ab-4a37-9cd8-840f1a3b5761"}, "_deposit": {"id": "4893", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4893"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4893", "sets": ["1597824273898", "user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Improving delivery service applying shortest path algorithm for large Road Network", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Graphs and networks are collections of nodesand arcs.Numeric values on the links can representthe actual length of the link. This system presents thedelivery service problem by means of shortest pathalgorithm. Suppliers have to find the path plan to theplace where their products are being delivered,especially. in reference to the geographic position ofthe objects, its surroundings and the shortest path ofthe destination place from their current place. Forlarge road network, the method is based onpreprocessing and prepared for static graphs, i.e,graphs with fixed topology and edge costs.This system solves the suppliers’ Facingproblem in finding the shortest path by using A*Shortest Algorithm. A* is the most popular algorithmbeing used in finding the shortest path because of itsflexibility and potentially search in a huge area ofthe map."}]}, "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-07-12"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (105).pdf", "filesize": [{"value": "69 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 69000.0, "url": {"url": "https://meral.edu.mm/record/4893/files/psc2010paper (105).pdf"}, "version_id": "9dd6a3dd-908d-4fd1-a361-361702e69b83"}]}, "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": "Soe, Aye Lai Lai"}, {"subitem_authors_fullname": "Khaing, Myo Kay"}]}]}, "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/793"}, "item_title": "Improving delivery service applying shortest path algorithm for large Road Network", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004893", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-12"}, "publish_date": "2019-07-12", "publish_status": "0", "recid": "4893", "relation": {}, "relation_version_is_last": true, "title": ["Improving delivery service applying shortest path algorithm for large Road Network"], "weko_shared_id": -1}
  1. University of Computer Studies, Yangon
  2. Conferences

Improving delivery service applying shortest path algorithm for large Road Network

http://hdl.handle.net/20.500.12678/0000004893
http://hdl.handle.net/20.500.12678/0000004893
5e8085a4-ce68-4c16-8869-f906f90b78d1
d7cd2cf6-69ab-4a37-9cd8-840f1a3b5761
None
Preview
Name / File License Actions
psc2010paper psc2010paper (105).pdf (69 Kb)
Back
0
0
views
downloads
See details
Views Downloads

Versions

Ver.1 2020-09-01 15:28:03.191975
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats
  • JSON

Confirm


Back to MERAL


Back to MERAL