A generative evolutionary algorithm is used to evolve weighted personal contact networks that represent physical contact between individuals, and thus possible paths of infection during an epidemic. The evolutionary algorithm evolves a list of edge-editing operations applied to an initial graph. Two initial graphs are considered, a ring graph and a power-law graph. Different probabilities of infection and a wide range of weights are considered, which improve performance over other work. Modified edge operations are introduced, which also improve performance. It is shown that when trying to maximize epidemic duration, the best results are obtained when using the ring graph as the initial graph. When attempting to match a given epidemic profile, similar results are obtained when using either initial graph, but both improve performance over other work.