Prof. Éric Taillard

HEIG-VD,

University of Applied Sciences of Western Switzerland,

Route de Cheseaux 1, Case postale 521, CH-1401 Yverdon, Switzerland

Contact (anti-spam: replace the "x" by a "r")

Research domain: Parallel iterative searches, taboo search, ant system, adaptive memory programming, meta-heuristics, vehicle routing, location and allocation problems.

Publications

Problem instances

Presentations' slides

Association des professeurs de la HEIG

Codes

  • Basic C codes for the travelling salesman problem Discussed in "E. Taillard, Introduction aux métaheuristiques, 2015": Nearest Neighbour, Pilot, 2-opt, 3-opt, reduced 3-opt, Lin-Kernighan, GRASP, Simulated Annealing, noising method, FANT, Tabu Search, Memetic Algorithm, Path Relinking, Pareto Local Search. Only academic use allowed. Not for commercial use. Copyright: E. Taillard 2017
  • Fast ant system for the quadratic assignment problem
  • Robust taboo search procedure for the quadratic assignment problem (new, c)
  • Robust taboo search procedure for the quadratic assignment problem (old, c++)
  • Simulated annealing procedure for the quadratic assignment problem
  • QUALOPT & STAMP: Comparison of non-deterministic heuristic methods
  • PlanetSolar and bus parking demo
  • Last revision : 16. 3. 2018.