کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
1131859 1488976 2014 29 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Transit route and frequency design: Bi-level modeling and hybrid artificial bee colony algorithm approach
ترجمه فارسی عنوان
مسیر ترانزیت و طراحی فرکانس: مدل سازی سطحی و روش الگوریتم کلونی زنبور عسل ترکیبی
موضوعات مرتبط
علوم انسانی و اجتماعی علوم تصمیم گیری علوم مدیریت و مطالعات اجرایی
چکیده انگلیسی


• Propose a bi-level model for transit route design and frequency setting.
• Consider passenger transfers and congestion effects.
• Develop a hybrid artificial bee colony matheuristic to obtain robust solutions.
• Use KKT conditions of the lower level problem to derive the descent direction.
• Illustrate that a higher minimum frequency can lead to more passenger transfers.

This paper proposes a bi-level transit network design problem where the transit routes and frequency settings are determined simultaneously. The upper-level problem is formulated as a mixed integer non-linear program with the objective of minimizing the number of passenger transfers, and the lower-level problem is the transit assignment problem with capacity constraints. A hybrid artificial bee colony (ABC) algorithm is developed to solve the bi-level problem. This algorithm relies on the ABC algorithm to design route structures and a proposed descent direction search method to determine an optimal frequency setting for a given route structure. The descent direction search method is developed by analyzing the optimality conditions of the lower-level problem and using the relationship between the lower- and upper-level objective functions. The step size for updating the frequency setting is determined by solving a linear integer program. To efficiently repair route structures, a node insertion and deletion strategy is proposed based on the average passenger demand for the direct services concerned. To increase the computation speed, a lower bound of the objective value for each route design solution is derived and used in the fitness evaluation of the proposed algorithm. Various experiments are set up to demonstrate the performance of our proposed algorithm and the properties of the problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Transportation Research Part B: Methodological - Volume 67, September 2014, Pages 235–263
نویسندگان
, ,