An Experimental Study of Systemic Behavior of Cooperative Search Algorithms

1999 ◽  
pp. 373-392 ◽  
Author(s):  
Michel Toulouse ◽  
Teodor Gabriel Crainic ◽  
Brunilde Sansó
Keyword(s):  
Experimental Study ◽  
Search Algorithms ◽  
Cooperative Search

SIMULATED ANNEALING AND TABU SEARCH ALGORITHMS FOR MULTIWAY GRAPH PARTITION

1992 ◽  
Vol 02 (02) ◽  
pp. 159-185 ◽  
Author(s):  
L. TAO ◽  
Y.C. ZHAO ◽  
K. THULASIRAMAN ◽  
M.N.S. SWAMY
Keyword(s):  
Experimental Study ◽  
Simulated Annealing ◽  
Tabu Search ◽  
Time Frame ◽  
Search Algorithms ◽  
Graph Partition ◽  
Solution Quality ◽  
Running Time ◽  
New Algorithms

For a given graph G with vertex and edge weights, we partition the vertices into subsets to minimize the total weights for edges crossing the subsets (weighted cut size) under the constraint that the vertex weights are evenly distributed among the subsets. We propose two new effective graph partition algorithms based on simulated annealing and tabu search, and compare their performance with that of the LPK algorithm reported in Ref. 12. Extensive experimental study shows that both of our new algorithms produce significantly better solutions than the LPK algorithm (maximal and minimal improvements on average weighted cut size are roughly 51.8% and 10.5% respectively) with longer running time, and this advantage in solution quality would not change even if we run the LPK algorithm repeatedly with random initial solutions in the same time frame as required by our algorithms.

Systemic behavior of cooperative search algorithms

2004 ◽  
Vol 30 (1) ◽  
pp. 57-79 ◽  
Author(s):  
Michel Toulouse ◽  
Teodor Gabriel Crainic ◽  
Brunilde Sansó
Keyword(s):  
Search Algorithms ◽  
Cooperative Search

Global optimization properties of parallel cooperative search algorithms: A simulation study

2000 ◽  
Vol 26 (1) ◽  
pp. 91-112 ◽  
Author(s):  
Michel Toulouse ◽  
Teodor Gabriel Crainic ◽  
K Thulasiraman
Keyword(s):  
Global Optimization ◽  
Simulation Study ◽  
Search Algorithms ◽  
Cooperative Search

scholarly journals Towards Reducing the Impact of Localisation Errors on the Behaviour of a Swarm of Autonomous Underwater Vehicles

MENDEL ◽  
2020 ◽  
Vol 26 (2) ◽  
pp. 1-8
Author(s):  
Tarek El-Mihoub ◽  
Christoph Tholen ◽  
Lars Nolle
Keyword(s):  
Search Algorithm ◽  
Autonomous Underwater Vehicles ◽  
Search Space ◽  
Underwater Vehicles ◽  
Search Algorithms ◽  
Cooperative Search ◽  
Global View ◽  
High Level ◽  
The Impact ◽  
Search Information

Localisation errors have a great impact on Autonomous Underwater Vehicles (AUVs) as search agents. Different approaches for solving the localisation problem can be used and combined together for greater accuracy in estimating AUVs’ locations. The effect of localisation errors on locating a target can be lightened by designing a search algorithm that avoids extensive use of exact lo-cation information. In this paper, two cooperative search algorithms are proposed and evaluated. In these algorithms, a high-level mechanism is employed for building a global view of the search space using minimum possible search information. These algorithms rely on low-level search algorithms with exploring roles. Particle Swarm Optimisation (PSO) and all-to-one Self-Organising Migrating Algorithm (SOMA) are selected as high-level mechanisms. The conducted experiments demonstrate that both algorithms show a robust behaviour within a range of localisation errors.

scholarly journals Experimental study on the effects of communication on cooperative search in complex environments

2011 ◽  
pp. 535-556
Author(s):  
Ö. Çayirpunar ◽  
V. Gazi ◽  
B. Tavli ◽  
E. Cervera ◽  
U. Withowski ◽  
...  
Keyword(s):  
Experimental Study ◽  
Complex Environments ◽  
Cooperative Search

Experimental study on the restoration from a tilt-azimuth series for improvement in resolution

1995 ◽  
Vol 53 ◽  
pp. 636-637
Author(s):  
Norio Baba ◽  
Norihiko Ichise ◽  
Syunya Watanabe
Keyword(s):  
Experimental Study ◽  
Spherical Aberration ◽  
Incident Beam ◽  
Optical Parameters ◽  
Beam Tilting ◽  
Illumination Method ◽  
Restoration Method ◽  
Illumination Mode

The tilted beam illumination method is used to improve the resolution comparing with the axial illumination mode. Using this advantage, a restoration method of several tilted beam images covering the full azimuthal range was proposed by Saxton, and experimentally examined. To make this technique more reliable it seems that some practical problems still remain. In this report the restoration was attempted and the problems were considered. In our study, four problems were pointed out for the experiment of the restoration. (1) Accurate beam tilt adjustment to fit the incident beam to the coma-free axis for the symmetrical beam tilting over the full azimuthal range. (2) Accurate measurements of the optical parameters which are necessary to design the restoration filter. Even if the spherical aberration coefficient Cs is known with accuracy and the axial astigmatism is sufficiently compensated, at least the defocus value must be measured. (3) Accurate alignment of the tilt-azimuth series images.

Sign in / Sign up

Export Citation Format

Share Document