A method for optimizing energy savings and reducing cycle time with mutation of an industrial robotic initial path when a collision is detected, the method performed by a data processing system and comprising: a) initializing a plurality of clone paths where the collision was detected and initializing a stop condition, wherein a clone path is a clone of the industrial robotic initial path and the industrial robotic initial path comprises a source location, a plurality of intermediate locations, and a target location; b) until the stop condition occurs, determining a candidate path to store in a population by repeating the following steps c1)-c7) for each clone path: c1) applying a plurality of mutations to the selected clone path, wherein applying the plurality of mutations comprises moving intermediate locations, removing intermediate locations, or adding intermediate locations; c2) generating a graph with a plurality of zone permutation vertices for each of the plurality of intermediate locations of the selected clone path and a plurality of rating edges between each zone permutation vertex of consecutive locations, c3) wherein each of the plurality of zone permutation vertices has a radius one increment larger than a previous zone permutation vertex; c4) simulating robotic movement for each of the candidate paths to determine values for the rating edges, wherein the value of the rating edges is based on an energy consumption and a cycle time for the candidate path; c5) removing the candidate path when a collision is detected; c6) calculating a breed rating for each of a plurality of candidate paths, wherein the breed rating comprises a summation of the rating edges for the candidate path being dependent on the energy consumption and the cycle time for the respective candidate path; and c7) storing in the population the candidate path possessing the lowest breed rating; and d) determining an optimal breed comprising the candidate path with an optimal rating, wherein the optimal rating is determined by the smallest breed rating in the population; and e) operating a robot using the optimal breed. a) initializing a plurality of clone paths where the collision was detected and initializing a stop condition, wherein a clone path is a clone of the industrial robotic initial path and the industrial robotic initial path comprises a source location, a plurality of intermediate locations, and a target location; b) until the stop condition occurs, determining a candidate path to store in a population by repeating the following steps c1)-c7) for each clone path: c1) applying a plurality of mutations to the selected clone path, wherein applying the plurality of mutations comprises moving intermediate locations, removing intermediate locations, or adding intermediate locations; c2) generating a graph with a plurality of zone permutation vertices for each of the plurality of intermediate locations of the selected clone path and a plurality of rating edges between each zone permutation vertex of consecutive locations, c3) wherein each of the plurality of zone permutation vertices has a radius one increment larger than a previous zone permutation vertex; c4) simulating robotic movement for each of the candidate paths to determine values for the rating edges, wherein the value of the rating edges is based on an energy consumption and a cycle time for the candidate path; c5) removing the candidate path when a collision is detected; c6) calculating a breed rating for each of a plurality of candidate paths, wherein the breed rating comprises a summation of the rating edges for the candidate path being dependent on the energy consumption and the cycle time for the respective candidate path; and c7) storing in the population the candidate path possessing the lowest breed rating; and c1) applying a plurality of mutations to the selected clone path, wherein applying the plurality of mutations comprises moving intermediate locations, removing intermediate locations, or adding intermediate locations; c2) generating a graph with a plurality of zone permutation vertices for each of the plurality of intermediate locations of the selected clone path and a plurality of rating edges between each zone permutation vertex of consecutive locations, c3) wherein each of the plurality of zone permutation vertices has a radius one increment larger than a previous zone permutation vertex; c4) simulating robotic movement for each of the candidate paths to determine values for the rating edges, wherein the value of the rating edges is based on an energy consumption and a cycle time for the candidate path; c5) removing the candidate path when a collision is detected; c6) calculating a breed rating for each of a plurality of candidate paths, wherein the breed rating comprises a summation of the rating edges for the candidate path being dependent on the energy consumption and the cycle time for the respective candidate path; and c7) storing in the population the candidate path possessing the lowest breed rating; and d) determining an optimal breed comprising the candidate path with an optimal rating, wherein the optimal rating is determined by the smallest breed rating in the population; and e) operating a robot using the optimal breed.