Heuristic ordered crossover operator for TSP
Peng Zhou · Jisuanji gongcheng yu sheji · 2007
Traveling salesman problem is one of the typical NP-hard problems in combinatorial optimization.Ordered crossover operator is a kind of in common use genetic crossover operator to solve traveling salesman problem.But when ordered crossover operator is used,the points of intersection are specified randomly.The points can't reflect the key genetic information and cause the calculate way efficiency is lowly.Based on ordered crossover operator,a new heuristic ordered crossover operator is presented.It combines ordered crossover operator and heuristic algorithm in order to get the position of cut points in parent,thereby key order information from parent is saved.This improved operator can overcome the shortcoming of low efficiency in ordered crossover operator.The optimization computing of some examples is made to show that the new operator is useful and simple.