The Integration of Multimodal Networks: The Generalized Modal Split and Collaborative Optimization of Transportation Hubs

Algorithm 2

HGSADC.

(1)	Initialization
(2)	while number of iterations without improvements < ItNI do
(3)	while maximum solution size is not reached do
	select parent solutions S1 and S2, create offspring O using route-based and location-based crossover operator. Insert O into solution set (crossover)
	end while
(4)	select solution S1 and mutate with route-based and location-based mutation operator (mutation)
(5)	for each solution S1, if infeasible then
(6)	Repair S1 with probability Prep (repair)
	if repairable then
	insert into feasible subpopulation.
	else
	insert into infeasible subpopulation
	end if
(7)	elseif S1 feasible then
	insert into feasible subpopulation
	end if
(8)	calculate objective values with GMS/TAP
(9)	calculate the biased fitness value
	Select survivors(selection)
(10)	if best solution not improved for Itdiv iterations, then
	Diversify population
(11)	Adjust penalty parameters for infeasibility
	end while
	Return best feasible solution