Darren Chitty
ABSTRACT
A Sequence-based Selection Hyper-Heuristic (SSHH) utilises a hidden Markov model (HMM) to generate sequences of low-level heuristics to apply to a given problem. The HMM represents learnt probabilistic relationships in transitioning from one heuristic to the next for generating good sequences. However, a single HMM will only represent one learnt behaviour pattern which may not be ideal. Furthermore, using a single HMM to generate sequences is sequential in manner but most processors are parallel in nature. Consequently, this paper proposes that the effectiveness and speed of SSHH can be improved by using multiple SSHH, an ensemble. These will be able to operate in parallel exploiting multi-core processor resources facilitating faster optimisation. Two methods of parallel ensemble SSHH are investigated, sharing the best found solution amongst SSHH instantiations or combining HMM information between SSHH models. The effectiveness of the methods are assessed using a real-world electric bus scheduling optimisation problem. Sharing best found solutions between ensembles of SSHH models that have differing sequence behaviours significantly improved upon sequential SSHH results with much lower run-times.
- Ekaterina Alekseeva, Mohand Mezmaz, Daniel Tuyttens, and Nouredine Melab. 2017. Parallel multi-core hyper-heuristic GRASP to solve permutation flow-shop problem. Concurrency and Computation: Practice and Experience 29, 9 (2017), e3835.Google Scholar
Cross Ref
- Alex R Bertels and Daniel R Tauritz. 2016. Why asynchronous parallel evolution is the future of hyper-heuristics: A cdcl sat solver case study. In Proceedings of the 2016 on genetic and evolutionary computation conference companion. 1359--1365.Google ScholarDigital Library
- Edmund K Burke, Michel Gendreau, Matthew Hyde, Graham Kendall, Gabriela Ochoa, Ender Özcan, and Rong Qu. 2013. Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society 64, 12 (2013), 1695--1724.Google ScholarCross Ref
- Darren M Chitty. 2021. A partially asynchronous global parallel genetic algorithm. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 1771--1778.Google ScholarDigital Library
- Darren M Chitty and Ed Keedwell. 2022. Defining a Quality Measure Within Crossover: An Electric Bus Scheduling Case Study. In Artificial Evolution, EA 2022. 97--110.Google Scholar
- Darren M Chitty, William B Yates, and Ed Keedwell. 2022. An edge quality aware crossover operator for application to the capacitated vehicle routing problem. In Proceedings of the Genetic and Evolutionary Computation Conference Companion. 419--422.Google ScholarDigital Library
- Peter Cowling, Graham Kendall, and Eric Soubeiga. 2000. A hyperheuristic approach to scheduling a sales summit. In International conference on the practice and theory of automated timetabling. Springer, 176--190.Google ScholarDigital Library
- Georges A Croes. 1958. A method for solving traveling-salesman problems. Operations research 6, 6 (1958), 791--812.Google Scholar
- Tansel Dokeroglu and Ahmet Cosar. 2016. A novel multistart hyper-heuristic algorithm on the grid for the quadratic assignment problem. Engineering Applications of Artificial Intelligence 52 (2016), 10--25.Google ScholarDigital Library
- Marco Dorigo and Luca Maria Gambardella. 1997. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on evolutionary computation 1, 1 (1997), 53--66.Google ScholarDigital Library
- John H Drake, Ahmed Kheiri, Ender Özcan, and Edmund K Burke. 2020. Recent advances in selection hyper-heuristics. European Journal of Operational Research 285, 2 (2020), 405--428.Google ScholarCross Ref
- Russell Eberhart and James Kennedy. 1995. A new optimizer using particle swarm theory. In Micro Machine and Human Science, 1995. MHS'95., Proceedings of the Sixth International Symposium on. IEEE, 39--43.Google ScholarCross Ref
- Mohammad Moein Fazeli, Yaghoub Farjami, and Mohsen Nickray. 2019. An ensemble optimisation approach to service composition in cloud manufacturing. International Journal of Computer Integrated Manufacturing 32, 1 (2019), 83--91.Google ScholarCross Ref
- John J Grefenstette. 1981. Parallel adaptive algorithms for function optimization. Vanderbilt University, Nashville, TN, Tech. Rep. CS-81-19 (1981).Google Scholar
- Lars Kai Hansen and Peter Salamon. 1990. Neural network ensembles. IEEE transactions on pattern analysis and machine intelligence 12, 10 (1990), 993--1001.Google ScholarDigital Library
- John H Holland. 1975. Adaptation in natural and artificial systems: An introductory analysis with applications to biology, control, and artificial intelligence. U Michigan Press.Google Scholar
- Baldomero Imbernón, Antonio Llanes, José-Matías Cutillas-Lozano, and Domingo Giménez. 2020. HYPERDOCK: Improving virtual screening through parallel hyperheuristics. The International Journal of High Performance Computing Applications 34, 1 (2020), 30--41.Google ScholarDigital Library
- Ahmed Kheiri and Ed Keedwell. 2017. A hidden markov model approach to the problem of heuristic selection in hyper-heuristics with a case study in high school timetabling problems. Evolutionary computation 25, 3 (2017), 473--501.Google Scholar
- Coromoto León, Gara Miranda, and Carlos Segura. 2009. Hyperheuristics for a dynamic-mapped multi-objective island-based model. In Distributed Computing, Artificial Intelligence, Bioinformatics, Soft Computing, and Ambient Assisted Living: 10th International Work-Conference on Artificial Neural Networks, IWANN 2009 Workshops, Salamanca, Spain, June 10--12, 2009. Proceedings, Part II 10. Springer, 41--49.Google Scholar
- Helena R Lourenço, Olivier C Martin, and Thomas Stützle. 2003. Iterated local search. In Handbook of metaheuristics. Springer, 320--353.Google Scholar
- Helena Ramalhinho Lourenço, Olivier C Martin, and Thomas Stützle. 2019. Iterated local search: Framework and applications. In Handbook of metaheuristics. Springer, 129--168.Google Scholar
- David Meignan. 2011. An evolutionary programming hyper-heuristic with co-evolution for CHeSC11. In The 53rd Annual Conference of the UK Operational Research Society (OR53), Vol. 3.Google Scholar
- Mustafa Misir, Katja Verbeeck, Patrick De Causmaecker, and Greet Vanden Berghe. 2011. A new hyper-heuristic implementation in HyFlex: a study on generality. In Proceedings of the 5th Multidisciplinary International Scheduling Conference: Theory & Application. 374--393.Google Scholar
- Gabriela Ochoa, Matthew Hyde, Tim Curtois, Jose A Vazquez-Rodriguez, James Walker, Michel Gendreau, Graham Kendall, Barry McCollum, Andrew J Parkes, Sanja Petrovic, et al. 2012. Hyflex: A benchmark framework for cross-domain heuristic search. In Evolutionary Computation in Combinatorial Optimization: 12th European Conference, EvoCOP 2012, Málaga, Spain, April 11--13, 2012. Proceedings 12. Springer, 136--147.Google ScholarDigital Library
- Paola P Oteiza, Juan I Ardenghi, and Nélida B Brignole. 2021. Parallel hyperheuristics for process engineering optimization. Computers & Chemical Engineering 153 (2021), 107440.Google ScholarCross Ref
- Petr Pospichal, Jiri Jaros, and Josef Schwarz. 2010. Parallel genetic algorithm on the cuda architecture. In Applications of Evolutionary Computation: EvoApplicatons 2010: EvoCOMPLEX, EvoGAMES, EvoIASP, EvoINTELLIGENCE, EvoNUM, and EvoSTOC, Istanbul, Turkey, April 7--9, 2010, Proceedings, Part I. Springer, 442--451.Google ScholarDigital Library
- Prapa Rattadilok, Andy Gaw, and Raymond SK Kwan. 2005. Distributed choice function hyper-heuristics for timetabling and scheduling. In Practice and Theory of Automated Timetabling V: 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18--20, 2004, Revised Selected Papers 5. Springer, 51--67.Google ScholarDigital Library
- Diego A Rodriguez, Paola P Oteiza, and Nélida B Brignole. 2019. An urban transportation problem solved by parallel programming with hyper-heuristics. Engineering Optimization 51, 11 (2019), 1965--1979.Google ScholarCross Ref
- Nasser R Sabar and Graham Kendall. 2015. Population based Monte Carlo tree search hyper-heuristic for combinatorial optimization problems. Information Sciences 314 (2015), 225--239.Google ScholarDigital Library
- Carlos Segura, Eduardo Segredo, and Coromoto Leon. 2012. Analysing the adaptation level of parallel hyperheuristics applied to multiobjectivised benchmark problems. In 2012 20th Euromicro International Conference on Parallel, Distributed and Network-based Processing. IEEE, 138--145.Google ScholarDigital Library
- Reiko Tanese. 1987. Parallel genetic algorithm for a hypercube. In Genetic algorithms and their applications: proceedings of the second International Conference on Genetic Algorithms: July 28--31, 1987 at the Massachusetts Institute of Technology, Cambridge, MA. Hillsdale, NJ: L. Erlhaum Associates, 1987.Google ScholarDigital Library
- Reiko Tanese. 2013. Parallel genetic algorithm for a hypercube. In Genetic Algorithms and Their Applications. Psychology Press, 177--183.Google Scholar
- Willem Van Onsem and Bart Demoen. 2013. Parhyflex: A framework for parallel hyper-heuristics. In Proceedings of the 25th Benelux Conference on Artificial Intelligence, Vol. 28. 231--238.Google Scholar
- Pablo Vidal and Enrique Alba. 2010. Cellular genetic algorithm on graphic processing units. Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) (2010), 223--232.Google Scholar
Index Terms
- Using a Parallel Ensemble of Sequence-Based Selection Hyper-Heuristics for Electric Bus Scheduling
Recommendations
An Adaptive Sequence-Based Selection Hyper-Heuristic for Application to Electric Bus Scheduling
GECCO '23 Companion: Proceedings of the Companion Conference on Genetic and Evolutionary ComputationBuses are important for public transportation and beneficial for the environment. However, diesel buses are significant polluters emitting greenhouse gases and particulates. Consequently, with the advent of electric vehicles there has been a drive to ...
Selection Hyper-Heuristic Using a Portfolio of Derivative Heuristics
GECCO Companion '15: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary ComputationGenerally, we distinguish between two classes of hyper-heuristic approaches, heuristic selection and heuristic generation. The former one works with existing heuristics and tries to find their optimal order for solving the instance. The later approach ...
A comparative study of hyper-heuristics for solving the school timetabling problem
SAICSIT '13: Proceedings of the South African Institute for Computer Scientists and Information Technologists ConferenceHyper-heuristics have proven to be an effective means of obtaining generalized solutions to optimization problems. One such domain in which they have been a success is educational timetabling. However, all the research in this area has focused on ...
Comments