摘要
旅行售货员位置问题在组合优化中是非常困难的问题之一，由于它的困难（它涉及到族行售货员问题和位置问题双重问题）这个问题一直引起人们极大关注，然而多于一人的旅行售货员问题还没有去探讨。
The travelling salesman location problem is one of extremely difficult problems in combinatorial optimization.Due to its difficulty (it involves simutaneously solutions of both travelling salesman problems and location problems) the problem has attracted limited attention so far.The problem with more than one travelling salesmen has not been inves tigated yet.In this paper we develop an O(n 4) algorithm for solving the problem with two travelling salesmen on a straight line.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
1998年第3期20-25,共6页
Systems Engineering-Theory & Practice
