Optimal placements of flexible objects: An adaptive simulated annealing approach

Cheung, Sing‐Hang; Leung, Kwong‐Sak; Albrecht, Andreas; Wong, Carmen

doi:10.1007/bfb0056938

Cited by 4 publications

(1 citation statement)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They considered in their paper that crossover and mutation is O(n) and selection is O(nlogn). Cheung et al (1998) reported that an adapted SA algorithm for solving the optimal placement of objects had complexity of O(nlog 2n ), which was significantly improved from general SA approaches. Openshaw and Openshaw (1997) measured the practical computing times of SA to solve census zone design problem, which takes 100 times longer than other spatial heuristics and would become worse as additional constraints are introduced in the algorithm.…”

Section: Heuristics For the Multiple Viewpoint Problemmentioning

confidence: 99%

Exploring multiple viewshed analysis using terrain features and optimisation techniques

Kim

Rana

Wise

2004

Computers & Geosciences

124

View full text Add to dashboard Cite

The calculation of viewsheds is a routine operation in GIS and is used in a wide range of applications. Many of these involve the siting of features, such as radio masts, which are part of a network and yet the selection of sites is normally done separately for each feature. The selection of a series of locations which collectively maximise the visual coverage of an area is a combinatorial problem and as such cannot be directly solved except for trivial cases. In this paper, two strategies for tackling this problem are explored. The first is to restrict the search to key topographic points in the landscape such as peaks, pits and passes. The second is to use heuristics which have been applied to other maximal coverage spatial problems such as location-allocation. The results show that the use of these two strategies results in a reduction of the computing time necessary by two orders of magnitude, but at the cost of a loss of ten percent in the area viewed. Three different heuristics were used, of which Simulated Annealing produced the best results. However the improvement over a much simpler fast-descent swap heuristic was very slight, but at the cost of greatly increased running times.

show abstract

Section: Heuristics For the Multiple Viewpoint Problemmentioning

confidence: 99%