A multistage approach to the shortest path on curved surface based on simulated annealing optimization

Author

Chen, Si-Duo ; Huang, Zhang-can ; Tian, Jiang-Wei

Author_Institution

Sch. of Electr. & Inf., Wuhan Tech. Univ., China

Volume

2

fYear

2001

fDate

2001

Firstpage

1269

Abstract

The paper presents our initial work on the shortest path on curved surface. The problem is modeled with node sequence so as to apply optimization methods for solution. The Metropolis Criterion-based optimization mechanism of simulated annealing is introduced as the stochastic search framework. A multistage optimization approach is studied to obtain the global optimal path with considerable precision. Several significant advantages of the algorithm are concluded, namely, arbitrary precision, low computational complexity, and considerable reliability. The simulation and visualization studies show its novelty

Keywords

computational complexity; search problems; simulated annealing; stochastic processes; Metropolis Criterion-based optimization mechanism; arbitrary precision; computational complexity; curved surface; global optimal path; multistage approach; multistage optimization approach; node sequence; optimization methods; reliability; shortest path; simulated annealing optimization; stochastic search framework; Computational complexity; Computational modeling; Genetic algorithms; Mathematical model; Mathematics; Optimization methods; Power engineering and energy; Railway engineering; Simulated annealing; Stochastic processes;

fLanguage

English

Publisher

ieee

Conference_Titel

Evolutionary Computation, 2001. Proceedings of the 2001 Congress on

Conference_Location

Seoul

Print_ISBN

0-7803-6657-3

Type

conf

DOI

10.1109/CEC.2001.934336

Filename

934336