Within memetic computing frameworks, the structure as well as a correct choice of memes are important elements that drive successful optimization algorithms. This paper studies variations of a promising yet simple sea...
详细信息
ISBN:
(纸本)9781479944910
Within memetic computing frameworks, the structure as well as a correct choice of memes are important elements that drive successful optimization algorithms. This paper studies variations of a promising yet simple search operator, the s algorithm, which can easily be integrated within a memetic framework to improve candidate solutions. s is a single-solution optimizer that iteratively perturbs variables and conditionally evaluatessolutions along the axes. The first s variant, namely s2, unconditionally evaluatessolutions in both directions while s3 maintains D uncorrelated step sizes that are either expanded in the direction of improving fitness or else redirected and contracted. Numerical results from the CEC2010 and CEC2014 benchmarksshow that the variants outperform s in terms of the number of function evaluations for a given fitness value and, further, that s3 outperformss in terms of final fitness against a wide range of problems and dimensionality.
In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wirelessservic...
详细信息
ISBN:
(纸本)9781467309899
In general, automobiles travel from the origin to the destination using a shortest route. However, the shortest route may not be a highest wireless connection-capacity route, because of availability of wirelessservices (base station and access points etc.) along the route. To the best of our knowledge, currently no algorithm exists for selecting a route that maximizes wireless connection-capacity, while keeping route length shortest and close to shortest. In this paper, we propose two modified version of Dijkstra route selection algorithms: one for selecting a maximum connection capacity shortest route, and the other is for discovering higher wireless connection-capacity routes;the length of the route could be larger than a shortest route, but no larger than predetermined bound. The second proposed algorithm exploits the state change of the intersection to broaden the search range of possible routes. Results from our extensive simulation for a Manhattan-street type grid network with the heterogeneous IEEE 802.11a wireless access, show that for a 50% increase in route length and 15 Access Points (APs), the proposed algorithm can increases wireless connection-capacity by 35.67% and 31.27% compared to the shortest and random route selection algorithms, respectively.
In this paper for certain long transform lengths, Winograd's algorithm for computing the discrete Fourier transform (DFT) is extended considerably. This is accomplished by performing the cyclic convolution, requir...
详细信息
暂无评论