Recently, the ant algorithm has been widely used to solve the problem of searching for optimization route from various different paths. The ant algorithm can also be applied for searching an appropriate route that con...
详细信息
ISBN:
(纸本)9788993215038
Recently, the ant algorithm has been widely used to solve the problem of searching for optimization route from various different paths. The ant algorithm can also be applied for searching an appropriate route that consumes less energy in mobile robot area, which is similar problem domain. However, in order to apply, the ant algorithm is required to adapt due to the factor of energy that must be considered in addition to the distance alone. This paper presents the adaptation of ant algorithm to solve the problem of searching energy-efficient route for mobile robot. The adapted ant algorithm deploys a speed, which is employed to find the energy to move the robot in each route, to generate pheromones used to define the probability that the ants will choose for the best route. Then, the distance is used as a weighting factor to discover the energy-efficient route in terms of distance and speed by simulation. The results from adapted ant algorithm are also used to compare with the conventional ant algorithm for investigation. The simulation results expressed that, when using the speed with the distance to weight, the average distance is shortest. Consequently, when transforming into the energy, the result is much lower as well. Therefore, the adaptation of ant algorithm can improve the result of searching problem for optimization route that consumes less energy, which is a limited resource of mobile robot.
We present an efficient QoS multicast routing algorithm based on ant algorithm. It considers multiple QoS metrics, e.g., bandwidth, delay, delay jittter. Our approach of constructing a multicast tree is to rind the sh...
详细信息
ISBN:
(纸本)9781424413119
We present an efficient QoS multicast routing algorithm based on ant algorithm. It considers multiple QoS metrics, e.g., bandwidth, delay, delay jittter. Our approach of constructing a multicast tree is to rind the shortest paths from the source to each destination separately by ant algorithm and then merge the resulting paths to form a multicast tree. Simulation results show that the proposed algorithm can find the optimal or near-optimal solution quickly.
To study the problem of UAV detection, a multi-traveler problem (MTSP) model and a two-dimensional in plane point circle coverage model are established. The ant algorithm and the Monk Carlo algorithm are used to solve...
详细信息
ISBN:
(纸本)9781538674451
To study the problem of UAV detection, a multi-traveler problem (MTSP) model and a two-dimensional in plane point circle coverage model are established. The ant algorithm and the Monk Carlo algorithm are used to solve the model according to the minimum time. First, extract the number of effective cities under the constraints of effective detection range and maneuverability of the drone. Secondly, the minimum time of flight is minimized as the objective function, and the MTSP UAV detection model based on 1936 traversal points is established. Finally, using the ant algorithm to iteratively solve, and smoothing the track by cubic B-spline interpolation to obtain a flight plan that satisfies the constraints. The shortest time to get is 7.28241h
In this paper we propose to use a new ant algorithm to solve the degree-constrained minimum spanning tree (DCMST) problem, which is a NP problem. The new ant algorithm is different from the general ant algorithm and i...
详细信息
ISBN:
(纸本)9781424409723
In this paper we propose to use a new ant algorithm to solve the degree-constrained minimum spanning tree (DCMST) problem, which is a NP problem. The new ant algorithm is different from the general ant algorithm and it: is very suitable to solve the DCMST problem. The ability of the algorithm is tested and given encouraging results. Finally, because the problem of clustering analysis and DCMST is very similar, so we put this new method into solving clustering analysis, and gain the interesting result.
ant algorithm is one kind of novel bionic optimization methodology. It assimilates the behavior characteristic of ant. and shows good performance in combinational optimization problems through its inside searching mec...
详细信息
ISBN:
(纸本)9789806560673
ant algorithm is one kind of novel bionic optimization methodology. It assimilates the behavior characteristic of ant. and shows good performance in combinational optimization problems through its inside searching mechanism. In this paper. a novel trajectory planning method for a spherical robot using ant Colony Optimization algorithm is provided. The experiment demonstrates the feasibility of the proposed technique, with the robot can reaches destination in a satisfied trajectory with minimal probability of failure.
With the fast development of the inland waterway transport and the increasing of quantity ships, it is obviously exposed the deficiency of inland river ship locks navigation capacity and even though the inland navigat...
详细信息
ISBN:
(纸本)9781728198460
With the fast development of the inland waterway transport and the increasing of quantity ships, it is obviously exposed the deficiency of inland river ship locks navigation capacity and even though the inland navigation resources are abundant with many rivers in our country, and the contradiction is more and more acute. In order to improve the ship lock navigation capability, to ensure safe, convenient, stable and orderly navigation through the ship locks. This paper used a population-based ant algorithm to solve the lock chamber arrangement optimization problem. The population-based ant algorithm uses the population queue as a strategy to update the pheromone, meantime it established the population-based ant algorithm for the lock chamber arrangement, implemented corresponding algorithm through further design, and tested the validity through the lock chamber arrangement of the Qingyuan Water Conservancy and the Yangtze Gorges. The examples are provided to illustrate the validity and practicality of the population-based ant algorithm for the lock chamber arrangement.
According to high energy losing caused by directly communication between cluster heads and Sink node in LEACH algorithm, a new algorithm based on ant algorithm is formally deriver in this paper. The algorithm takes ad...
详细信息
ISBN:
(纸本)9783037851920
According to high energy losing caused by directly communication between cluster heads and Sink node in LEACH algorithm, a new algorithm based on ant algorithm is formally deriver in this paper. The algorithm takes advantage of the features of ant algorithm, i.e. being easy to be realized, and supporting multi-path to build cluster routing, through the information of its distance and remaining energy of nodes. Then the distance and remaining energy of the neighborhood were integrated in the computation of pheromone concentration. The results of simulation show that compared with LEACH, the algorithm can get a better balance of the energy dissipation and prolong the network lifetime.
The article compares the speed of ant algorithm implemented on the processor and the graphics card in the assignment problem. It is a fundamental issue optimization-combinatorial operations research. In computer scien...
详细信息
ISBN:
(纸本)9788363578046
The article compares the speed of ant algorithm implemented on the processor and the graphics card in the assignment problem. It is a fundamental issue optimization-combinatorial operations research. In computer science and operations research, the ant algorithm is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. The article concerns the problem of allocating Automation and Robotics students at the Nicolaus Copernicus University to several groups working on the construction of the minisumo robot which should be launched in international competitions in Vienna. The program is written in two languages processor programming in C + + and on the graphics card in C# language using Cloo library. The results indicate the advantage of the graphics card to optimization problems, where there is a possibility of parallelization of computations.
Multicast routing is to find the paths from a service node re ail multicast destinations. In this paper;based on mrt algorithm;we propose a distributed multicast routing scheme with delay-bounded and load-balancing tr...
详细信息
ISBN:
(纸本)0769509126
Multicast routing is to find the paths from a service node re ail multicast destinations. In this paper;based on mrt algorithm;we propose a distributed multicast routing scheme with delay-bounded and load-balancing traffic in real-time communications. We first describe ant algorithm model and give ant-network model, then present art approach using ant algorithm to optimize the multicast routes with delay-bounded and load-balancing traffic. Finally simulation has been done to show the efficiency of the algorithm in the environment of OPNET simulation software, and the simulation results show that the proposed approach can find the best optimal multicast routes which can satisfy the delay-bounded requirement avoid to congested nodes.
Scheduling Reception-Departure Line Assignment plan (RDLAP) is an important part of daily dispatch work in railway station. RDLAP is similar to, but more complicated than the classical Job-Shop Scheduling Problem (JSP...
详细信息
ISBN:
(纸本)1424404657
Scheduling Reception-Departure Line Assignment plan (RDLAP) is an important part of daily dispatch work in railway station. RDLAP is similar to, but more complicated than the classical Job-Shop Scheduling Problem (JSP). Regarding the railway station tracks and train running routes as machines, all trains in this railway station as jobs, RDLAP is very similar to a three operations, multiple machines JSP, but it has many constraints such as obeying train working diagram (TWD), station track using plan (TUP), locomotive utilization plan (LUP), number of train running route, minimal and maximal technical operating time etc. RDLAP is to assign every train a proper reception-departure line satisfying the constraints so that no two operations belonging to different objects (train or Locomotive) process the same resource (tracks and routes) at the same time. The goal is to minimize the total waiting time in reception-departure yard. In this paper, we introduced a mathematics model of RDLAP, and proposed an ant algorithm to solve this problem. Computational experiments are derived from the example of Beijing Western Passenger Railway Station. Results verified the potential of the algorithm in meeting the demand of dispatching centre.
暂无评论