Evolutionary simulated annealing with application to tournament traveling problem
| dc.contributor.author | Adewole, A.P. | |
| dc.contributor.author | Ejide, F.O | |
| dc.date.accessioned | 2019-09-10T08:36:34Z | |
| dc.date.available | 2019-09-10T08:36:34Z | |
| dc.date.issued | 2009 | |
| dc.description | Staff publications | en_US |
| dc.description.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. | en_US |
| dc.identifier.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. | en_US |
| dc.identifier.uri | https://ir.unilag.edu.ng/handle/123456789/5434 | |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Computer Science and its Applications | en_US |
| dc.relation.ispartofseries | Journal of Computer Science and its Applications;Vol.16 | |
| dc.subject | Neighbourhood | en_US |
| dc.subject | Perturb | en_US |
| dc.subject | Pervert | en_US |
| dc.subject | Scheduling | en_US |
| dc.subject | Score | en_US |
| dc.subject | Simulated Annealing | en_US |
| dc.subject | Tournament | en_US |
| dc.subject | Round-Robin | en_US |
| dc.subject | Research Subject Categories::TECHNOLOGY::Information technology::Computer science::Computer science | en_US |
| dc.title | Evolutionary simulated annealing with application to tournament traveling problem | en_US |
| dc.type | Article | en_US |