×
验证码:
换一张
忘记密码?
记住我
CORC
首页
科研机构
检索
知识图谱
申请加入
托管服务
登录
注册
在结果中检索
科研机构
西安理工大学 [3]
兰州理工大学 [2]
华南理工大学 [2]
山东师范大学 [2]
清华大学 [1]
长春光学精密机械与物... [1]
更多...
内容类型
会议论文 [15]
发表日期
2018 [1]
2017 [2]
2016 [1]
2014 [2]
2010 [2]
2007 [1]
更多...
×
知识图谱
CORC
开始提交
已提交作品
待认领作品
已认领作品
未提交全文
收藏管理
QQ客服
官方微博
反馈留言
浏览/检索结果:
共15条,第1-10条
帮助
限定条件
内容类型:会议论文
已选(
0
)
清除
条数/页:
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
排序方式:
请选择
作者升序
作者降序
题名升序
题名降序
发表日期升序
发表日期降序
提交时间升序
提交时间降序
Discrete Brain Storm Optimization Algorithm based on Prior Knowledge for Traveling Salesman Problems
会议论文
PROCEEDINGS OF THE 2018 13TH IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS (ICIEA 2018), 2018-01-01
作者:
Xu, Yingruo
;
Wu, Yali
;
Fu, Yulong
;
Wang, Xinrui
;
Lu, Ating
收藏
  |  
浏览/下载:3/0
  |  
提交时间:2019/12/20
Discrete Brain Storm Algorithm
Traveling Salesman Problems
Clustering Technique
A Near Optimal Approach for Symmetric Traveling Salesman Problem in Euclidean Space
会议论文
Porto, PORTUGAL, FEB 23-25, 2017
作者:
Tian, Wenhong
;
Huang, Chaojie
;
Wang, Xinyang
收藏
  |  
浏览/下载:19/0
  |  
提交时间:2018/03/15
An adaptive weighted ant colony algorithm
会议论文
作者:
Gao, Shi-wei
;
Li, Ya-jie
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2019/11/15
Ant Colony Optimization Algorithm
Ant Colony System
Adaptive Weighted
Time-Efficient Trajectory Optimization in Patrolling Problems with Non-prespecified Depots and Robots
会议论文
2016 24TH MEDITERRANEAN CONFERENCE ON CONTROL AND AUTOMATION (MED), 2016-01-01
作者:
Ghadiry, Walaaeldin
;
Habibi, Jalal
;
Aghdam, Amir G.
;
Zhang, Youmin
收藏
  |  
浏览/下载:4/0
  |  
提交时间:2019/12/20
Minimum-Time Multidepot multiple Traveling Salesman Problem (MTMmTSP)
Patrolling operation
Non-prespecified starting depot
Return trip
An Improvement of Fruit Fly Optimization Algorithm for Solving Traveling Salesman Problems
会议论文
2014 IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND AUTOMATION (ICIA), 2014-01-01
作者:
Li Hengyu[1]
;
Chen Jiqing[2]
;
Huang Quanzhen[3]
;
Xie Shaorong[4]
;
Luo Jun[5]
收藏
  |  
浏览/下载:3/0
  |  
提交时间:2019/04/30
fruit fly optimization algorithm
mutation operator
adaptive variable step size
TSP
A Novel Oppositional Biogeography-Based Optimization for Combinatorial Problems
会议论文
2014 10TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION (ICNC), 2014-01-01
作者:
Xu, Qingzheng
;
Guo, Lemeng
;
Wang, Na
;
Pan, Jin
;
Wang, Lei
收藏
  |  
浏览/下载:1/0
  |  
提交时间:2019/12/20
biogeography-based optimization
opposition-based learning
traveling salesman problems
discrete domain
Dynamic vehicle routing problem with multiple objectives - Solution framework and computational experiments
会议论文
NETWORK MODELING 2005, 84th Annual Meeting of the Transportation-Research-Board, Washington, DC, Web of Science
Tang, H
;
Hu, MW
收藏
  |  
浏览/下载:3/0
A hybrid algorithm for task assignment problem in holonic manufacturing system
会议论文
Macao, China, January 30, 2010 - January 31, 2010
作者:
Fuqing, Zhao
;
Jianhua, Zou
;
Shangxiong, Sheng
收藏
  |  
浏览/下载:2/0
  |  
提交时间:2020/11/15
Industrial research
Information technology
Information theory
Manufacture
Model structures
Multi agent systems
Traveling salesman problem
Basic systems
Communication models
Complex systems
Cooperative activity
Holonic manufacturing system
Holonics
Hybrid algorithms
Hybrid PSO
Leadtime
Manufacturing system
Model-based
Operation cost
Optimization models
Simulation result
Task assignment
An improved discrete particle swarm optimization algorithm for TSP (EI CONFERENCE)
会议论文
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
Zhang C.
;
Sun J.
;
Wang Y.
;
Yang Q.
收藏
  |  
浏览/下载:15/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.
Information entropy and interaction optimization model based on swarm intelligence
会议论文
2nd International Conference on Natural Computation (ICNC 2006), Xian, China, September 24-28, 2006
作者:
He XX(何小贤)
;
Zhu YL(朱云龙)
;
Hu KY(胡琨元)
;
Niu B(牛奔)
收藏
  |  
浏览/下载:12/0
  |  
提交时间:2012/06/06
©版权所有 ©2017 CSpace - Powered by
CSpace