Improved Self-Adaptive Genetic Algorithm and its Application on the Dynamic Stochastic Shortest Path Problem

Hai Yang

doi:10.4028/www.scientific.net/AMM.409-410.1415

Paper Titles

Establishment and Validation of Mainline Driver Type Model at Expressway-Ramp Merging Area
p.1392

A Dynamic Algorithm of Partitioning Urban Road Network into Traffic Control Subareas
p.1398

A Quick Offset Optimization Method for Traffic Signal Coordination
p.1403

Research on Simulation of Pedestrian in Passenger Transfer Hub Based on Commuter
p.1407

Improved Self-Adaptive Genetic Algorithm and its Application on the Dynamic Stochastic Shortest Path Problem
p.1415

Study on Safety Evaluation of Flammable Solid Railway Transportation Based on the Bayesian Network
p.1419

Detecting Research for Vehicles Track at Roundabout Based on Dual Data Source
p.1423

Dynamic Planning Model for Port Iorn Ore Inventory
p.1429

Research of Semi-Step Walking Wheel Based on Vehicle-Terramechanics
p.1435

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 409-410Improved Self-Adaptive Genetic Algorithm and its...

Improved Self-Adaptive Genetic Algorithm and its Application on the Dynamic Stochastic Shortest Path Problem

Abstract:

In reality transportation network is dynamic and stochastic. Studies on the dynamic stochastic shortest path problem are of great research and application value. This paper introduces basic genetic algorithm into it. Then an improved self-adaptive genetic algorithm is proposed by improving population initialization, selection strategy, crossover strategy and mutation strategy. In addition, the improved genetic algorithm adjusts the crossover and mutation factors adaptively. The results of simulation experiment show that the improved genetic algorithm proposed by this paper has much higher capacity of global optimization than Dijkstra and A* algorithm in the dynamic stochastic shortest path problem.

You might also be interested in these eBooks

Sustainable Development and Environment II

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 409-410)

Pages:

1415-1418

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.409-410.1415

Citation:

Cite this paper

Online since:

September 2013

Authors:

Hai Yang

Keywords:

Dijkstra, Dynamic Stochastic Network, Genetic Algorithm (GA), Self Adaptive, Shortest Path

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] S. K. Peer, Dinesh Kumar Sharma: Finding the shortest path in stochastic networks. Computers & Mathematics with Applications. 2007, 53(5): 729-740.

DOI: 10.1016/j.camwa.2007.01.012

Google Scholar

[2] E. W. Dijkstra: A note on two problems in connexion with graphs. In: Numerische Mathematik. 1, S. 1959, 269–271.

DOI: 10.1007/bf01386390

Google Scholar

[3] Floyd, Robert W. Algorithm 97: Shortest path. Communications of the ACM. 1962, 5 (6): 345.

Google Scholar

[4] Hart, P. E.; Nilsson, N. J.; Raphael, B. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions of systems science and cybernetics, vol. ssc-4, 1968, 2: 100-107.

DOI: 10.1109/tssc.1968.300136

Google Scholar

[5] Marco Dorigo. Ant colonies for the traveling salesman problem[J]. Biosystems, 1997, 43: 73-81.

DOI: 10.1016/s0303-2647(97)01708-5

Google Scholar

[6] Fredman M. L., Tarjan R. E. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. Journal of ACM, 1987, 34(3): 596-615.

DOI: 10.1145/28869.28874

Google Scholar