Bus Route Network Design Procedures

Indian Institute of Technology Delhi, India Department of Civil Engineering Transportation Engineering
URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013
A Review of Bus Route Network Design Procedures: Multi-objective optimization using Evolutionary Algorithms
S. M. Hassan Mahdavi M
Research Scholar, Transportation Engineering, Department of Civil Engineering, Indian Institute of Technology Delhi, India
K. Ramachandra Rao
Department of Civil Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India
Geetam Tiwari
Department of Civil Engineering, Indian Institute of Technology Delhi, Room 815, 7th Floor Main Building, Hauz Khas, New Delhi 110 016, India
Bus route network design (BRND)

Configuration and performance of Bus route network
Approach
Efficient utilization of resources depending upon optimal networking of routes and frequency of buses.
Transitions in optimization procedures over time
Mathematical and heuristic Single objective optimality

Multi-Objective Approach
Meta-heuristic approaches Multi-objective optimality

Efficiency
How efficient all components of bus transit system are being integrated?
Depending on stages involved in procedure
Bus route network design stages and components

Components of Bus Route Network Design
1. Objective function
2. Data required
3. Assignment models
4. Optimization algorithms
Route Construction Shortest path algorithms
Single Objective
Multi Objective
Demand estimation
Hybrid transit trip assignment

Multiple transit trip assignment All-or-Nothing demand assignments Dijkstra shortest path algorithm Hyper path transit assignment
Decision variables Passenger Operator Constraints Design variables
K-shortest path algorithm

Capacity-constrained traffic assignment Stochastic User Equilibrium assignment Yens kth shortest path algorithm Heuristics Meta- Heuristics
Demand parameters
Operational parameters Type 1: Pareto optimality models Type 2: Bi level mixed integer models Type 3: Weighted sum models Transfer related parameters
Evolutionary algorithms Travel time parameters Network structure parameters
Type 1: Genetic Algorithm
Type 2: Simulated annealing

Type 3: Immune Clone Annealing
BRNDP - Multi-Objective functions

1. Objective function Single Objective Multi Objective
Type 1: Weighted sum approach

Year Author 1998 Pattnaik et al 1998 Rao 1999 Tom i n 1 j n 2001 Chien Minimize : Z et al.A d ij pij 2003 Tom and Mohan i 1 j i 1 2003 Chakroborty 2004 Agrawal and Mathew 2004 Carrese and Gori 2005 Hu et al. 2006 Zhao 2006 Zhao and Zeng 2006 Fan and Machemehl 2009 Mauttone and Urquhart 2009 Beltran et al. 2009 Fan 2010 Fan and Mumford 2011 Szeto and Wu 2012 Cipriani et al. 2012 Ciaffi et al. 2012 Yu et al.
i n 1 j n
i 1 j i 1
d t
ij ij
Passenger
Operator Constraints
Weighted sum Bi level mixed integer Pareto optimality
Objectives being aggregated in a weighted function and converted into single objective function.

Type 2: Bi level Mixed integer

Year 2007 2008 2009 2010 Author Chenlevel et al of the model Upper Mudchanatongsuk et al Sun et al sum or Pareto Weighted Shimamoto et al
Passenger
Lower level of the model

Passenger trip assignment models Model of the leader and follower game


Type 3: Pareto optimality

Year Author perspective 2011 Passengers Blum and Mathew i n 1 j n 2011 Miandoabchi et al 2009 Lang et Minimize :C A p al
d
i 1 j i 1
ij
pij B
i n 1 j n
i 1 j i 1
d t
ij ij
Passenger
Operator perspective
Minimize : Co Ll
l 1
There is no single global solution

Passenger and operator costs traded

off as dual objectives
BRNDP Three Multi-Objective Perspectives followed:
User + Operator perspective
Based on: Minimizing Total Users travel cost Total Operating Cost
Including Externalities
Based on:
Minimizing Users costs
Operators costs (External Cost)
Including Transfer, Unsatisfied demand, Round trips

Based on:
Minimizaing Passenger cost [satisfied demand [in-vehicle travel time + waiting time + transfer penalty] unsatisfied demand] + Operator Cost [Round trip time + waiting time at round trip + frequency of kth route]
BRNDP - Variation of Constraints

1
2 4
Frequency feasibility
Load Factor Fleet size 3 5 Trip length Length of bus lanes
6 7
8 9
Transfer related Budget constraints of operating agencies

Demand allocation constraints Unsatisfied transit demand
10
12 14
Accessibility
Route directness
11 13
Round trip Geographical & land use
Maximum number of nodes and routes
BRNDP Example
Constraints
Frequency Load factor Fleet size Trip length Bus lanes Transfer
Objective function
Multi objective function Weighted sum approach Bi level mixed integer Pareto optimality
1 2 3
Minimize : Z A
r
i n 1 j n
i 1 j i 1
ij
pij B
i n 1 j n
i 1 j i 1
d t
ij ij
Minimize : Co Ll Data required l 1
Passenger Demand Assignment
Constraints: f min f k f max Sk C frequency constraint Capacity Cosntraint
4
Optimization Procedure
Fmax route set construction Fleet size constraint Initial
xi , j xmax Maximum transfer constraint
Sensitivity Analysis
6 7
Small and Big network testing
Bus route network design components

2. Data required
Single Objective
Multi Objective
Demand estimation


Demand parameters

BRNDP Parameters (Passenger Demand)

1. Data required
Demand estimation
Parameters Decision Variables Design Variables
Demand estimation as Multi-dimensional approach
Depending on factors determined by user and operators
Demand parameters Operational parameter Transfer parameter
Travel time parameter

Network structure
Level of service + Perception of operational agency + Configuration of Bus transit network structure +
BRNDP Demand Estimation issues
1 Fixed Demand
Assuming demand given in network
2 Variable demand versus Fixed demand

Variable relationship between Transit demand and network configuration Toward optimum solution Re-estimation of demand based on: Peak time and non-peak time
Demand forecasting models 4 step model or Descrite choice models
BRNDP Parameters Design and Decision Variables

Demand Parameters Operational Parameters
Transfer related Parameters Travel time Parameters Network structure Parameters

Passenger Min Max Transfer penalty travel allowable demand frequency between of OD buses pairs or headways Length of the routes Percentage Maximum fleet demand size, satisfied Bus capacity, without Bus any fares transfers Number of lanes with Maximum Travel one time transfer operating between OD hours, pairs Budget limit Maximum Number of routes with Cost one Maximum of operating transfer travel time hours Value Bus travel Maximum of unsatisfied speed allowable travel round demand trip time
BRNDP Procedure and components

Constraints
Objective function
1
Data required
Parameters
Demand Operational Transfer related Travel time related Network structure
2 3
Design variables Decision variables
Demand Estimation Modeling
4
Initial route set construction
6 7

2. Data required
Single Objective
Multi Objective
Demand estimation


Demand parameters

BRNDP Passenger demand Assignment

Assignment Models
Hybrid transit trip assignment Multiple transit trip assignment All-or-Nothing demand assignments
Hyper path transit assignment

Capacity-constrained traffic assignment
Stochastic User Equilibrium assignment

Constraints
Objective function
1 2 3
Data required

Route Construction Module Shortest path algorithm Feasibility Assessment Connectivity Assessment
4
6 7

2. Data required
Single Objective
Multi Objective
Demand estimation


Demand parameters

BRNDP Optimization
Optimization algorithms
Step 1 Step 2 Route construction
Shortest path algorithms Dijkstra shortest path algorithm

K-shortest path algorithm / Yens Heuristics
Meta- Heuristics
Step 3 Evolutionary algorithms Type 1: Genetic Algorithm Type 2: Simulated annealing

BRNDP Route construction procedure
Candidate route set generation

Identify initial route set using shortest path algorithms
Dijkstra shortest path algorithm K-shortest path algorithm / Yens
Applying heuristics to check

Feasibility checking Connectivity checking Route evaluation modules Frequency setting > Simultaniously or Separately
Applying optimization procedure

Find optimum set of solutions
Heuristic Meta-Heuristic
BRNDP Example
Objective function Constraints Shortest path algorithm Multi objective function Connectivity check Frequency Weighted sum approach Example: Load factor Bi level mixed integer Fleet size Depth-first search Pareto optimality Trip length breadth-first search Bus lanes
Transfer
1 2 3
Data required
Initial Route set: Passenger Demand Assignment

4
6 7
BRNDP Example
Evolutionary algorithms as a population based methods
1 2
Genetic algorithm operation
Objective function Data required

Optimum solution
Meta-Heauristic approach Evolutionary algorithm Genetic algorithm Simulated annealing Immune clone annealing
4
5
6 7
BRNDP Example
Objective function Constraints Multi objective function Small Network test Frequency
Load factor Fleet size Trip length Bus lanes Transfer Weighted sum approach Bi level mixed integer Pareto optimality
1 2 3
Data required
Real size Network test
4
5
6 7
Key issues to optimum solution in BRND
1 Demand Estimation methods

2 Route construction heuristics
Route Evaluation parameters
3 Effect of more complex parameters in

optimum solution set Bus stop spacing, accessibility to bus stops
4 Effect of different operators in Evolutionary

algorithms

Constraints
Objective function
1
Data required
Parameters
Demand Operational Transfer related Travel time related Network structure
2 3
Design variables Decision variables
Demand Estimation Initial route set construction

Meta-Heauristic approach Evolutionary algorithm Genetic algorithm Simulated annealing Immune clone annealing
4
5
Sensitivity to evolutionary algorithm operators Sensitivity to parameters
6 7

Different types of network
Title
Indian Institute of Technology Delhi, India Department of Civil Engineering Transportation Engineering URBAN MOBILITY CONFERENCE INDIA RESEARCH SYMPOSIUM, 05 December 2013
A Review of Bus Route Network Design Procedures: Multi-objective optimization using Evolutionary Algorithms
E-Mail: smh.mahdavi@gmail.com
Thank You
S. M. Hassan Mahdavi M
Research Scholar, Transportation Engineering, Department of Civil Engineering, Indian Institute of Technology Delhi, India
K. Ramachandra Rao
Department of Civil Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi 110016, India
Geetam Tiwari
Department of Civil Engineering, Indian Institute of Technology Delhi, Room 815, 7th Floor Main Building, Hauz Khas, New Delhi 110 016, India

Bus Route Network Design Procedures

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Bus Route Network Design Procedures

Uploaded by

Copyright:

Available Formats

Indian Institute of Technology Delhi, India Department of Civil Engineering Transportation Engineering

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

Bus route network design (BRND)

Mathematical and heuristic Single objective optimality

Meta-heuristic approaches Multi-objective optimality

Depending on stages involved in procedure

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

Bus route network design stages and components

Hybrid transit trip assignment

Decision variables Passenger Operator Constraints Design variables

K-shortest path algorithm

Evolutionary algorithms Travel time parameters Network structure parameters

Type 1: Genetic Algorithm

Type 2: Simulated annealing

BRNDP - Multi-Objective functions

Type 1: Weighted sum approach

Weighted sum Bi level mixed integer Pareto optimality

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

BRNDP - Multi-Objective functions

Type 2: Bi level Mixed integer

Lower level of the model

Weighted sum Bi level mixed integer Pareto optimality

BRNDP - Multi-Objective functions

Type 3: Pareto optimality

There is no single global solution

Passenger and operator costs traded

BRNDP Three Multi-Objective Perspectives followed:

User + Operator perspective

Minimizing Users costs

Operators costs (External Cost)

Including Transfer, Unsatisfied demand, Round trips

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

BRNDP - Variation of Constraints

Transfer related Budget constraints of operating agencies

Round trip Geographical & land use

Maximum number of nodes and routes

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

Minimize : Co Ll Data required l 1

Passenger Demand Assignment

Constraints: f min f k f max Sk C frequency constraint Capacity Cosntraint

Fmax route set construction Fleet size constraint Initial

xi , j xmax Maximum transfer constraint

Small and Big network testing

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

Bus route network design components

Hybrid transit trip assignment

Decision variables Passenger Operator Constraints Design variables

K-shortest path algorithm

Evolutionary algorithms Travel time parameters Network structure parameters

Type 1: Genetic Algorithm

Type 2: Simulated annealing

BRNDP Parameters (Passenger Demand)

Demand estimation as Multi-dimensional approach

Depending on factors determined by user and operators

Demand parameters Operational parameter Transfer parameter

Travel time parameter

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

BRNDP Demand Estimation issues

2 Variable demand versus Fixed demand

Demand forecasting models 4 step model or Descrite choice models

URBAN MOBILITY CONFERENCE INDIA - RESEARCH SYMPOSIUM, 05 December 2013

BRNDP Parameters Design and Decision Variables

Transfer related Parameters Travel time Parameters Network structure Parameters

BRNDP Procedure and components