With the advancement of technology, there is a growing desire to provide support for real time multimedia services over wireless ad hoc networks. These applications demand strict Quality-of-Service (QoS) guarantees by...
详细信息
ISBN:
(纸本)9781479930807
With the advancement of technology, there is a growing desire to provide support for real time multimedia services over wireless ad hoc networks. These applications demand strict Quality-of-Service (QoS) guarantees by the underlying network in terms of delay, delay variance and packet loss. However, limited battery life of the nodes in a wireless network poses significant challenges in finding QoS optimized multicast routes. The depletion of energy resources of the node may lead to a disjoint network that can severely affect the QoS requirement of the application. In this paper, we investigate the problem of building a multicast tree that aims energy conservation while meeting the QoS demands of the application. We formulate the issue as a multiobjective optimization problem and apply a multi-colonyant approach to find the Pareto front for the new problem. The experimental results are presented to demonstrate the effectiveness of the algorithm. The results are compared with Elitist Non-dominated Sorting Genetic algorithm (NSGA-II).
This paper presents a modified multi-colony ant algorithm, based upon a pheromone arithmetic crossover and a repulsive operator. Iteration of this algorithm can avoid some stagnating states of basic antcolony optimiz...
详细信息
ISBN:
(纸本)9780769537054
This paper presents a modified multi-colony ant algorithm, based upon a pheromone arithmetic crossover and a repulsive operator. Iteration of this algorithm can avoid some stagnating states of basic antcolony optimization. An important mechanism of this algorithm is the reinitialization of such stagnating states (worst performing ant colonies), which is accomplished through application of the pheromone arithmetic crossover and the repulsive operator. At the same time, the main algorithm parameters alpha, beta and rho are self-adaptive. The ratio of communication time between processors to the computation time of the processors of this system (master and slaves) is relatively small. Comparing against a parallel asynchronous algorithm, we show the effectiveness of the modified multi-colony ant algorithm.
A numerical procedure is presented for the optimization of the position of water quality monitoring stations in a pressurized water distribution system (WDS). The procedure is based on the choice of the set of samplin...
详细信息
A numerical procedure is presented for the optimization of the position of water quality monitoring stations in a pressurized water distribution system (WDS). The procedure is based on the choice of the set of sampling stations which maximizes the monitored volume of water while keeping the number of stations at minimum. The optimization model is formulated in terms of integer programming, and the solution of the mathematical problem is efficiently approximated by means of a multi-objective multi-colony ant algorithm. A built-in routine is developed for calculation of the water fraction matrix and integrated into the general modeling structure to facilitate data entry and storage to minimize problems associated with water fraction matrix determination for varying scenarios and coverage criteria for any scenario. The proposed methodology is very robust in analyzing the effects of different scenarios and/or number of potential monitoring stations by eliminating the need of employing an off-line routine for coverage matrix identification. Robustness, ease of generalization, multi-objective nature, and computational efficiency are the main characteristics and novelty of the proposed approach. Monitoring stations are optimally located in a large-scale real-world network with 104 nodes and multiple demands using the proposed ACO models. The set of non-dominated solutions forming the Pareto front for a number of monitoring stations and the total coverage of the system are also presented.
This paper presents a new method of antalgorithm to solve the Job-shop Scheduling Problem (JSP) which minimizes the makespan. This algorithm includes two important features, forward/backward scheduling and multi-colo...
详细信息
ISBN:
(纸本)9789889867140
This paper presents a new method of antalgorithm to solve the Job-shop Scheduling Problem (JSP) which minimizes the makespan. This algorithm includes two important features, forward/backward scheduling and multi-colony approach. In general, a schedule is constructed by ants working in a forward direction, constructs the solutions in order of the precedence of processing sequences. In this paper, ants working in a backward direction, constructs the solution in the reversing order of processing sequences are introduced. Two types of ants exchange the information via modifying the pheromone trail in the same pheromone matrix. In multi-colony approach colonies of ants work independently but additional information from other colonies is also included. The performance of the proposed algorithm is tested over the benchmark problems. The comprehensive numerical investigation illustrates clearly the advantage of embedding the forward/backward scheduling and multi-colony approach in antalgorithm.
暂无评论