Magnetic Optimization Algorithm Approach For Travelling Salesman Problem
Lately, numerous nature inspired optimization techniques has been applied to combinatorial optimization problems, such as Travelling Salesman Problem. In this paper, we study the implementation of one of the nature inspired optimization techniques called Magnetic Optimization Algorithm in Travelling...
Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | en |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/20148/1/MAGNETIC%20OPTIMIZATION%20ALGORITHM%20APPROACH%20FOR%20TRAVELLING%20SALESMAN%20PROBLEM-ENGR.%20MUZAFAR%20ISMAIL.pdf http://eprints.utem.edu.my/id/eprint/20148/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832717437201547264 |
|---|---|
| author | Ismail, Mohd Muzafar Zakaria, Muhammad Iqbal Zainal Abidin, Amar Faiz Mad Juliani, Juwita Lit, Asrani Mirjalili, Seyedali Nordin, Nur Anis Mohamed Saaid, Muhammad Faiz |
| author_facet | Ismail, Mohd Muzafar Zakaria, Muhammad Iqbal Zainal Abidin, Amar Faiz Mad Juliani, Juwita Lit, Asrani Mirjalili, Seyedali Nordin, Nur Anis Mohamed Saaid, Muhammad Faiz |
| author_sort | Ismail, Mohd Muzafar |
| building | UTEM Library |
| collection | Institutional Repository |
| content_provider | Universiti Teknikal Malaysia Melaka |
| content_source | UTEM Institutional Repository |
| continent | Asia |
| country | Malaysia |
| description | Lately, numerous nature inspired optimization techniques has been applied to combinatorial optimization problems, such as Travelling Salesman Problem. In this paper, we study the implementation of one of the nature inspired optimization techniques called Magnetic Optimization Algorithm in Travelling Salesman Problem. In this implementation, each magnetic agent or particle in Magnetic Optimization Algorithm represents a candidate solution of the Travelling Salesman Problem. The strength of the magnetic force between these particles is inversely proportion to the distance calculated by the Traveling Salesman Problem's solution they represented. Particles with higher magnetic force will attract other particles with relatively lower magnetic force, towards it. The process repeated until satisfying a stopping condition, and the solution with lowest distance is considered as the best-found solution. The performance of the proposed approach is benchmarked with a case study taken from a well-known test bank. |
| format | Conference or Workshop Item |
| id | my.utem.eprints-20148 |
| institution | Universiti Teknikal Malaysia Melaka |
| language | en |
| publishDate | 2012 |
| record_format | eprints |
| spelling | my.utem.eprints-201482017-12-14T08:10:59Z http://eprints.utem.edu.my/id/eprint/20148/ Magnetic Optimization Algorithm Approach For Travelling Salesman Problem Ismail, Mohd Muzafar Zakaria, Muhammad Iqbal Zainal Abidin, Amar Faiz Mad Juliani, Juwita Lit, Asrani Mirjalili, Seyedali Nordin, Nur Anis Mohamed Saaid, Muhammad Faiz T Technology (General) TK Electrical engineering. Electronics Nuclear engineering Lately, numerous nature inspired optimization techniques has been applied to combinatorial optimization problems, such as Travelling Salesman Problem. In this paper, we study the implementation of one of the nature inspired optimization techniques called Magnetic Optimization Algorithm in Travelling Salesman Problem. In this implementation, each magnetic agent or particle in Magnetic Optimization Algorithm represents a candidate solution of the Travelling Salesman Problem. The strength of the magnetic force between these particles is inversely proportion to the distance calculated by the Traveling Salesman Problem's solution they represented. Particles with higher magnetic force will attract other particles with relatively lower magnetic force, towards it. The process repeated until satisfying a stopping condition, and the solution with lowest distance is considered as the best-found solution. The performance of the proposed approach is benchmarked with a case study taken from a well-known test bank. 2012 Conference or Workshop Item PeerReviewed text en http://eprints.utem.edu.my/id/eprint/20148/1/MAGNETIC%20OPTIMIZATION%20ALGORITHM%20APPROACH%20FOR%20TRAVELLING%20SALESMAN%20PROBLEM-ENGR.%20MUZAFAR%20ISMAIL.pdf Ismail, Mohd Muzafar and Zakaria, Muhammad Iqbal and Zainal Abidin, Amar Faiz and Mad Juliani, Juwita and Lit, Asrani and Mirjalili, Seyedali and Nordin, Nur Anis and Mohamed Saaid, Muhammad Faiz (2012) Magnetic Optimization Algorithm Approach For Travelling Salesman Problem. In: International Conference on Computer, Electrical, and Systems Sciences, and Engineering (ICCESSE 2012) , 19-21 Februari 2012, Pacific Regency Hotel Suites, Kuala Lumpur . (Submitted) |
| spellingShingle | T Technology (General) TK Electrical engineering. Electronics Nuclear engineering Ismail, Mohd Muzafar Zakaria, Muhammad Iqbal Zainal Abidin, Amar Faiz Mad Juliani, Juwita Lit, Asrani Mirjalili, Seyedali Nordin, Nur Anis Mohamed Saaid, Muhammad Faiz Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title | Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title_full | Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title_fullStr | Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title_full_unstemmed | Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title_short | Magnetic Optimization Algorithm Approach For Travelling Salesman Problem |
| title_sort | magnetic optimization algorithm approach for travelling salesman problem |
| topic | T Technology (General) TK Electrical engineering. Electronics Nuclear engineering |
| url | http://eprints.utem.edu.my/id/eprint/20148/1/MAGNETIC%20OPTIMIZATION%20ALGORITHM%20APPROACH%20FOR%20TRAVELLING%20SALESMAN%20PROBLEM-ENGR.%20MUZAFAR%20ISMAIL.pdf http://eprints.utem.edu.my/id/eprint/20148/ |
| url_provider | http://eprints.utem.edu.my/ |