Fuzzy ant colony algorithm for solving the k-shortest paths of train operation in emergency

zbMATH Open1389.90086MaRDI QIDQ5367973FDOQ5367973

Authors: Lanxia Zhang, Yong Qin, Xuelei Meng, Tao Zhang 

Publication date: 20 October 2017

Recommendations

• A fuzzy minimum risk model for the railway transportation planning problem
• \(k\)-shortest routing of trains on shunting yards
• A shortest path problem on a network with fuzzy arc lengths
• A fuzzy shortest path with the highest reliability
• Fuzzy shortest path problem with finite fuzzy quantities

zbMATH Keywords

\(k\)-shortest pathsemergenciesfuzzy ant colony algorithmfuzzy dwell time

Mathematics Subject Classification ID

Theory of fuzzy sets, etc. (03E72) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

This page was built for publication: Fuzzy ant colony algorithm for solving the \(k\)-shortest paths of train operation in emergency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367973)