机构

• 自动化研究所 [4]
• 软件研究所 [4]
• 计算技术研究所 [2]
• 沈阳自动化研究所 [2]
• 理论物理研究所 [1]
• 长春光学精密机械与物... [1]
• 更多

采集方式

• OAI收割 [15]

内容类型

• 期刊论文 [11]
• 会议论文 [4]

发表日期

• 2023 [1]
• 2021 [1]
• 2017 [1]
• 2010 [1]
• 2009 [1]
• 2008 [4]
• 更多

学科主题

• Physics [1]

筛选

浏览/检索结果: 共15条，第1-10条 帮助 条数/页： 5101520253035404550556065707580859095100 排序方式： 请选择题名升序题名降序提交时间升序提交时间降序作者升序作者降序发表日期升序发表日期降序 NeuralGLS: learning to guide local search with graph convolutional network for the traveling salesman problem 期刊论文  OAI收割 NEURAL COMPUTING & APPLICATIONS, 2023, 页码: 20 作者:  Sui, Jingyan;  Ding, Shizhe;  Xia, Boyang;  Liu, Ruizhi;  Bu, Dongbo   |  收藏  |  浏览/下载：16/0  |  提交时间：2023/12/04 Graph convolutional network  Guided local search  Traveling salesman problem   A path planning method of lattice structural components for additive manufacturing 期刊论文  OAI收割 International Journal of Advanced Manufacturing Technology, 2021, 卷号: 116, 期号: 5-6, 页码: 1467-1490 作者:  Zhou B(周波);  Tian TT(田同同)   |  收藏  |  浏览/下载：15/0  |  提交时间：2021/05/15 Lattice structure  Additive manufacturing  Machine learning  Support vectormachine  Traveling salesman problem   Solving Traveling Salesman Problem with Hybrid Estimation of Distribution Algorithm 会议论文  OAI收割 Hawaii, USA, July 31 - August 4, 2017 作者:  Liu C(刘昶);  Song LB(宋立波);  Zhu J(朱军);  Shi HB(史海波)   |  收藏  |  浏览/下载：29/0  |  提交时间：2018/10/08 Traveling Salesman Problem  Eda, Hybrid Distribution Estimation  Extreme Optimization  Probability Model  Tsplib   extended tabu search on fuzzy traveling salesman problem in multi-criteria analysis 会议论文  OAI收割 6th International Conference on Algorithmic Aspects in Information and Management, Weihai, PEOPLES R CHINA, JUL 19-21, Zheng Yujun   |  收藏  |  浏览/下载：10/0  |  提交时间：2011/03/31 Tabu search  traveling salesman problem  fuzzy optimization  multi-criteria decision making   The box-TDI system associated with 2-edge connected spanning subgraphs 期刊论文  OAI收割 DISCRETE APPLIED MATHEMATICS, 2009, 卷号: 157, 期号: 1, 页码: 118-125 作者:  Chen, Xujin;  Ding, Guoli;  Zang, Wenan   |  收藏  |  浏览/下载：12/0  |  提交时间：2018/07/30 Polyhedron  Box total dual integrality  Graph  Cut  Traveling salesman problem   Neurodynamic programming: a case study of the traveling salesman problem 期刊论文  OAI收割 NEURAL COMPUTING & APPLICATIONS, 2008, 卷号: 17, 期号: 4, 页码: 347-355 作者:  Ma, Jia;  Yang, Tao;  Hou, Zeng-Guang;  Tan, Min;  Liu, Derong 收藏  |  浏览/下载：20/0  |  提交时间：2015/11/08 neurodynamic programming  temporal difference learning  approximate Sarsa  traveling salesman problem   Neurodynamic programming: a case study of the traveling salesman problem 期刊论文  OAI收割 NEURAL COMPUTING & APPLICATIONS, 2008, 卷号: 17, 期号: 4, 页码: 347-355 作者:  Ma, Jia;  Yang, Tao;  Hou, Zeng-Guang;  Tan, Min;  Liu, Derong 收藏  |  浏览/下载：27/0  |  提交时间：2015/11/08 neurodynamic programming  temporal difference learning  approximate Sarsa  traveling salesman problem   Solving traveling salesman problems using generalized chromosome genetic algorithm 期刊论文  OAI收割 PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 卷号: 18, 期号: 7, 页码: 887-892 作者:  Yang, Jinhui;  Wu, Chunguo;  Lee, Heow Pueh;  Liang, Yanchun 收藏  |  浏览/下载：15/0  |  提交时间：2015/11/08 chromosome  genetic algorithm  solution space  generalized traveling salesman problem   Solving traveling salesman problems using generalized chromosome genetic algorithm 期刊论文  OAI收割 PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2008, 卷号: 18, 期号: 7, 页码: 887-892 作者:  Yang, Jinhui;  Wu, Chunguo;  Lee, Heow Pueh;  Liang, Yanchun 收藏  |  浏览/下载：34/0  |  提交时间：2015/11/08 chromosome  genetic algorithm  solution space  generalized traveling salesman problem   An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE) 会议论文  OAI收割 2007 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Workshops, WI-IAT Workshops 2007, November 2, 2007 - November 5, 2007, Silicon Valley, CA, United states 作者:  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y.;  Wang Y. 收藏  |  浏览/下载：25/0  |  提交时间：2013/03/25 An Improved discrete particle swarm optimization (DPSO)-based algorithm for the traveling salesman problem (TSP) is proposed. In order to overcome the problem of premature convergence  a novel depressor is proposed and a diversity measure to control the swarm is also introduced which can be used to switch between the attractor and depressor. The proposed algorithm has been applied to a set of benchmark problems and compared with the existing algorithms for solving TSP using swarm intelligence. The results show that it can prevent premature convergence to a high degree  but still keeps a rapid convergence like the basic DPSO. 2007 IEEE.