约束最优路线问题的模拟退火解法

The Simulant Annealing Solution about Problem of Restricted Shortest Path Problem

本文以 1998年全国大学生数模竞赛中的 B题 (即“灾情巡视路线”)为例 ,介绍一种最优路线问题的方法——模拟退火法 [1] .该法对旅行推销员、中国邮递员等问题 ,即使有约束条件 ,也能求得较好的近似解 。

Taking problem B from the 98′ mathmatical contest in modeling of undergraduate of chian as a example,the article introduces a kind of means simulant annealing solution,to doing with the shortest path question.The means can get bester approximate solution about the trip bagman,china postman etc,only if there exists constraints.At the same time,it can be run in a general range.It can be extended too.