Reference health
Ant colonies for the travelling salesman problem
01708-5/badge.svg){kind=icon}
18/18 checkable references clean · checked 2026-07-24
Every reference with a DOI in the deposited reference list resolved to a known work in Crossref or DataCite at the dated check, and none carried a retraction, withdrawal, or removal notice.
10 without a DOI — not checked. A reference deposited without a DOI is never matched by title or guessed at; it stays outside the checked set, and this line discloses that.
The 18 checked references that resolve
resolves10.1016/S0022-5193(05)80686-1
Trails and U-turns in the selection of a path by the ant Lasius niger
resolves10.1038/326689a0
An analogue approach to the travelling salesman problem using an elastic net method
resolves10.1007/BF01585701
An additive bounding procedure for the asymmetric travelling salesman problem
resolves10.1080/01969729308961697
APPLYING EVOLUTIONARY PROGRAMMING TO SELECTED TRAVELING SALESMAN PROBLEMS
resolves10.1016/B978-1-55860-377-6.50039-6
Ant-Q: A Reinforcement Learning approach to the traveling salesman problem
resolves10.1090/dimacs/016/12
A greedy randomized adaptive search procedure for the quadratic assignment problem
resolves10.1109/21.257766
Applying the genetic approach to simulated annealing in solving some NP-hard problems
resolves10.1287/ijoc.5.4.328
State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
The 10 references without a DOI — listed, not checked
no DOI — not checkedBersini, H., Oury, C. and Dorigo, M., 1995, Hybridization of Genetic Algorithms. Tech. Rep. No. IRIDIA 95-22, IRIDIA, Université Libre de Bruxelles, Belgium.
no DOI — not checkedBolondi, M. and Bondanza, M., 1993, Parallelizzazione di un algoritmo per la risoluzione del problema del commesso viaggiatore. Masters thesis, Politecnico di Milano, Italy.
no DOI — not checkedEilon, S., Watson-Gandy, C.D.T. and Christofides, N., 1969, Distribution management: mathematical modeling and practical analysis. Oper. Res. Q., 20, 37–53.
no DOI — not checkedFischetti, M. and Toth, P., 1994, A polyhedral approach for the exact solution of hard ATSP instances. Tech. Rep. No. OR-94, DEIS, Università di Bologna, Italy.
no DOI — not checkedGambardella, L.M., Taillard, E. and Dorigo, M., 1997, Ant colonies for QAP. Tech. Rep. No. IDSIA.97-4, IDSIA, Lugano, Switzerland.
no DOI — not checkedGolden, B. and Stewart, W., 1985, Empiric analysis of heuristics, in: The Traveling Salesman Problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy-Kan and D.B. Shmoys (eds.) (Wiley, New York) pp. 207–250.
no DOI — not checkedJohnson, D.S. and McGeoch, L.A., 1997. The travelling salesman problem: A case study in local optimization, in: Local Search in Combinatorial Optimization, E.H.L. Aarts and J.K. Lenstra (eds.) (Wiley, New York).
no DOI — not checkedOliver, I., Smith, D. and Holland, J.R., 1987, A study of permutation crossover operators on the travelling salesman problem, in: Proc. 2nd Int. Conf. on Genetic Algorithms, J.J. Grefenstette (ed.) (Lawrence Erlbaum, Hillsdale, New Jersey) pp. 224–230.
no DOI — not checkedReinelt, G., 1994, The Traveling Salesman: Computational Solutions for TSP Applications (Springer-Verlag, Berlin).
no DOI — not checkedWhitley, D., Starkweather, T. and Fuquay, D., 1989, Scheduling problems and travelling salesman: the genetic edge recombination operator, in: Proc. 3rd Int. Conf. on Genetic Algorithms, J.D. Schaffer (ed.) (Morgan Kaufmann, San Mateo, CA) pp. 133–140.
What this badge says. CiteStamped means the CHECKABLE references of this
work were clean at the dated check: each resolved to a known work in a public registry, and none
carried a retraction notice at that time. It says nothing about the quality, findings,
or importance of the work itself, and nothing about references deposited without a DOI.
checked 2026-07-24 — re-checked daily as this page is visited; titles and statuses come from Crossref and DataCite and are not part of the signed record
Embed this badge
Both snippets point at the live badge image and link back to this page. The badge re-renders from the daily check, so an embed never goes stale by more than a day of visits.
<a href="https://citestamp.com/citestamped/10.1016/s0303-2647(97)01708-5"><img src="https://citestamp.com/citestamped/10.1016/s0303-2647(97)01708-5/badge.svg" alt="CiteStamped reference-health badge" width="460" height="64"></a>
[01708-5/badge.svg)](https://citestamp.com/citestamped/10.1016/s0303-2647(97)01708-5)