Research on the Route Search Method Based on Ant-Colony Microcanonical Annealing Algorithm

De Xin Yu; Xin Zhao; Kun Zheng

doi:10.4028/www.scientific.net/AMM.556-562.3980

Paper Titles

A Model of the Geometric Tolerances Modeling and Representation Process
p.3961

Quantum-Behaved Particle Swarm Optimization Using Q-Learning
p.3965

Electric Vehicle Charging Stations Optimal Location Based on Fuzzy C-Means Clustering
p.3972

An Approach to Generate Test Cases by Multi-Path Based on Genetic Algorithm
p.3976

Research on the Route Search Method Based on Ant-Colony Microcanonical Annealing Algorithm
p.3980

Optimization of Reactive Power Based on Dynamic Learning Factor Multi-Objective Particle Swarm Algorithm
p.3984

Multi-Path QoS Routing Algorithm Based on Disjoint Nodes for Mobile Ad Hoc Networks
p.3988

MPTCP Congestion Control Algorithm Based on the Fairness of Bottleneck
p.3995

A New Clustering Algorithm and Relevant Theoretical Analysis for Ad-Hoc Networks
p.4001

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 556-562Research on the Route Search Method Based on...

Research on the Route Search Method Based on Ant-Colony Microcanonical Annealing Algorithm

Abstract:

The paper proposes a large-scale route search method based on bidirectional ant-colony microcanonical annealing algorithm, which adopts double search. The underlying idea is to verify the proposed path search method under the real road network of Changchun city. The paper uses matlab to encode algorithm and adopts Mapinfo software mapping network for contrastive analyzing the proposed path search method and classical algorithm. The results demonstrate that the proposed method is larger advantage in running time and the global optimal solution, which has a good practicability.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 556-562)

Pages:

3980-3983

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.556-562.3980

Citation:

Cite this paper

Online since:

May 2014

Authors:

De Xin Yu, Xin Zhao*, Kun Zheng

Keywords:

Bidirectional Ant-Colony Algorithm, Microcanonical Annealing Algorithm, Route Search

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Mesbah, Mahmoud; Sarvi, Majid; Ouveysi, Iradj. Optimization of transit priority in the transportation network using a decomposition methodology[J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 19(2), pp.363-373, (2011).

DOI: 10.1016/j.trc.2010.05.020

Google Scholar

[2] Fu Liping. A Efficient Implementation to Dijkstra Arithmetic in ITS n adaptive routing algorithm for in-vehicle route guidance systems with real-time information[J]. Transportation Research Part B: Methodological, 35 (8): 749-765, (2001).

DOI: 10.1016/s0191-2615(00)00019-9

Google Scholar

[3] Ziliaskopoulos A, Kotzinos D. A Massively parallel time dependent least time path algorithm for intelligent transportation systems applications[J]. Computer Aided Civil and Infrastructure Engineering, 16(5) : 337-346, (2001).

DOI: 10.1111/0885-9507.00237

Google Scholar

[4] Wang Yuanbiao. Efficient Implementation to Dijkstra Arithmetic in ITS[J]. Computer Engineering, 33(6), pp.256-261, (2007).

Google Scholar

[5] Artigues, Christian; Huguet, Marie-Jose; Gueye, Fallou. State-based accelerations and bidirectional search for bi-objective multi-modal shortest paths[J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, v27, pp.233-259, FEB (2013).

DOI: 10.1016/j.trc.2012.08.003

Google Scholar

[6] Xu Junjie. A study on the theory and applications of meta-heuristic optimization algorithms [D]. Beijing University of Posts and Telecommunications, (2007).

Google Scholar