咨询与建议

限定检索结果

文献类型

  • 16 篇 期刊文献
  • 13 篇 会议

馆藏范围

  • 29 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 25 篇 工学
    • 14 篇 计算机科学与技术...
    • 8 篇 机械工程
    • 5 篇 电气工程
    • 4 篇 材料科学与工程(可...
    • 3 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 2 篇 力学(可授工学、理...
    • 1 篇 仪器科学与技术
    • 1 篇 电子科学与技术(可...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 化学工程与技术
    • 1 篇 交通运输工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 软件工程
  • 9 篇 管理学
    • 9 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 8 篇 理学
    • 5 篇 数学
    • 1 篇 物理学
    • 1 篇 化学
    • 1 篇 地球物理学
  • 1 篇 经济学
    • 1 篇 应用经济学

主题

  • 29 篇 ant-colony algor...
  • 8 篇 scheduling
  • 5 篇 flowshop
  • 4 篇 total flowtime
  • 2 篇 routing protocol
  • 2 篇 clustering
  • 2 篇 load balancing
  • 2 篇 pheromone
  • 2 篇 routing algorith...
  • 2 篇 completion-time ...
  • 2 篇 integer programm...
  • 2 篇 wireless sensor ...
  • 2 篇 wsn
  • 2 篇 leo satellite ne...
  • 2 篇 gradient
  • 1 篇 direction consis...
  • 1 篇 complex networks
  • 1 篇 transit network
  • 1 篇 dynamic optimiza...
  • 1 篇 iterative ant-co...

机构

  • 4 篇 indian inst tech...
  • 2 篇 univ passau fac ...
  • 1 篇 northeastern uni...
  • 1 篇 beijing inst tec...
  • 1 篇 heilongjiang ins...
  • 1 篇 the department o...
  • 1 篇 institute of chi...
  • 1 篇 xian univ techno...
  • 1 篇 purdue univ purd...
  • 1 篇 gazi univ fac en...
  • 1 篇 tianjin univ tec...
  • 1 篇 zhejiang univ de...
  • 1 篇 school of electr...
  • 1 篇 dalian maritime ...
  • 1 篇 univ passau fac ...
  • 1 篇 southeast univ c...
  • 1 篇 china acad space...
  • 1 篇 heilongjiang ins...
  • 1 篇 weifang univ com...
  • 1 篇 southeast univ s...

作者

  • 5 篇 rajendran c
  • 3 篇 ziegler h
  • 1 篇 pugazhendhi s.
  • 1 篇 seckiner serap u...
  • 1 篇 zhao junsheng
  • 1 篇 fu xin
  • 1 篇 zhu jie
  • 1 篇 tao ying
  • 1 篇 ma jianfeng
  • 1 篇 liu naijin
  • 1 篇 meijuan jia
  • 1 篇 zhang b
  • 1 篇 zhao yong
  • 1 篇 陶滢
  • 1 篇 xu qijian
  • 1 篇 yang yang
  • 1 篇 wu jiang
  • 1 篇 zhang quanwei
  • 1 篇 tao sun
  • 1 篇 byrski aleksande...

语言

  • 24 篇 英文
  • 3 篇 其他
  • 2 篇 中文
检索条件"主题词=Ant-Colony Algorithm"
29 条 记 录,以下是21-30 订阅
排序:
The Research of WSN Routing Technology Based on the Gradient and the Residual Energy ant algorithm
The Research of WSN Routing Technology Based on the Gradient...
收藏 引用
International Conference on Computer and Automation Engineering
作者: Dianwu Gao Hao Wang The Department of Computer and Information Engineering The Department of Electrical and Information Engineering
On the basis of analyzing, comparing the routing protocol and learning from the advanced thinking, the author proposes the algorithm of wireless sensor network routing based on gradient and the residual energy ant alg... 详细信息
来源: 评论
An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2006年 第2期101卷 259-272页
作者: Gajpal, Y Rajendran, C Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India
The problem of scheduling in permutation flowshops with the objective of minimizing the completion-time variance of jobs is considered and solved by making use of ant-colony optimization (ACO) algorithms. ACO is an al... 详细信息
来源: 评论
Clustering Approach for Wireless Sensor Networks Using Spatial Data Correlation and ant-colony Optimization
Clustering Approach for Wireless Sensor Networks Using Spati...
收藏 引用
International Conference on Networks Security, Wireless Communications and Trusted Computing
作者: Zhang, Chongqing Xu, Qiang Shandong Univ Sci & Technol Dept Network Engn Qingdao Peoples R China
This paper studies how to exploit spatial data correlations to group sensor nodes into clusters of high data aggregation efficiency. The approach proposed in this paper first selects a set of cluster heads that form a... 详细信息
来源: 评论
Iterative ant-colony algorithm and its application to dynamic optimization of chemical process
收藏 引用
COMPUTERS & CHEMICAL ENGINEERING 2005年 第10期29卷 2078-2086页
作者: Zhang, B Chen, DZ Zhao, WX Zhejiang Univ Dept Chem Engn Hangzhou 310027 Peoples R China E China Univ Sci & Technol Automat Inst Shanghai 200237 Peoples R China Clarkson Univ CARES Potsdam NY 13699 USA
For solving dynamic optimization problems of chemical process with numerical methods, a novel algorithm named iterative ant-colony algorithm (IACA), the main idea of which was to iteratively execute ant-colony algorit... 详细信息
来源: 评论
A fast ant-colony algorithm for single-machine scheduling to minimize the sum of weighted tardiness of jobs
收藏 引用
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2005年 第8期56卷 947-953页
作者: Holthaus, O Rajendran, C Univ Passau Fac Business Adm & Econ Dept Prod Operat & Logist Management D-94032 Passau Germany Indian Inst Technol Madras 600036 Tamil Nadu India
The problem of scheduling on a single machine is considered in this paper with the objective of minimizing the sum of weighted tardiness of jobs. A new ant-colony optimization (ACO) algorithm, called fast ACO (FACO), ... 详细信息
来源: 评论
ant colony optimization for the job rotation scheduling problem
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2008年 第1-2期201卷 149-160页
作者: Seckiner, Serap Ulusam Kurt, Mustafa Gaziantep Univ Fac Engn Dept Ind Engn TR-27310 Gaziantep Turkey Gazi Univ Fac Engn & Architecture Dept Ind Engn TR-06570 Ankara Turkey
This paper seeks to explore the effectiveness of ant colony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the wo... 详细信息
来源: 评论
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2005年 第4期48卷 789-797页
作者: Rajendran, C Ziegler, H Univ Passau Fac Business Adm & Econ Chair Prod Operat & Logist Management D-94032 Passau Germany Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India
The problem of scheduling in flowshops with the objective of minimizing total flowtime is studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The first algorithm refers to some extent... 详细信息
来源: 评论
Two ant-colony algorithms for minimizing total flowtime in permutation flowshops
Two ant-colony algorithms for minimizing total flowtime in p...
收藏 引用
30th International Conference on Computers and Industrial Engineering
作者: Rajendran, C Ziegler, H Univ Passau Fac Business Adm & Econ Chair Prod Operat & Logist Management D-94032 Passau Germany Indian Inst Technol Dept Management Studies Madras 600036 Tamil Nadu India
The problem of scheduling in flowshops with the objective of minimizing total flowtime is studied. For solving the problem two ant-colony algorithms are proposed and analyzed. The first algorithm refers to some extent... 详细信息
来源: 评论
ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2004年 第2期155卷 426-438页
作者: Rajendran, C Ziegler, H Indian Inst Technol Dept Humanities & Social Sci Ind Engn & Mangement Div Madras 600036 Tamil Nadu India Univ Passau Fac Business Adm & Econ Dept Operat Prod & Logist Management D-94032 Passau Germany
The problem of scheduling in permutation flowshops is considered with the objective of minimizing the makespan, followed by the consideration of minimization of total flowtime of jobs. Two ant-colony optimization algo... 详细信息
来源: 评论