Evolutionary simulated annealing with application to tournament traveling problem
No Thumbnail Available
Date
2009
Authors
Adewole, A.P.
Ejide, F.O
Journal Title
Journal ISSN
Volume Title
Publisher
Journal of Computer Science and its Applications
Abstract
This paper describes evolutionary simulated annealing approach to the solution of TTP that includes both feasible and infeasible schedules. The approach uses a large neighbourhood with complex moves and includes techniques such as perturb, pervert and score t balance the exploration of the feasible and infeasible regions and to escape local minimal at very low temperatures. Experimental results show that, in practical cases, the optimal solution can be found in reasonable time, for small instances of n.
Description
Staff publications
Keywords
Neighbourhood , Perturb , Pervert , Scheduling , Score , Simulated Annealing , Tournament , Round-Robin , Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science
Citation
Adewole, A. P., and Ejide, F.O. (2009). Evolutionary simulated annealing with application to tournament traveling problem. Journal of Computer Science and its Applications, Vol.16: 61-67pp.