Foreword

The genetic algorithm, as being one of the most promising heuristics, is in the focus of our discussion. Programming and fune tuning of the evolutionary heuristics, as we refer to, is a very problem specific issue. First we will adress the Travelling Salesman Problem, a well-known issue in the literature, yet, provoking curiousity of many researchers. For a set of artificially generated instances, we will compare the exact and the solution obtained by approximation. And then, we will look into some aspects of commercial implementation of the problem. Not only the solutions should be feasible, but also of a high quality.