By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Lang Fan ; Sch. of Comput. Sci., Cardiff Univ., Cardiff ; Mumford, C.L. ; Evans, D.

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.

Published in:

Evolutionary Computation, 2009. CEC '09. IEEE Congress on

Date of Conference:

18-21 May 2009