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...
详细信息
ISBN:
(纸本)9781424455690
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 antalgorithm. Using the character that antalgorithm is simple and easy to realize, works in the part, and it integrates link quality into pheromone and supports many links to design the wireless sensor network routing algorithm based on the gradient and the residual energy antalgorithm. Through the simulation test of the routing algorithm, the test proves that the algorithm achieves design objectives of the wireless sensor network routing algorithm.
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...
详细信息
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 algorithmic approach, inspired by the foraging behavior of real ants, which can be applied to solve combinatorial optimization problems. A new ant-colony algorithm (NACO) has been developed in this paper to solve the flowshop, scheduling problem. The objective is to minimize the completion-time variance of jobs. Two existing ant-colony algorithms and the proposed ant-colony algorithm have been compared with an existing heuristic for scheduling with the objective of minimizing the completion-time variance of jobs. It is found that the proposed ant-colony algorithm gives promising and better results, on an average, as compared to those solutions given by the existing ant-colony algorithms and the existing heuristic for the permutation flowshop scheduling problem under study. (c) 2005 Elsevier B.V. All rights reserved.
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...
详细信息
ISBN:
(纸本)9780769536101
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 dominating set. Then a set of nodes selected by ant-colony algorithm are added to the above dominating set to make all the nodes in the set connected. Simulation results demonstrate the effectiveness and efficiency of the designed approach.
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...
详细信息
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 algorithm and gradually approximate the optimal control profile, was developed in this paper. The first step of IACA was to discretize time interval and control region to make the continuous dynamic optimization problem be a discrete problem. ant-colony algorithm was then used to seek the best control profile of the discrete dynamic system. At last, the iteration based on region reduction strategy was employed to get more accurate results and enhance robustness of this algorithm. Iterative ant-colony algorithm is easy to implement. The results of the case studies demonstrated the feasibility and robustness of this novel method. IACA approach can be regarded a,,;a reliable and useful optimization tool when gradient is not available. (c) 2005 Published by Elsevier Ltd.
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), ...
详细信息
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), is proposed and analysed for solving the single-machine scheduling problem. By considering the benchmark problems available in the literature for analysing the performance of algorithms for scheduling on a single machine with the consideration of weighted tardiness of jobs, we validate the appropriateness of the proposed local-search schemes and parameter settings used in the FACO. We also present a comparison of the requirements of CPU time for solving the single-machine total-weighted tardiness problem by the FACO and the existing algorithms.
This paper seeks to explore the effectiveness of antcolony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the wo...
详细信息
This paper seeks to explore the effectiveness of antcolony optimization for solving the job rotation scheduling problem. The problem of scheduling in job rotation is considered with the objective of minimizing the workload of jobs. The performances of the proposed two ant-colony algorithms are evaluated based on integer programming and simulated annealing solutions. Results show that the ant-colony algorithm implementation is able to compete effectively with the best known solution to the problem. (C) 2007 Elsevier Inc. All rights reserved.
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...
详细信息
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 to ideas by Stuetzle [Stuetzle, T. (1998). An ant approach for the flow shop problem. In: Proceedings of the sixth European Congress on intelligent techniques and soft computing (EUFIT '98) (Vol. 3) (pp. 1560-1564). Aachen: Verlag Mainz] and Merkle and Middendorf [Merkle, D., & Middendorf, M. (2000). An antalgorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, lecture notes in computer science 1803 (pp. 287-296). Berlin: Springer]. The second algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285]. A comparison of the solutions yielded by the ant-colony algorithms with the best heuristic solutions known for the benchmark problems up to now, as published in extensive studies by Liu and Reeves [Liu, J., & Reeves, C.R. (2001)]. Constructive and composite heuristic solutions to the P//Sigma C-i scheduling problem. European Journal of Operational Research, 132, 439-452, and Rajendran and Ziegler [Rajendran, C., & Ziegler, H. (2004). ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426-438], shows that the presented ant-colony algorithms are better, on an average, than the heuristics analyzed by Liu and Reeves and Rajendran and Ziegler. (c) 2004 Elsevier Ltd. All rights reserved.
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...
详细信息
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 to ideas by Stuetzle [Stuetzle, T. (1998). An ant approach for the flow shop problem. In: Proceedings of the sixth European Congress on intelligent techniques and soft computing (EUFIT '98) (Vol. 3) (pp. 1560-1564). Aachen: Verlag Mainz] and Merkle and Middendorf [Merkle, D., & Middendorf, M. (2000). An antalgorithm with a new pheromone evaluation rule for total tardiness problems. In: Proceedings of the EvoWorkshops 2000, lecture notes in computer science 1803 (pp. 287-296). Berlin: Springer]. The second algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278-285]. A comparison of the solutions yielded by the ant-colony algorithms with the best heuristic solutions known for the benchmark problems up to now, as published in extensive studies by Liu and Reeves [Liu, J., & Reeves, C.R. (2001)]. Constructive and composite heuristic solutions to the P//Sigma C-i scheduling problem. European Journal of Operational Research, 132, 439-452, and Rajendran and Ziegler [Rajendran, C., & Ziegler, H. (2004). ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. European Journal of Operational Research, 155, 426-438], shows that the presented ant-colony algorithms are better, on an average, than the heuristics analyzed by Liu and Reeves and Rajendran and Ziegler. (c) 2004 Elsevier Ltd. All rights reserved.
作者:
Rajendran, CZiegler, HIndian 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...
详细信息
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 algorithms are proposed and analyzed for solving the permutation flowshop scheduling problem. The first algorithm extends the ideas of the ant-colony algorithm by Stuetzle [Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT '98), vol. 3, Verlag Mainz, Aachen, Germany, 1998, p. 1560], called max-min ant system (MMAS), by incorporating the summation rule suggested by Merkle and Middendorf [Proceedings of the EvoWorkshops 2000, Lecture Notes in Computer Science No. 1803, Springer-Verlag, Berlin, 2000, p. 287] and a newly proposed local search technique. The second ant-colony algorithm is newly developed. The proposed ant-colony algorithms have been applied to 90 benchmark problems taken from Taillard [European Journal of Operational Research 64 (1993) 278]. First, a comparison of the solutions yielded by the MMAS and the two ant-colony algorithms developed in this paper, with the heuristic solutions given by Taillard [European Journal of Operational Research 64 (1993) 278] is undertaken with respect to the minimization of makespan. The comparison shows that the two proposed ant-colony algorithms perform better, on an average, than the MMAS. Subsequently, by considering the objective of minimizing the total flowtime of jobs, a comparison of solutions yielded by the proposed ant-colony algorithms with the best heuristic solutions known for the benchmark problems, as published in an extensive study by Liu and Reeves [European Journal of Operational Research 132 (2001) 439], is carried out. The comparison shows that the proposed ant-colony algorithms are clearly superior to the heuristics analyzed by Liu and Reeves. For 83 out of 90 problems considered, better solutions have been found by the two proposed ant-colony algori
暂无评论