摘要
配送 \收集旅行商问题 ( TSPD)是一类重要的组合优化问题 ,与车辆路径问题等有着密切的联系。但与传统的旅行商问题 ( TSP)相比 ,人们对该问题的研究有限 ,而且大多假定必须在完成所有的配送需求后 ,才服务收集需求。文中放松这一约束条件 ,在扩展 Metropolis接受准则的基础上 ,运用模拟退火算法求得该问题较好的结果。
Travelling Salesman Problem with Pickup and Delivery (TSPD) is an important problem in combinatorial optimization, which maintains close links with vehicle routing problems. Opposed to the classical Travelling Salesman Problem (TSP), research on TSPD is rather scarce, and assumption that pick ups are served after finishing all deliveries, is enforced. In the paper, the assumption is eliminated, and based on developed Metropolis rule, a particular simulated annealing is applied to solve the problem.
出处
《系统工程理论方法应用》
2002年第3期240-243,共4页
Systems Engineering Theory·Methodology·Applications
基金
国家自然科学基金资助项目 (7970 0 0 19
70 0 710 2 8)
