New Ideas for Applying Ant Colony Optimization to the Probabilistic TSP

@inproceedings{Branke2003NewIF,
  title={New Ideas for Applying Ant Colony Optimization to the Probabilistic TSP},
  author={Juergen Branke and Michael Guntsch},
  booktitle={EvoWorkshops},
  year={2003}
}
The Probabilistic Traveling Salesperson Problem (PTSP) is a stochastic variant of the Traveling Salesperson Problem (TSP); each customer has to be serviced only with a given probability. The goal is to find an a priori tour with shortest expected tour-length, with the customers being served in the specified order and customers not requiring service being skipped. In this paper, we use the Ant Colony Optimization (ACO) metaheuristic to construct solutions for PTSP. We propose two new heuristic… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 18 CITATIONS

Solving the Probabilistic TSP with Ant Colony Optimization

  • J. Math. Model. Algorithms
  • 2004
VIEW 3 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

ROBOT PATH PLANNING USING OPTIMIZATION TECHNIQUES

Dr. Srinivas Kolachina, Dr. K. Bhavana Raj, Ch. Sandeep Reddy
  • 2018
VIEW 1 EXCERPT
CITES METHODS

References

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

The ant system: Optimization by a colony of cooperating agents

A. Colorni M. Dorigo, V. Maniezzo
  • IEEE Transactions on Systems, Man, and Cybernetics,
  • 1996
VIEW 1 EXCERPT

Gavioli . Aspects of heuristic methods in the probabilistic traveling salesman problem

G. Andreatta, F. Mason, P. Serani
  • Advanced School on Stochastics in Combinatorial Optimization , World Scientic , Singapore
  • 1987

Similar Papers

Loading similar papers…