中文摘要：

设计了一种基于双重局部搜索策略的Memetic算法用于求解带有时间约束的旅行商问题.在基本遗传操作中,分别采用顺序交叉算子和交换变异算子,同时在每次交叉和变异后均通过随机数来决定是采用贪婪倒位变异算子还是采用递归弧插入算子进行局部搜索优化.实例仿真分析表明该算法快速高效,并且具有很好的鲁棒性.

英文摘要：

The Memetic algorithm based on two local is proposed to solve the traveling salesman problem（TSP） with time restraints.During the basic genetic operation,it introduced order crossover and two-block-exchange mutation,then after each operation,it adopted greed recessive variation or recursive arc insertion by the random parameter.Experimental results demonstrate the high efficiency and robust stability of the proposed algorithm.