检索结果-内蒙古大学图书馆

Green vehicle traffic routing system using ant-based algorithm

JOURNAL OF NETWORK AND COMPUTER APPLICATIONS 2015年 58卷 294-308页

作者： Jabbarpour, Mohammad Reza Noor, Rafidah Md Khokhar, Rashid Hafeez Univ Malaya Fac Comp Sci & Informat Technol Kuala Lumpur 50603 Malaysia Charles Sturt Univ Sch Comp & Math Wagga Wagga NSW 2678 Australia

Vehicle traffic congestion leads to air pollution, driver frustration, and costs billions of dollars annually in fuel consumption. Finding a proper solution to vehicle congestion is a considerable challenge due to the dynamic and unpredictable nature of the network topology of vehicular environments, especially in urban areas. Vehicle Traffic Routing Systems (VTRSs) are one of the most significant solutions for this problem. Although most of the existing VTRSs obtained promising results for reducing travel time or improving traffic flow, they cannot guarantee reduction of the traffic-related nuisances such as air pollution, noise, and fuel consumption. Hence, in this paper, we present a green VTRS that reduces fuel consumption and consequently CO2 emissions via ant-based algorithm combined with fuel consumption model. This VTRS is an ant-based Vehicle Congestion Avoidance System (AVCAS) that uses Signalized Intersection Design and Research Aid (SIDRA) fuel consumption and emission model in its vehicle routing procedure. This approach is called AVCAS +SIDRA which utilizes various criterion such as average travel time, speed, distance, vehicle density along with road map segmentation to reduce fuel consumption as much as possible by finding the least congested shortest paths in order to reduce the vehicle traffic congestion and their pollutant emissions. The proposed approach is evaluated and validated through simulation environment and tools (i.e. NS-2, SUMO, TraNS). Experimental results conducted on three different scenarios (i.e. various vehicle densities, system usage rates and accident condition) considering average travel time, travel speed, travel distance and fuel consumption as evaluation metrics. The obtained results show that the AVCAS + SIDRA outperforms the existing approaches in terms of average travel time, average travel speed and fuel consumption rate, by an average of 25.5%, 19.5% and 17%, respectively. Consequently, our proposed green VTRS alleviate

关键词： Green Vehicle Traffic Routing System ant-based algorithm Vehicular Networks Vehicle Congestion Problem Fuel Consumption Air Pollution

来源：评论

学校读者我要写书评

暂无评论

An Improved ant-based algorithm for the Degree-Constrained Minimum Spanning Tree Problem

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2012年第2期16卷 266-278页

作者： Bui, Thang N. Deng, Xianghua Zrncic, Catherine M. Penn State Univ Harrisburg Dept Math & Comp Sci Middletown PA 17057 USA

The degree-constrained minimum spanning tree (DCMST) problem is the problem of finding the minimum cost spanning tree in an edge weighted complete graph such that each vertex in the spanning tree has degree <= d for some d >= 2. The DCMST problem is known to be NP-hard. This paper presents an ant-based algorithm to find low cost degree-constrained spanning trees (DCST). The algorithm employs a set of ants which traverse the graph and identify a set of candidate edges, from which a DCST is constructed. Local optimization algorithms are then used to further improve the DCST. Extensive experiments using 612 problem instances show many improvements over existing algorithms.

关键词： ant-based algorithm degree constrained spanning tree

来源：评论

学校读者我要写书评

暂无评论

AN ant-based algorithm WITH LOCAL OPTIMIZATION FOR COMMUNITY DETECTION IN LARGE-SCALE NETWORKS

引用

ADVANCES IN COMPLEX SYSTEMS 2012年第8期15卷 1250036-1250036页

作者： He, Dongxiao Liu, Jie Yang, Bo Huang, Yuxiao Liu, Dayou Jin, Di Jilin Univ Coll Comp Sci & Technol Changchun 130012 Peoples R China Jilin Univ Key Lab Symbol Computat & Knowledge Engn Minist Educ Changchun 130012 Peoples R China

In this paper, we propose a multi-layer ant-based algorithm (MABA), which detects communities from networks by means of locally optimizing modularity using individual ants. The basic version of MABA, namely SABA, combines a self-avoiding label propagation technique with a simulated annealing strategy for ant diffusion in networks. Once the communities are found by SABA, this method can be reapplied to a higher level network where each obtained community is regarded as a new vertex. The aforementioned process is repeated iteratively, and this corresponds to MABA. Thanks to the intrinsic multi-level nature of our algorithm, it possesses the potential ability to unfold multi-scale hierarchical structures. Furthermore, MABA has the ability that mitigates the resolution limit of modularity. The proposed MABA has been evaluated on both computer-generated benchmarks and widely used real-world networks, and has been compared with a set of competitive algorithms. Experimental results demonstrate that MABA is both effective and efficient (in near linear time with respect to the size of network) for discovering communities.

关键词： Complex networks community detection ant-based algorithm simulated annealing modularity

来源：评论

学校读者我要写书评

暂无评论

QoS-aware service composition for distributed video surveillance

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2014年第1期73卷 169-188页

作者： Hossain, M. Shamim King Saud Univ CCIS Riyadh Saudi Arabia

Quality of Service (QoS) is essential for the ubiquitous access of media services in real-time distributed video surveillance applications. To have ubiquitous access of desired media with emergency officials' handheld devices, appropriate media transcoding services are required. Currently, it is challenging to select and compose these services for each of the devices to satisfy the desired QoS demand. To compose these media services so that video stream is available for target pervasive and smart devices, a composition algorithm is required. Thus, this paper presents a QoS-aware service composition algorithm to select the best composition for the target ubiquitous client so that it can optimally provide QoS to heterogeneous users. We have implemented a video surveillance prototype to demonstrate the performance of the proposed QoS-aware composition algorithm. Results from this prototype reveal that the approach is suitable for real-time video surveillance.

关键词： Service composition Distributed video surveillance QoS Transcoding service ant-based algorithm

来源：评论

学校读者我要写书评

暂无评论

Localized ant Colony of Robots for Redeployment in Wireless Sensor Networks

Localized Ant Colony of Robots for Redeployment in Wireless ...

引用

作者： Wang, Yuan Uottawa

学位级别：master

Sensor failures or oversupply in wireless sensor networks (WSNs), especially initial random deployment, create both spare sensors (whose area is fully covered by other sensors) and sensing holes. We envision a team of robots to relocate sensors and improve their area coverage. Existing algorithms, including centralized ones and the only localized G-R3S2, move only spare sensors and have limited improvement because non-spare sensors, with area coverage mostly overlapped by neighbour sensors, are not moved, and additional sensors are deployed to fill existing holes. We propose a localized algorithm, called Localized ant-based Sensor Relocation algorithm with Greedy Walk (LASR-G), where each robot may carry at most one sensor and makes decision that depends only on locally detected information. In LASR-G, each robot calculates corresponding pickup or dropping probability, and relocates sensor with currently low coverage contribution to another location where sensing hole would be significantly reduced. The basic algorithm optimizes only area coverage, while modified algorithm includes also the cost of robot movement. We compare LASR-G with G-R3S2, and examine both single robot and multi robots scenarios. The simulation results show the advantages of LASR-G over G-R3S2

关键词： Wireless sensor network Sensor relocation ant-based algorithm Robot-assisted algorithm

来源：评论

学校读者我要写书评

暂无评论

Localized ant Colony of Robots for Redeployment in Wireless Sensor Networks

引用

JOURNAL OF MULTIPLE-VALUED LOGIC AND SOFT COMPUTING 2014年第1-2期23卷 35-51页

作者： Wang, Yuan Barnawi, Ahmed de Mello, Rodrigo Fernandes Stojmenovic, Ivan Univ Ottawa EECS Ottawa ON K1N 6N5 Canada King Abdulaziz Univ Jeddah 21413 Saudi Arabia Univ Sao Paulo ICMC Sao Carlos SP Brazil

Sensor failures or oversupply in wireless sensor networks (WSNs), especially initial random deployment, create spare sensors (whose area is fully covered by other sensors) and sensing holes. We envision a team of robots to relocate sensors and improve their area coverage. Existing algorithms, including centralized ones and the only localized G-R3S2 [9], move only spare sensors and have limited improvement because non-spare sensors, with area coverage mostly overlapped by neighbour sensors, are not moved, and additional sensors are deployed to fill existing small holes. We propose a localized algorithm, called Localized ant-based Sensor Relocation algorithm with Greedy Walk (LASR-G), where each robot may carry at most one sensor and makes decision that depends only on locally detected information. In LASR-G, each robot calculates corresponding pickup or dropping probability, and relocates sensor with currently low coverage contribution to another location where sensing hole would be significantly reduced. The basic algorithm optimizes only area coverage, while modified algorithm includes also the cost of robot movement. We compare LASR-G with G-R3S2, and examine both single robot and multi robots scenarios. The simulation results show the advantages of LASR-G over G-R3S2.

关键词： Wireless sensor network sensor relocation ant-based algorithm robot-assisted algorithm

来源：评论

学校读者我要写书评

暂无评论

An ant-based algorithm for coloring graphs

引用

DISCRETE APPLIED MATHEMATICS 2008年第2期156卷 190-200页

作者： Bui, Thang N. Nguyen, ThanhVu H. Patel, Chirag M. Phan, Kim-Anh T. Penn State Harrisburg Comp Sci Program Middletown PA 17057 USA Transfer Technol Inc Harrisburg PA 17105 USA Mekong Tech LLC Philadelphia PA USA

This paper presents an ant-based algorithm for the graph coloring problem. An important difference that distinguishes this algorithm from previous ant algorithms is the manner in which ants are used in the algorithm. Unlike previous ant algorithms where each ant colors the entire graph, each ant in this algorithm colors just a portion of the graph using only local information. These individual coloring actions by the ants form a coloring of the graph. Even with the lack of pheromone laying capacity by the ants, the algorithm performed well on a set of 119 benchmark graphs. Furthermore, the algorithm produced very consistent results, having very small standard deviations over 50 runs of each graph tested. (C) 2007 Elsevier B.V. All rights reserved.

关键词： graph coloring ant-based algorithm

来源：评论

学校读者我要写书评

暂无评论

ant-based Energy-aware Disjoint Multipath Routing algorithm for MANETs

引用

COMPUTER JOURNAL 2010年第2期53卷 166-176页

作者： Wu, Zheng-Yu Song, Han-Tao Beijing Forestry Univ Dept Comp Sci & Technol Coll Informat Sci & Technol Beijing 100083 Peoples R China Beijing Inst Technol Sch Comp Sci & Technol Beijing 100081 Peoples R China

ant-based routing protocols for mobile ad hoc networks (MANETs) have been widely explored, but most of them are essentially single-path routing methods that tend to impose a heavy burden on the hosts along the shortest path from source to destination. In this paper, we combine swarm intelligence and node-disjoint multipath routing to alleviate these problems. A novel approach called ant-based energy-aware disjoint multipath routing algorithm (AEADMRA) is proposed. AEADMRA is based on swarm intelligence and especially on the ant colony-based meta heuristic. AEADMRA can discover multiple energy-aware node-disjoint routing paths with a low routing overhead. Simulation results indicate that the performance of AEADMRA outperforms other pertinent algorithms.

关键词： routing ant-based algorithm MANETs

来源：评论

学校读者我要写书评

暂无评论

An Efficient ant-based Edge Detector

An Efficient Ant-Based Edge Detector

引用

1st International Conference on Computational Collective Intelligence

作者： Aydin, Dogan Ege Univ Dept Comp Engn TR-35100 Izmir Turkey

ISBN: (纸本)9783642150333

An efficient ant-based edge detector is presented. It is based on the distribution of ants on an image, ants try to find possible edges by using a state transition function based on 5x5 edge structures. Visual comparisons show that the proposed method gives finer details and thinner edges at lesser computational times when compared to earlier ant-based approaches. When compared to standard edge detectors, it shows robustness to Gaussian and Salt & Pepper noise and provides finer details than others with same parameter set in both clear and noisy images.

关键词： Edge detection ant-based algorithm noisy images ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

An Improved Entropy-based ant Clustering algorithm

An Improved Entropy-based Ant Clustering Algorithm

引用

WASE International Conference on Information Engineering (ICIE 2009)

作者： Zhao Weili Shenyang Ligong Univ Coll Sci Shenyang Peoples R China

ISBN: (纸本)9780769536798

Sorting and clustering methods inspired by the behavior of real ants are among the earliest methods in ant-based meta-heuristics. We revisit these methods in the context of a concrete application and introduce some modifications that yield significant improvements in terms of both quality and efficiency. In this paper, we propose an Improved Entropy-based ant Clustering (IEAC) algorithm. Firstly, we apply information entropy to model behaviors of agents, such as picking up and dropping objects. The entropy function led to better quality clusters than non-entropy functions. Secondly, we introduce a number of modifications that improve the quality of the clustering solutions generated by the algorithm. We have made some experiments on real data sets and synthetic data sets. The results demonstrate that our algorithm has superiority in misclassification error rate and runtime over the classical algorithm.

关键词： cluster analysis ant-based algorithm information entropy

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：