When a port is closed emergently, ships which were assigned to closed port should be assigned to another open port. The ship detour routing problem is to reduce the sum of transportation cost, port loading and unloading cost and delay cost. Heuristic algorithms are designed to solve the ship detour routing problem. For the initial solution, the dumpy port strategy(D) and the minimum adding cost strategy(C) are used. For the local search, the port change strategy(P) and the ship change strategy(S) are used. Six heuristic algorithms which are AlgC, AlgCP, AlgCPS, AlgCS, AlgDP and AlgDPS are programmed. Twenty test problem are generated by random number and tested by computer program. Experimental results show that AlgCPS and AlgCS have good performance for the objective value and the calculation time of AlgDP is the best.