Ant colonies for the travelling salesman problem

Balas, E., Ceria, S. and Cornuéjols, G., 1993, A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58, 295–324.

Beckers, R., Deneubourg, J.L. and Goss, S., 1992, Trails and U-turns in the selection of the shortest path by the ant Lasius niger. J. Theor. Bio., 159, 397–415.

Bersini, H., Oury, C. and Dorigo, M., 1995, Hybridization of Genetic Algorithms. Tech. Rep. No. IRIDIA 95-22, IRIDIA, Université Libre de Bruxelles, Belgium.

Bolondi, M. and Bondanza, M., 1993, Parallelizzazione di un algoritmo per la risoluzione del problema del commesso viaggiatore. Masters thesis, Politecnico di Milano, Italy.

Croes, G.A., 1958, A method for solving traveling salesman problems. Oper. Res., 6, 791–812.

Dorigo, M. and Gambardella, L.M., 1996, A study of some properties of Ant-Q, in: Proc. PPSN IV—4th Int. Conf. on Parallel Problem Solving From Nature, H.-M. Voigt, W. Ebeling, I. Rechenberg and H.-S. Schwefel (eds.) (Springer-Verlag, Berlin) pp. 656–665.

Dorigo, M., Maniezzo, V. and Colorni, A., 1996, The ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst., Man Cybern. Part B, 26, 29–41.

Durbin, R. and Willshaw, D., 1987, An analogue approach to the travelling salesman problem using an elastic net method. Nature, 326, 689–691.

Eilon, S., Watson-Gandy, C.D.T. and Christofides, N., 1969, Distribution management: mathematical modeling and practical analysis. Oper. Res. Q., 20, 37–53.

Fischetti, M. and Toth, P., 1992, An additive bounding procedure for the asymmetric travelling salesman problem. Math. Program., 53, 173–197.

Fischetti, 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.

Fleurent, C. and Ferland, J., 1994, Genetic hybrids for the quadratic assignment problem, in: DIMACS Series in Discrete Mathematics and Theorical Computer Science, Vol. 16, pp. 173–187.

Fogel, D., 1993, Applying evolutionary programming to selected traveling salesman problems. Cybern. Syst. Int. J., 24, 27–36.

Gambardella, L.M. and Dorigo, M., 1995, Ant-Q: a reinforcement learning approach to the traveling salesman problem, in: Proc. ML-95, 12th Int. Conf. on Machine Learning, A. Prieditis and S. Russell (eds.) (Morgan Kaufmann, San Francisco, CA) pp. 252–260.

Gambardella, L.M., Taillard, E. and Dorigo, M., 1997, Ant colonies for QAP. Tech. Rep. No. IDSIA.97-4, IDSIA, Lugano, Switzerland.

Golden, 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.

Goss, S., Aron, S., Deneubourg, J.L. and Pasteels, J.M., 1989, Self-organized shortcuts in the Argentine ant. Naturwissenschaften, 76, 579–581.

Hölldobler, B. and Wilson, E.O., 1990, The Ants (Springer-Verlag, Berlin).

Johnson, 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).

Li, Y., Pardalos, P.M. and Resende, M.G.C., 1994, A greedy randomized adaptive search procedure for the quadratic assignment problem, in: Quadratic Assignment and Related Problems, P.M. Pardalos and H. Wolkowicz (eds.) (DIMACS Series, American Mathematical Society, Rhode Island) pp. 237–261.

Lin, F.-T., Kao, C.-Y. and Hsu, C.-C., 1993, Applying the genetic approach to simulated annealing in solving some NP-hard problems. IEEE Trans. Syst., Man Cybern., 23, 1752–1767.

Lin, S. and Kernighan, B.W., 1973, An effective heuristic algorithm for the TSP. Oper. Res., 21, 498–516.

Oliver, 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.

Potvin, J-Y., 1993, The traveling salesman problem: a neural network perpective. ORSA J. Comput., 5 (4), 328–347.

Reinelt, G., 1994, The Traveling Salesman: Computational Solutions for TSP Applications (Springer-Verlag, Berlin).

Taillard, E., 1991, Robust taboo search for the quadratic assignment problem. Parallel Comput., 17, 443–455.

Watkins, C.J.C.H. and Dayan, P., 1992, Technical note: Q-learning. Mach. Learning, 8, 279–292.

Whitley, 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.