Reliable path selection after disaster based on multi-objective genetic algorithm

被引：1

作者：

Li Q. ^{[1
,2
]}

Hu Z.-H. ^{[2
]}

机构：

[1] School of Economics and Management, Tongji University, Shanghai

[2] Logistics Research Center, Shanghai Maritime University, Shanghai

来源：

Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2016年 / 50卷 / 01期

关键词：

Multi-objective genetic algorithm; Priority; Reliability; Shortest path problem;

D O I：

10.3785/j.issn.1008-973X.2016.01.006

中图分类号：

学科分类号：

摘要：

The shortest path is needed to transport victims and materials as soon as possible. Safe path becomes the critical factor in road selection considering the road damage in the disaster. Three means were adopted to define the road reliability based on the damage condition of roads after a disaster, and a bi-objective optimization model was established. The model tries to minimize the length of road and maximize the roads' reliability. The priority-based multi-objective genetic algorithm was used to handle the problem. The solutions were respectively got under three situations. Pareto analysis was conducted. The impacts of crossover rate and mutation rate on the results were analyzed. With the crossover ratio increases, the coverage fluctuates and the fluctuated ideal volume decreases. With the mutation ratio increases, the coverage fluctuates and the ideal volume grows slowly and then gradually declines. The genetic algorithm can effectively solve the shortest and most reliable path problem. © 2016, Zhejiang University. All right reserved.

引用

页码：33 / 40and47

页数：4014

共 19 条

[1]

Yan H.-H., Xu Y.-F., The most vital edge of the shortest path with incomplete information in traffic networks, Systems Engineering, 24, 2, pp. 37-40, (2006)

[2]

Nazemi A., Omidi F., An efficient dynamic model for solving the shortest path problem, Transportation Research Part C, 26, 2013, pp. 1-19, (2013)

[3]

Festa P., Guerriero F., Lagana D., Et al., Solving the shortest path tour problem, European Journal of Operational Research, 230, 2013, pp. 464-474, (2013)

[4]

Amirteimoori A., An extended shortest path problem: a data envelopment analysis approach, Applied Mathematics Letters, 25, 2012, pp. 1839-1843, (2012)

[5]

Asakura Y., Kashiwadani M., Road network reliability caused by daily fluctuation of traffic flow, Proceedings of the 19th PTRC Summer Annual Meeting, pp. 73-84, (1991)

[6]

Chen A., Yang H., Lo H., Capacity reliability of a road network: an assessment methodology and numerical results, Transportation Research Part B: Methodological, 36, 3, pp. 225-252, (2002)

[7]

Ardakani M.K., Tavana M., A decremental approach with the A<sup>*</sup> algorithm for speeding-up the optimization process in dynamic shortest path problems, Measurement, 60, 2015, pp. 299-307, (2015)

[8]

Jin K.-W., Li C.-B., Qin Q.-Q., Study on shortest path search method based on ant algorithm, Journal of Highway and Transportation Research and Development, 23, 3, pp. 128-131, (2006)

[9]

Lozano L., Medaglia A.S.L., On an exact method for the constrained shortest path problem, Computers and Operations Research, 40, 2013, pp. 378-384, (2013)

[10]

Cheng J., Lisser A., Maximum probability shortest path problem, Discrete Applied Mathematics, 192, 2015, pp. 40-48, (2015)

← 1 2 →