Transit network frequencies-setting problem solved using a new multi-objective global-best harmony search algorithm and discrete event simulation

5Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The rise of Bus Rapid Transit Systems (BRTS) in urban centers involves complex problems of design and scheduling including the scheduling of route intervals across the bus network. The difficulty stems from the fact that transport systems keep to established routes and must set frequencies for each route to minimize costs (measured in terms of transport capacity wasted) and maximize the quality of service (minimizing the total time of users in the system). All this depends on the maximum number of buses available in the system. In an effort to find an alternative solution to the Transit Network Frequencies Setting Problem (TNFSP) on BRTS, this paper proposes using Multi-Objective Global Best Harmony Search (MOGBHS), a multi-objective heuristic algorithm based on three main components: (1) Global-Best Harmony Search, as a heuristic optimization strategy, (2) Non-Dominated Sorting, as a multi-objective optimization strategy, and (3) Discrete Event Simulation, for obtaining quality measures in the solutions found. To test the proposed approach, a simulation model was implemented for Megabus, a BRTS located in Pereira (Colombia), for which the frequency of the buses assigned to routes previously defined in the system was optimized so that operating costs were reduced to a minimum, while user satisfaction was maximized. The MOGBHS algorithm was compared with NSGA-II. It was concluded that MOGBHS outperformed NSGA-II in the number of optimal solutions found (Pareto front points), from 175% in 3,000 fitness function evaluations to 488% in 27,000 evaluations.

Cite

CITATION STYLE

APA

Ruano, E., Cobos, C., & Torres-Jimenez, J. (2017). Transit network frequencies-setting problem solved using a new multi-objective global-best harmony search algorithm and discrete event simulation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10062 LNAI, pp. 341–352). Springer Verlag. https://doi.org/10.1007/978-3-319-62428-0_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free