Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
1998
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14378/1/14378_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14378/2/14378_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513384106426368 |
|---|---|
| author | Al-Mulhem, M. |
| author2 | Al-Maghrabi, T. unknown |
| author2_role | author author |
| author_facet | Al-Mulhem, M. Al-Maghrabi, T. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Al-Mulhem, M. Al-Maghrabi, T. unknown |
| dc.date.none.fl_str_mv | 1998-08 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14378/1/14378_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14378/2/14378_2.doc (1998) Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem. Systems, Man, and Cybernetics, Part B, IEEE Transactions on, 28. |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14378/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. These two algorithms are combined into the efficient convex-elastic net (ECEN) algorithm. The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. The paper presents simulation results for two instances of E-TSP: randomly generated tours and tours for well-known problems in the literature. Experimental results are given to show that the proposed algorithm ran find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensions |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_70b5e1fd30c8d4ace0fa6024d1193c54 |
| identifier_str_mv | (1998) Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem. Systems, Man, and Cybernetics, Part B, IEEE Transactions on, 28. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14378 |
| publishDate | 1998 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problemAl-Mulhem, M.Al-Maghrabi, T.unknownComputerThis paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). It begins with a brief introduction to the TSP and the E-TSP. Then, it presents the proposed algorithm with its two major components: the convex-elastic net (CEN) algorithm and the nondeterministic iterative improvement (NII) algorithm. These two algorithms are combined into the efficient convex-elastic net (ECEN) algorithm. The CEN algorithm integrates the convex-hull property and elastic net algorithm to generate an initial tour for the E-TSP. The NII algorithm uses two rearrangement operators to improve the initial tour given by the CEN algorithm. The paper presents simulation results for two instances of E-TSP: randomly generated tours and tours for well-known problems in the literature. Experimental results are given to show that the proposed algorithm ran find the nearly optimal solution for the E-TSP that outperform many similar algorithms reported in the literature. The paper concludes with the advantages of the new algorithm and possible extensionsIEEE1998-082020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14378/1/14378_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14378/2/14378_2.doc (1998) Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem. Systems, Man, and Cybernetics, Part B, IEEE Transactions on, 28. enenhttps://eprints.kfupm.edu.sa/id/eprint/14378/info:eu-repo/semantics/openAccessoai::143782019-11-01T14:05:33Z |
| spellingShingle | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem Al-Mulhem, M. Computer |
| status_str | publishedVersion |
| title | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| title_full | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| title_fullStr | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| title_full_unstemmed | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| title_short | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| title_sort | Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14378/1/14378_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14378/2/14378_2.doc |