An optimized genetic routing approach for constrained shortest path selections

摘要: This paper presented a new methodology to determine the population, set of feasible paths, chromosomes genetic algorithms (GA) given multi-constraints, i.e., distance, deadline, and budget, in shortest path modified vehicle routing problem. Several aspects GA have been explored optimized including population generation, crossover, mutation, ranking, selection criteria. Our optimization proposal was evaluated with benchmark instances compared other heuristics literature resulting outstanding performance terms quality computational time complexity heterogeneous network sizes.