It can be bought in the SDU bookstore. Cost: 539,00 DKK.
A web-site is maintained with material from the book. It can be
accessed from here.
T. Schiavinotto and T. Stützle. A review of metrics on permutations for search landscape analysis. Computers and Operation Research. 2006. In Press.
J.J. Bentley. Fast Algorithms for Geometric Traveling Salesman Problems. Journal on Computing, 1992, vol. 4, issue 4, pp. 387-411.
M. Chiarandini, I. Dumitrescu, and T. Stützle. Stochastic local search algorithms for the graph colouring problem. Technical Report AIDA-05-03, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany, September 2005. [.pdf]
F. Glover, M. Laguna and R. Martí. Fundaments of Scatter Search and Path Relinking. Control and Cybernetics, Volume 29, Number 3, pp. 653-684, 2000. [pdf]
Pelikan, M., Goldberg, D.E., Lobo, F. A Survey of Optimization by Building and Using Probabilistic Models. Tec. Rep. 99018. Illinois Genetic Algorithms Laboratory, University of Illinois. 1999.
P.T. de Boer, D. Kroese, S. Mannor and R.Y. Rubinstein. A Tutorial on the Cross-Entropy Method. 2003.
A. Hertz and M. Widmer. Guidelines for the use of meta-heuristics in combinatorial optimization. European Journal of Operational Research 151 (2003) 247-252.
E. Taillard. Some efficient heuristic methods for the flow shop sequencing problem. Journal of Operational Research. 1990. 47(1), 65-74.
E. Nowicki and C. Smutnicki. A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 1996, 91(1), 160-175
P. Toth and D. Vigo. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. 2002.
M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, Vol. 35 Issue 2, pp 254, 12p. 1987.
O. Bräysy. Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science, 2005, vol. 39, issue 1, p 104.
R.L. Rardin, R. Uzsoy: Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial. Journal of Heuristics 7(3): 261-304 (2001).
M. Birattari, M. Zlochin, and M. Dorigo. (2005) Towards a Theory of Practice in Metaheuristics Design. A Machine Learning Perspective. Technical Report TR/IRIDIA/2005-030. IRIDIA, Université Libre de Bruxelles, Brussels, Belgium. Available from the author's webpage.
M. Birattari, T. Stützle, L. Paquete, and K. Varrentrapp. (2002) A Racing Algorithm for Configuring Metaheuristics. In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 11-18. Morgan Kaufmann, San Francisco, CA, USA. Available from the author's webpage.
William H. Press. Random Numbers. In Numerical Recipes in C. Cornell University. (online edition)
Staff Scheduling and Rostering: Theory and Applications. Special Issue of Annals of Operations Research, Volumes 128-129, 2004