• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.127-135
• /
• 2008

Generally, optimum shortest path algorithms adopt single attribute objective among several attributes such as travel time, travel cost, travel fare and travel distance. On the other hand, multi-objective shortest path algorithms find the shortest paths in consideration with multi-objectives. Up to recently, the most of all researches about multi-objective shortest paths are proceeded only in single transportation mode networks. Although, there are some papers about multi-objective shortest paths with multi-modal transportation networks, they did not consider transfer problems in the optimal solution level. In particular, dynamic programming method was not dealt in multi-objective shortest path problems in multi-modal transportation networks. In this study, we propose a multi-objective shortest path algorithm including dynamic programming in order to find optimal solution in multi-modal transportation networks. That algorithm is based on two-objective node-based label correcting algorithm proposed by Skriver and Andersen in 2000 and transfer can be reflected without network expansion in this paper. In addition, we use non-dominated paths and tree sets as labels in order to improve effectiveness of searching non-dominated paths. We also classifies path finding attributes into transfer and link travel attribute in limited transit networks. Lastly, the calculation process of proposed algorithm is checked by computer programming in a small-scaled multi-modal transportation network.

• Proceedings of the KOR-KST Conference
• /
• 2007.05a
• /
• pp.469-476
• /
• 2007

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.7 no.3
• /
• pp.1-14
• /
• 2008

Mass transit information should contribute many benefits to users. Especially transportation information technology is developing highly with information technology in Korea recently. Hereafter it is expected to provide customized transportation information to users individually with the advent of ubiquitous age in earnest. This public transportation information service can be realized by path finding algorithms in public transportation networks including travel and transfer attributes. In this research, multi objectives such as travel time, transfer time, and number of transfer and so on are constructed with the primary facts influencing users. Moreover, the method reducing user's path finding alternatives arbitrarily is proposed by selecting the best alternative which provides maximum utility to users among non dominated paths. Therefore, the ultimate goal of this study proposes a multi objective shortest paths finding algorithm which can take into account multiple user classes in a transit network with multiple travel modes. The proposed algorithm is demonstrated based on the two case studies - a small toy network and the large-scaled Seoul Metropolitan subway network.