An Improved NSGA-II Algorithm for Transit Network Design and Frequency Setting Problem

Algorithm 1

Input: Integer , , and , Set of degree values , Set .

1: whiledo

2: for each do

3:  Select endpoints of each line with probability of by roulette

4: for each do

5:  Search for -shortest path that satisfies

6: 

7: 

8: while and

9:  do Select path as line with probability of by roulette

10: 

11: for each do

12:  ifthen

13:   

14:  else

15:  Select path as line with probability of by roulette

16:  

17: ifthen

18:  for each

19:   Randomly inserted into line as an intermediate node

20:  

21: if not meeting connectivity constraint then

22:  Restart endpoints and lines generation procedure

23: Chromosomes coding and stored in the set

24: 

25: return