This paper develops an ant colony optimization approach to the orienteering problem , a general version of the well - known traveling salesman problem with many relevant applications in industry 摘要本研究發(fā)展一蟻群最佳化演算法求解越野賽跑問題,此問題可被視為一廣義之? ?推銷員問題,其應(yīng)用?圍極為廣泛。
In contrast to conventional optimization algorithms whose iterates are computed and analyzed deterministically , randomized methods rely on stochastic processes and random number / vector generation as part of the algorithm and / or its analysis 傳統(tǒng)的最佳化演算法中迭代的計(jì)算和分析是確定的,與之相比,隨機(jī)方法依靠隨機(jī)過程和亂數(shù)字/向量的生成作為演算法和(或)演算法分析的一部分。