Hybrid Genetic Algorithms for the Asymmetric Distance-Constrained Vehicle Routing Problem

Algorithm 1

Initial population creation algorithm.

	Input: , , .
	Output: Population of chromosomes.
	fortodo
	Set first city .
	Current chromosome contains only “city 1.”
	Prepare a list of remaining cities except dummy cities.
	fortodo
	Select a city (suppose city q) randomly from the list of remaining cities.
	If the distance of the route of present vehicle is less than or equal to , then add it to the current chromosome and then remove it from the list to make sure that it is not repeated.
	If the distance of the route greater than then add a dummy depot (city q).
	Rename the “city q” as “city p” and continue.
	end for
	end for
	Improve the population by 2-opt local search
	Return the population