A new ant colony optimization approach for the orienteering problem

@article{Ke2008ANA,
  title={A new ant colony optimization approach for the orienteering problem},
  author={Liangjun Ke and Zuren Feng},
  journal={2008 7th World Congress on Intelligent Control and Automation},
  year={2008},
  pages={2027-2032}
}
In this paper, a novel ant colony optimization algorithm is proposed for the orienteering problem. This algorithm can adaptively choose the lower trail limit to avoid stagnation. To study its performance, we compare the proposed algorithm to max-min ant system with and without re-initialization. The experimental results demonstrate that the performance of our algorithm is competitive. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 18 REFERENCES

B.L.Golden, and E.A.Wasil, “A fast and effective heuristic for the orienteering problem,

  • I. M. Chao
  • Eur. J. Oper. Res.,
  • 1996
Highly Influential
6 Excerpts

A fast and effective heuristic for the orienteering problem

  • E. A. Wasil
  • Eur . J . Oper . Res .
  • 1998

and P

  • M. Fischetti, J. S. Gonzales
  • Toth, “Solving the orienteering problem through…
  • 1998
1 Excerpt

and J

  • Q. Wang, X. Sun, B. L. Golden
  • Jia, “Using artificial neural networks to solve…
  • 1995

Rosenwein, “Strong linear programming relaxations for the orienteering problem,

  • M.S.A.C. Leifer
  • Eur. J. Oper. Res.,
  • 1994
1 Excerpt

Similar Papers

Loading similar papers…