Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 21 )

2018 ( 422 )

2017 ( 421 )

2016 ( 509 )

Custom range...

Search Results: 1 - 10 of 12848 matches for " ant algorithm "
All listed articles are free for downloading (OA Articles)
Page 1 /12848
Display every page Item
Two-Dimension Path Planning Method Based on Improved Ant Colony Algorithm  [PDF]
Rong Wang, Hong Jiang
Advances in Pure Mathematics (APM) , 2015, DOI: 10.4236/apm.2015.59053
Abstract: Nowadays, path planning has become an important field of research focus. Considering that the ant colony algorithm has numerous advantages such as the distributed computing and the characteristics of heuristic search, how to combine the algorithm with two-dimension path planning effectively is much important. In this paper, an improved ant colony algorithm is used in resolving this path planning problem, which can improve convergence rate by using this improved algorithm. MAKLINK graph is adopted to establish the two-dimensional space model at first, after that the Dijkstra algorithm is selected as the initial planning algorithm to get an initial path, immediately following, optimizing the select parameters relating on the ant colony algorithm and its improved algorithm. After making the initial parameter, the authors plan out an optimal path from start to finish in a known environment through ant colony algorithm and its improved algorithm. Finally, Matlab is applied as software tool for coding and simulation validation. Numerical experiments show that the improved algorithm can play a more appropriate path planning than the origin algorithm in the completely observable.
Cost Control of the Transmission Congestion Management in Electricity Systems Based on Ant Colony Algorithm  [PDF]
Bin Liu, Jixin Kang, Nan Jiang, Yuanwei Jing
Energy and Power Engineering (EPE) , 2011, DOI: 10.4236/epe.2011.31003
Abstract: This paper investigates the cost control problem of congestion management model in the real-time power systems. An improved optimal congestion cost model is built by introducing the congestion factor in dealing with the cases: opening the generator side and load side simultaneously. The problem of real-time congestion management is transformed to a nonlinear programming problem. While the transmission congestion is maximum, the adjustment cost is minimum based on the ant colony algorithm, and the global optimal solu-tion is obtained. Simulation results show that the improved optimal model can obviously reduce the adjust-ment cost and the designed algorithm is safe and easy to implement.
Ant Colony Optimization Approach Based Genetic Algorithms for Multiobjective Optimal Power Flow Problem under Fuzziness  [PDF]
Abd Allah A. Galal, Abd Allah A. Mousa, Bekheet N. Al-Matrafi
Applied Mathematics (AM) , 2013, DOI: 10.4236/am.2013.44084

In this paper, a new optimization system based genetic algorithm is presented. Our approach integrates the merits of both ant colony optimization and genetic algorithm and it has two characteristic features. Firstly, since there is instabilities in the global market, implications of global financial crisis and the rapid fluctuations of prices, a fuzzy representation of the optimal power flow problem has been defined, where the input data involve many parameters whose possible values may be assigned by the expert. Secondly, by enhancing ant colony optimization through genetic algorithm, a strong robustness and more effectively algorithm was created. Also, stable Pareto set of solutions has been detected, where in a practical sense only Pareto optimal solutions that are stable are of interest since there are always uncertainties associated with efficiency data. The results on the standard IEEE systems demonstrate the capabilities of the proposed approach to generate true and well-distributed Pareto optimal nondominated solutions of the multiobjective OPF.

Research on Traveling Routes Problems Based on Improved Ant Colony Algorithm  [PDF]
Zhanchang Yu, Sijia Zhang, Siyong Chen, Bingxing Liu, Shiqi Ye
Communications and Network (CN) , 2013, DOI: 10.4236/cn.2013.53B2109

This paper studies how to obtain a reasonable traveling route among given attractions. Toward this purpose, we propose an objective optimization model of routes choosing, which is based on the improved Ant Colony Algorithm. Furthermore, we make some adjustment in parameters in order to improve the precision of this algorithm. For example, the inspired factor has been changed to get better results. Also, the ways of searching have been adjusted so that the traveling routes will be well designed to achieve optimal effects. At last, we select a series of attractions in Beijing as data to do an experimental analysis, which comes out with an optimum route arrangement for the travelers; that is to say, the models we propose and the algorithm we improved are reasonable and effective.

No Fit Polygon for Nesting Problem Solving with Hybridizing Ant Algorithms  [PDF]
Qiang Yang
Journal of Software Engineering and Applications (JSEA) , 2014, DOI: 10.4236/jsea.2014.75040

In design science, these two kinds of problems are mutually nested, however, the nesting could not blind us for the fact that their problem-solving and solution justification methods are different. The ant algorithms research field, builds on the idea that the study of the behavior of ant colonies or other social insects is interesting, because it provides models of distributed organization which could be utilized as a source of inspiration for the design of optimization and distributed control algorithms. In this paper, a relatively new type of hybridizing ant search algorithm is developed, and the results are compared against other algorithms. The intelligence of this heuristic approach is not portrayed by individual ants, but rather is expressed by the colony as a whole inspired by labor division and brood sorting. This solution obtained by this method will be evaluated against the one obtained by other traditional heuristics.

Design and Implementation of Peer-to-Peer Service Routing Algorithm  [PDF]
Xiaoyan Gao
Journal of Software Engineering and Applications (JSEA) , 2015, DOI: 10.4236/jsea.2015.811054
Abstract: Due to the lack of QoS (quality of service) guarantee in current Peer-to-Peer services routing network, it is difficult to apply Peer-to-Peer network to business successfully. Therefore, a service guarantee routing model is proposed in this paper, and an ant colony algorithm is designed for this routing model. Finally, the experimental analysis of the Peer-to-Peer services routing algorithm is presented. The experimental result shows the effectiveness of the service routing algorithm.
Application of Ant Colony Algorithm to the Analysis of Common Mode EMI Model of DC Motor  [PDF]
Jinfeng Liu, Xudong Wang, Jiang Nan
Energy and Power Engineering (EPE) , 2011, DOI: 10.4236/epe.2011.32013
Abstract: The Electromagnetic Compatibility (EMC) of direct current (DC) motor windings is a system model which is used to reflect the functional characters of the system in the whole EMC specified frequency (150 KHz ~ 30 MHz). For most motor designing process, it is always used to evaluate the inductance of windings in lower or working frequency; however, when analyzing the conducted interference, it is necessary to take some pa-rameters in high frequency into account in building up the EMC model, such as the noticeable capacitance distributed among the windings or between windings and shells. Past research neglected the common-mode current generated by the high frequency interference within motor bearings coupled with shells, since the parasitic capacitance of rotor core comes from armature windings supplied sufficient paths. In EMC model-ing process for DC motor problem, first, test the impedance of windings by experiments; then, generate the equivalent circuit with overall parameters. At present, it is a difficulty that how to choose the parameters. Most researchers preferred to adopt analytical calculation results, however, it could not reflect the essence of the model since it requires many simplification. Based on this point, this paper adopted ant colony algorithm (ACA) with positive feedback to intelligently search and globally optimize the parameters of equivalent cir-cuit. Simulation result showed that the impedance of equivalent circuit calculated by this algorithm was the same as experimental result in the whole EMC frequency. In order to further confirm the validity of ACA, PSPICE circuit simulation was implemented to simulate the spectrum of common mode Electromagnetic Interference (EMI) of equivalent circuit. The simulation result accords well with the experiment result re-ceived by EMI receiver. So it sufficiently demonstrated correctness of ACA in the analysis of high frequency equivalent circuit.
Heuristic Approaches for Cell Formation in Cellular Manufacturing  [PDF]
Shahram Saeedi, Maghsud Solimanpur, Iraj Mahdavi, Nikbakhsh Javadian
Journal of Software Engineering and Applications (JSEA) , 2010, DOI: 10.4236/jsea.2010.37077
Abstract: Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manu-facturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on simi-larities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Optimization (ACO), Genetic Algorithm (GA) and Simulated Annealing (SA) meta-heuristic methods and the results are compared. The computational results show that the GA method is more effective in solving the model.
A New Constructive Method for Electric Power System Reconfiguration Using Ant Colony
Leonardo Electronic Journal of Practices and Technologies , 2008,
Abstract: This electric power distribution system delivers power to the customers from a set of distribution substations. While the transmission lines are configured in a meshed network, the distribution feeders are configured radially in almost all cases. The proposed problem in this work is to determine the optimal topology among a various alternatives. This problem is known as a problem of total investment-cost minimization, subject to power constraints. In fact, the paper addresses an ant colony met-heuristic optimization method to solve this combinatorial problem. Due to the variation of demand, the reconfiguration may be considered in two different situations: in the system planning or system design stage. The proposed met-heuristic determines the minimal investment-cost system configuration during the considered study period to satisfy power transit constraints. The algorithm of ant colony approach (ACA) is required to identify the optimal combination of adding or cut off feeders with different parameters for the new topology design.
Optimizing Clustering Technique based on Partitioning DBSCAN and Ant Clustering Algorithm
Chaitali Chaitali
International Journal of Engineering and Advanced Technology , 2012,
Abstract: Clustering is the process of organizing similar objects into the same clusters and dissimilar objects in to different cluster. Similarities between objects are evaluated by using the attribute value of object, a distance metric is used for evaluating dissimilarity. DBSCAN algorithm is attractive because it can find arbitrary shaped clusters with noisy outlier and require only two input parameters. DBSCAN algorithm is very effective for analyzing large and complex spatial databases. DBSCAN need large volume of memory support and has difficulty with high dimensional data. Partitioning-based DBSCAN was proposed to overcome these problems. But both DBSCAN and PDBSCAN algorithms are sensitive to the initial parameters.
Page 1 /12848
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.