A Hyper-Heuristic classifier for one dimensional bin packing problems: Improving classification accuracy by attribute evolution.
Conference Proceeding
Sim, K., Hart, E., & Paechter, B. (2012)
A Hyper-Heuristic classifier for one dimensional bin packing problems: Improving classification accuracy by attribute evolution. In Parallel Problem Solving from Nature: PPSN XII, (348-357). https://doi.org/10.1007/978-3-642-32964-7_35
A hyper-heuristic for the one dimensional bin packing problem is presented that uses an Evolutionary Algorithm (EA) to evolve a set of attributes that characterise a problem i...
Solving optimal pump control problem using max-min ant system.
Conference Proceeding
Lopez-Ibanez, M., Prasad, T. D., & Paechter, B. (2007)
Solving optimal pump control problem using max-min ant system. In GECCO '07 Proceedings of the 9th annual conference on Genetic and evolutionary computation, (176-176). https://doi.org/10.1145/1276958.1276990
Finding feasible timetables using group-based operators.
Journal Article
Lewis, R. M. R. & Paechter, B. (2007)
Finding feasible timetables using group-based operators. IEEE Transactions on Evolutionary Computation. 11, 397-413. doi:10.1109/TEVC.2006.885162. ISSN 1089-778X
This paper describes the applicability of the so-called "grouping genetic algorithm" to a well-known version of the university course timetabling problem. We note that there a...
Metaheuristics for university course timetabling.
Book Chapter
Lewis, R. M. R., Paechter, B., & Rossi-Doria, O. (2007)
Metaheuristics for university course timetabling. In K. Dahal, K. Chen Tan, & P. Cowling (Eds.), Evolutionary Scheduling, (237-272). Berlin / Heidelberg: Springer. https://doi.org/10.1007/978-3-540-48584-1_9
In this chapter we consider the NP-complete problem of university
course timetabling. We note that it is often difficult to gain a deep understanding
of these sorts of problem...
A tabu search evolutionary algorithm for solving constraint satisfaction problems.
Conference Proceeding
Craenen, B. G. W., & Paechter, B. (2006)
A tabu search evolutionary algorithm for solving constraint satisfaction problems. In Parallel Problem Solving from Nature - PPSN IX. , (152-161). https://doi.org/10.1007/11844297_16
The paper introduces a hybrid Tabu Search-Evolutionary Algorithm for solving the constraint satisfaction problem, called STLEA. Extensive experimental fine-tuning of parameter...
Multi-Objective Optimisation of the Pump Scheduling Problem using SPEA2.
Conference Proceeding
Lopez-Ibanez, M., Devi Prasad, T., & Paechter, B. (2005)
Multi-Objective Optimisation of the Pump Scheduling Problem using SPEA2. https://doi.org/10.1109/CEC.2005.1554716
Significant operational cost and energy savings can be achieved by optimising the schedules of pumps, which pump water from source reservoirs to storage tanks, in water distri...
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...
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...
A framework for distributed evolutionary algorithms.
Conference Proceeding
Arenas, M. G., Collet, P., Eiben, A. E., Jeasity, M., Merelo Guervós, J. J., Paechter, B., …Schoenauer, M. (2002)
A framework for distributed evolutionary algorithms. In 7th International Conference, Granada, Spain, September 7-11, 2002, Proceedings, 665-675
This paper describes the recently released DREAM (Distributed Resource Evolutionary Algorithm Machine) framework for the automatic distribution of evolutionary algorithm (EA) ...
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...