Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics.
Conference Proceeding
Ross, P., Marin-Blazquez, J. G., Schulenburg, S. & Hart, E. (2003)
Learning a procedure that can solve hard bin-packing problems: a new GA-based approach to hyperheuristics
The idea underlying hyper-heuristics is to discover some
combination of familiar, straightforward heuristics that performs very well across a whole range of problems. To be wo...
Hyper-heuristics: learning to combine simple heuristics in bin-packing problems.
Conference Proceeding
Ross, P., Schulenburg, S., Marin-Blazquez, J. G. & Hart, E. (2002)
Hyper-heuristics: learning to combine simple heuristics in bin-packing problems. ISBN 1558608788
Evolutionary algorithms (EAs) often appear to be a ‘black box’, neither offering worst-case bounds nor any guarantee of optimality when used to solve individual problems. They...
Improving street based routing using building block mutations.
Conference Proceeding
Urquhart, N. B., Ross, P., Paechter, B., & Chisholm, K. (2002)
Improving street based routing using building block mutations. In J. Gottlieb, E. Hart, & S. Cagnoni (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN Kinsale, Ireland, April 3–4, 2002 Proceedings. , (189-202). https://doi.org/10.1007/3-540-46004-7_33
Street based routing (SBR) is a real-world inspired routing problem that builds routes within an urban area for mail deliveries. The authors have previously attempted to solve...
GAVEL - a new tool for genetic algorithm visualization
Journal Article
Ross, P., Hart, E., & Ross, P. (2000)
GAVEL - a new tool for genetic algorithm visualization. IEEE Transactions on Evolutionary Computation, 5(4), 335-348. doi:10.1109/4235.942528
Abstract—This paper surveys the state of the art in evolutionary algorithm visualization and describes a new tool called GAVEL. It provides a means to examine in a generationa...
Street-based routing using an evolutionary algorithm
Conference Proceeding
Urquhart, N. B., Paechter, B., & Chisholm, K. (2001)
Street-based routing using an evolutionary algorithm. In E. J. W. Boers, J. Gottlieb, P. L. Lanzi, R. E. Smith, S. Cagnoni, E. Hart, …H. Tijink (Eds.), Applications of Evolutionary Computing: EvoWorkshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Proceedings. , (495-504). https://doi.org/10.1007/3-540-45365-2_51
Much research has been carried out into solving routing problems using both Evolutionary Techniques and other methods. In this paper the authors investigate the usage of an Ev...
Optimising an evolutionary algorithm for scheduling
Conference Proceeding
Urquhart, N. B., Chisholm, K., & Paechter, B. (2000)
Optimising an evolutionary algorithm for scheduling. In S. Cagnoni, R. Poli, G. D. Smith, D. Corne, M. Oates, E. Hart, …T. C. Fogarty (Eds.), Real-World Applications of Evolutionary Computing: EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoRob, and EvoFlight, Proceedings. , (307-318). https://doi.org/10.1007/3-540-45561-2_30
This paper examines two techniques for setting the parameters of an evolutionary Algorithm (EA). The example EA used for test purposes undertakes a simple scheduling problem. ...