GENETIC ALGORITHM BASED A NEW ALGORITHM FOR TIME DYNAMIC SHORTEST PATH PROBLEM

被引：0

作者：

Dener, Murat ^{[1
]}

Akcayol, M. Ali ^{[2
]}

Toklu, Sinan ^{[2
]}

Bay, Omer Faruk ^{[1
]}

机构：

[1] Gazi Univ, Teknol Fak, Ankara, Turkey

[2] Gazi Univ, Muhendislik Fak, Ankara, Turkey

来源：

JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY | 2011年 / 26卷 / 04期

关键词：

Genetic algorithm; Shortest path problem; Networks; ROUTING PROBLEM; NETWORK DESIGN;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Many studies have been done for the shortest path problem and the results of these studies have been applied to different areas especially computer engineering and industrial engineering. In this study, a new algorithm has been developed using genetic algorithm for shortest path problem which have dynamic path cost depending on time. An example case study have been developed to compare proposed algorithm and the others. The simulation results show that the proposed algorithm is more successful than the others.

引用

页码：915 / 928

页数：14

共 26 条

[1] [Anonymous], 2002, IEEE T EVOLUTIONARY, V6
[2] BEASLEY D, 1993, U COMPUT, V15, P58
[3] BEASLEY D, 1993, U COMPUT, V15, P170
[4] Bellman E, 1958, APPL MATH, V16, P87
[5] BINGUL Z, 1999, P IASTED INT C INT S
[6] Cai X, 1997, NETWORKS, V29, P141, DOI 10.1002/(SICI)1097-0037(199705)29:3<141::AID-NET2>3.0.CO
[7] 2-H
[8] Vehicle Routing Problem with elementary shortest path based column generation
Chabrier, A
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (10) : 2972 - 2990
[9] SHORTEST ROUTE THROUGH A NETWORK WITH TIME-DEPENDENT INTERNODAL TRANSIT TIMES
COOKE, KL
HALSEY, E
[J]. JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 1966, 14 (03) : 493 - &
[10] THE MAXIMUM COVERING SHORTEST-PATH PROBLEM - A MULTIOBJECTIVE NETWORK DESIGN AND ROUTING FORMULATION
CURRENT, JR
VELLE, CSR
COHON, JL
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (02) : 189 - 199

← 1 2 3 →