mtsp

A specific MTSP model which requires balanced workload is presented and a two stage solution method is introduced to solve the balance problem .

对任务均衡的多旅行商问题提出了一种模型描述方法，并采用两阶段法进行求解。

MTSP based optimal design of pipeline orientation design in water supply network

基于MTSP的给水管网定线优化设计

Finally , we develop our algorithm to solve MTSP and give the concrete method .

最后还将改进的算法进行适当推广，给出了求解多旅行商问题（MTSP）的具体步骤。

Solution to MTSP Based on Niche Genetic Algorithm

基于小生境遗传算法的MTSP问题求解

Based on real number code , it proposes a hybrid genetic algorithm to optimize the MTSP .

为了得到多旅行商问题的优化路线，提出一种基于实数编码的混合遗传算法。

The author regard it as MTSP problem for exploring the excellent tour route in various cases .

把在不同情况下寻找灾情最佳巡视路线的问题归结为在一定约束条件下求解最优多推销员回路问题，即MTSP问题。

The realization of MTSP-optimized solution verifies this algorithm to be allowed to apply the actual problem classification for MTSP .

多旅行商问题的优化求解的计算机模拟的实现，印证此算法可以应用到实际很多可以归结为多旅行商问题的实际求解。

This paper proposes a new GA chromosome and related operators for the MTSP and compares the theoretical properties and computational performance of the proposed technique to previous work .

现为解决MTSP问题给出了一种新的染色体设计和相关的处理方法，并与以往的理论设计和计算性能进行比较。

The MTSP is similar to the Traveling Salesperson Problem ( TSP ) with the added complication that each location may be visited by any one of the salespersons .

MTSP问题其实与单旅行商问题（TravelingSalespersonProblem，简称TSP）相似，但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条件，因而增加了问题复杂度。

To solve a kind of multiple traveling salesman problem ( MTSP ) for minimizing the completion time , a hierarchical genetic algorithm ( HGA ) and decoding method with matrix are proposed .

为了解决最小化旅行时间的多旅行商一类问题，提出了一种递阶遗传算法和矩阵解码方法。

The planar location problem of MTSP center is studied , the fuzzy synthetic method is given to solve the one site of location problem , the validity and improvementof the fuzzy synthetic method is also studied .

给出了应用模糊综合评价的方法来研究单一设施选址问题的模型和应用实例，并对模糊综合评价算法的有效性及其改进方法进行了研究。

A new method of transforming Multiple Travelling Salesmen Problem to the Standard Travelling Salesmen problem is proposed . Principles and methods for solving MTSP by neural metworks are discussed . Simulation results by computer show that the methed is very efficient .

本文提出了把MTSP转化成标准TSP的方法，讨论了用神经网络的原理和方法解决它，计算机模拟结果表明该方法十分有效。

Different from the optimization method based on MTSP , it need not determinate the number of rolling cycles . The makeup characteristic of rolling cycles is applied in this method , and the number of rolling cycles is optimized during the makeup optimization .

与MTSP方法不同，该方法在优化时不需预先确定轧制单位的数目，它充分利用了轧制单位的结构特点，在对轧制计划优化的同时，优化了轧制单位的数目。