A Swarm Based Method for Solving Transit Network Design Problem

Abstract

In this study, a Discrete Particle Swarm Optimization (DPSO) algorithm is assimilated to solve the Transit Network Design Problem (TNDP). First, A Mixed Integer Model is developed for the TNDP. The solution methodology utilized here is made of two major elements. A route generation module is firstly developed to generate all the feasible transit lines. Through the second part, a DPSO algorithm is utilized to select the optimal set of lines from the constructed ones. The objective function is to maximize coverage index while satisfying the operator cost upper level constraints. The efficacy and accuracy of the implemented algorithms is compared with ones obtained by an enumeration process as well as an enumeration-based heuristic approach. Results confirmed that the PSO algorithm can find the optimum combination with significant decrease in the computational costs.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 5 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.