Abstract

Multicriteria route planning is a crucial transportation planning issue under the field of GIS-based multicriteria decision analysis (GIS-MCDA) with broad applications. A searching algorithm is proposed to solve the multicriteria route planning problem with spatial urban information and constraints such an existing transit network in operation, certain vertices to be visited in the path, total number of vertices been visited, and length or range for the path. Evaluation of two in-operation mass-transit systems from Chicago and Tainan show that our method can retrieve solutions in a Pareto-optimal sense over comparative methods between profit under queried constraints (the expected passenger flow to be maximized, referring to the social welfare for the public) and cost for construction as well as maintenance (the cost of route to be minimized, referring to the sustainability for the government) with reasonable runtime over comparative methods.

Date

March 18, 2022

Authors

Fandel Lin, Hsun-Ping Hsieh

Journal

Applied Sciences

Volume

12

Issue

6

Pages

3127

Publisher

MDPI