Optimization of a Semiflexible Demand-Responsive Feeder System in Suburban Areas Using a Memetic Algorithm

Algorithm 4

Mutation operation for new solutions.

	Start:
	mutation probability = Random number between (0, 100)
	If mutation probability ≤ 5:
	Choose mutation size: small or large
	If small:
	Choose a random line from solution
	Select a random route in the pool of routes for this line
	max departure time = operation period time–route length
	bus departure = random time between (0, max departure time)
	If large:
	For each line in set of lines:
	Select a random route in the pool of routes for this line
	max departure time = operation period time–route length
	bus departure = random time between (0, max departure time)
	Return Solution