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": "40916aa3-0059-4eec-92b1-e7bf189d13db"}, "_deposit": {"id": "3525", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "3525"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/3525", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "An Ant Colony Optimization Algorithm for Solving Traveling Salesman Problem", "subitem_1551255648112": "en"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "Ant Colony Optimization (ACO) is a class ofheuristic search algorithms that have beensuccessfully applied to solving combinationaloptimization (CO) problems. The traveling salesmanproblem (TSP) is among the most importantcombinatorial problems. ACO has very good searchcapability for optimization problems. But it still hassome drawbacks such as stagnation behavior, longcomputational time, and premature convergenceproblem of the basic ACO algorithm on TSP. Thoseproblems will be more obvious when the complexitiesof the considered problems increase. The proposedsystem based on basic ACO algorithm based on wellpositionedthe ants on the initiation and informationentropy which is applied to tuning of the algorithm’sparameters. Then, ACO for TSP has been improvedby incorporating local optimization heuristic.Therefore, the proposed system intends to reachsuperior search performance over traditional ACOalgorithms do."}]}, "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-25"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "psc2010paper (64).pdf", "filesize": [{"value": "96 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 96000.0, "url": {"url": "https://meral.edu.mm/record/3525/files/psc2010paper (64).pdf"}, "version_id": "99912722-e83a-4abf-8b55-0664258e5a9f"}]}, "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": "Hlaing, Zar Chi Su Su"}, {"subitem_authors_fullname": "Khine, May Aye"}]}]}, "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/1267"}, "item_title": "An Ant Colony Optimization Algorithm for Solving Traveling Salesman Problem", "item_type_id": "21", "owner": "1", "path": ["1597824273898"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000003525", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-07-25"}, "publish_date": "2019-07-25", "publish_status": "0", "recid": "3525", "relation": {}, "relation_version_is_last": true, "title": ["An Ant Colony Optimization Algorithm for Solving Traveling Salesman Problem"], "weko_shared_id": -1}

An Ant Colony Optimization Algorithm for Solving Traveling Salesman Problem

http://hdl.handle.net/20.500.12678/0000003525
283d0cb6-c2b1-4516-a731-f80ca9733b5d
40916aa3-0059-4eec-92b1-e7bf189d13db
None
Name / File License Actions
psc2010paper psc2010paper (64).pdf (96 Kb)
0
0
views
downloads
Views Downloads

Export

OAI-PMH
  • OAI-PMH DublinCore
Other Formats