Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem-Reference-Cited by-同舟云学术

Efficient convex-elastic net algorithm to solve the Euclidean traveling salesman problem

Published:1998 Issue:4 Volume:28 Page:618-620
ISSN:1083-4419
Container-title:IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
language:
Short-container-title:IEEE Trans. Syst., Man, Cybern. B

Author:

Al-Mulhem M.,Al-Maghrabi T.

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Electrical and Electronic Engineering,Computer Science Applications,Human-Computer Interaction,General Medicine,Information Systems,Software,Control and Systems Engineering

Link

http://xplorestaging.ieee.org/ielx4/3477/15217/00704301.pdf?arnumber=704301

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hybrid Arithmetic-Rider Optimization algorithm as new intelligent model for travelling salesman problem;International Journal of Information Technology;2024-02-15

2. A Computation Investigation of the Impact of Convex Hull subtour on the Nearest Neighbour Heuristic;2023 International Conference on Science, Engineering and Business for Sustainable Development Goals (SEB-SDG);2023-04-05

3. Hybrid Arithmetic-Rider Optimization Algorithm as New Intelligent Model for Travelling Salesman Problem;2022-09-30

4. Topologically Ordered Self Organizing Map for Optimal Allocation of Urban Emergency Mobile Power Supply;Proceedings of 2021 5th Chinese Conference on Swarm Intelligence and Cooperative Control;2022-07-29

5. A Self-adaptive Multi-task Differential Evolution Algorithm;2021 5th Asian Conference on Artificial Intelligence Technology (ACAIT);2021-10-29