مشخصات پژوهش

عنوان	A Path-based Greedy Algorithm for Multi-objective Transit Routes Design with Elastic Demand
نوع پژوهش	مقاله چاپ شده
کلیدواژه‌ها	Transit Routes Design; Transit Ridership; Path-based Traffic Assignment; Greedy Algorithm; Pareto-Optimal
چکیده	This paper is concerned with the problem of finding optimal sub-routes from a set of predefined candidate transit routes with the objectives of maximizing transit ridership as well as minimizing operational costs. The main contributions of this paper are: (1) considering transit ridership maximization in a multi-objective bi-level optimization framework; (2) proposing a greedy algorithm for the multi-objective design problem; (3) applying an efficient path-based algorithm to solve the lower level multi-modal traffic assignment problem. Numerical experiments indicate that the proposed algorithm not only is able to approximate the Pareto-optimal solutions with satisfactory accuracy, but also achieves a fast performance even for problems of real-world scale.
پژوهشگران	یو مارکو نی (نفر چهارم)، سیداحسان سیدابریشمی (نفر سوم)، محمود صفارزاده (نفر دوم)، امیر علی زرین مهر (نفر اول)