A simple multi-objective optimization algorithm for the urban transit routing problem

Authors:
Lang Fan;Christine L. Mumford;Dafydd Evans
Affiliations:
School of Computer Science, Cardiff University, UK;School of Computer Science, Cardiff University, UK;School of Computer Science, Cardiff University, UK
Venue:
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Year:
2009

Citing 2
Cited 1

Algorithm 97: Shortest path

Communications of the ACM
A metaheuristic approach to the urban transit routing problem

Journal of Heuristics

Parallel genetic algorithm in bus route headway optimization

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The urban transit routing problem (UTRP) for public transport systems involves finding a set of efficient transit routes to meet customer demands. The UTRP is an NP-Hard, highly constrained, multi-objective problem, for which the evaluation of candidate route sets can prove both time consuming and challenging, with many potential solutions rejected on the grounds of infeasibility. In this paper we propose a simple evolutionary multi-objective optimization technique to solve the UTRP. First we present a representation of the UTRP and introduce our two key objectives, which are to minimise both passenger costs and operator costs. Following this, we describe a simple multi-objective optimization algorithm for the UTRP then present experimental results obtained using the Mandl's benchmark data and a larger transport network.