Improving vehicle routing using a customer waiting time colony.
Conference Proceeding
Sa'adah, S., Ross, P., & Paechter, B. (2004)
Improving vehicle routing using a customer waiting time colony. In J. Gottlieb, & G. Raidl (Eds.), Evolutionary Computation in Combinatorial Optimization, 188-198. https://doi.org/10.1007/978-3-540-24652-7_19
In the vehicle routing problem with time windows (VRPTW), there are two main objectives. The primary objective is to reduce the number of vehicles, the secondary one is to min...
A role for immunology in 'next generation' robots.
Conference Proceeding
Hart, E., Ross, P., Webb, A., & Lawson, A. (2003)
A role for immunology in 'next generation' robots. In J. Timmis, P. Bentley, & E. Hart (Eds.), Artificial Immune Systems. ICARIS 2003, 46-56. https://doi.org/10.1007/978-3-540-45192-1_5
Much of current robot research is about learning tasks in which the task to be achieved is pre-specified, a suitable technology for the task is chosen and the learning process...
Controlling a simulated Khepera with an XCS classifier system with memory.
Conference Proceeding
Webb, A., Hart, E., Ross, P. & Lawson, A. (2003)
Controlling a simulated Khepera with an XCS classifier system with memory. ISBN 9783540200574
Autonomous agents commonly suffer from perceptual aliasing in which differing situations are perceived as identical by the robots sensors, yet require different courses of act...
Requirements for getting a robot to grow up.
Conference Proceeding
Ross, P., Hart, E., Lawson, A., Webb, A., Prem, E., Poelz, P. & Morgavi, G. (2003)
Requirements for getting a robot to grow up. ISBN 9783540200574
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...
Solving a real world routing problem using evolutionary agents.
Conference Proceeding
Urquhart, N. B., Ross, P., Paechter, B. & Chisholm, K. (2002)
Solving a real world routing problem using evolutionary agents. ISBN 3540441395
This paper investigates the solving of a real world routing problem using evolutionary algorithms embedded within a Multi-agent system (MAS). An architecture for the MAS is pr...
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...