The article presents a proposed customized genetic algorithm (CGA) to find the Pareto frontier for bi-objective integer linear programming (ILP) model of routing in dynamic network, where number nodes and edge weights vary over time. Utilizing hybrid method, CGA combines with (DP); it is fast alternative an ILP solver finding efficient solutions, particularly large dimensions. A non-dominated s...