Andrew J. Parkes

Publication Activity (10 Years)

Years Active: 1995-2021
Publications (10 Years): 21

Top Topics

Genetic Programming

Examination Timetabling

Portfolio Optimization

Top Venues

Ann. Oper. Res.

Publications

Daniel Karapetyan, Andrew J. Parkes
Enhancing Security via Deliberate Unpredictability of Solutions in Optimisation. CoRR (2021)
Tianxiang Cui, Ruibin Bai, Shusheng Ding, Andrew J. Parkes, Rong Qu, Fang He, Jingpeng Li
A hybrid combinatorial approach to a two-stage stochastic portfolio optimization model with uncertain asset prices. Soft Comput. 24 (4) (2020)
Jakub Marecek, Andrew J. Parkes
Semidefinite Programming in Timetabling and Mutual-Exclusion Scheduling. CoRR (2019)
Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. J. Artif. Intell. Res. 66 (2019)
Grazziela P. Figueredo, Peng Shi, Andrew J. Parkes, Keith Evans, Jonathan M. Garibaldi, Ola Negm, Patrick J. Tighe, Herbert F. Sewell, John Robertson
A Hybrid Evolutionary Strategy to Optimise Early-Stage Cancer Screening. CEC (2019)
Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle
Algorithm Configuration: Learning Policies for the Quick Termination of Poor Performers. LION (2018)
Adam N. Letchford, Andrew J. Parkes
A guide to conic optimisation and its applications. RAIRO Oper. Res. 52 (4) (2018)
Andrew J. Parkes, Neema Beglou, Ender Özcan
Learning the Quality of Dispatch Heuristics Generated by Automated Programming. LION (2018)
Daniel Karapetyan, Andrew J. Parkes, Thomas Stützle
Algorithm Configuration: Learning policies for the quick termination of poor performers. CoRR (2018)
Daniel Karapetyan, Jason A. D. Atkin, Andrew J. Parkes, Juan Castro-Gutierrez
Lessons from building an automated pre-departure sequencer for airports. Ann. Oper. Res. 252 (2) (2017)
Andrew W. Burnett, Andrew J. Parkes
Exploring the landscape of the space of heuristics for local search in SAT. CEC (2017)
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. Eur. J. Oper. Res. 260 (2) (2017)
Nonthachote Chatsanga, Andrew J. Parkes
Two-Stage Stochastic International Portfolio Optimisation under Regular-Vine-Copula-Based Scenarios. CoRR (2017)
Ahmad Muklason, Andrew J. Parkes, Ender Özcan, Barry McCollum, Paul McMullan
Fairness in examination timetabling: Student preferences and extended formulations. Appl. Soft Comput. 55 (2017)
Nonthachote Chatsanga, Andrew J. Parkes
International portfolio optimisation with integrated currency overlay costs and constraints. Expert Syst. Appl. 83 (2017)
Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes
Combining Monte-Carlo and hyper-heuristic methods for the multi-mode resource-constrained multi-project scheduling problem. Inf. Sci. 373 (2016)
Daniel Karapetyan, Andrew J. Parkes, Gregory Z. Gutin, Andrei Gagarin
Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. CoRR (2016)
Shahriar Asta, Ender Özcan, Andrew J. Parkes
CHAMP: Creating heuristics via many parameters for online bin packing. Expert Syst. Appl. 63 (2016)
Ahmed Kheiri, Ender Özcan, Andrew J. Parkes
A stochastic local search algorithm with adaptive acceptance for high-school timetabling. Ann. Oper. Res. 239 (1) (2016)
Daniel Karapetyan, Abraham P. Punnen, Andrew J. Parkes
Multi-component approach to the bipartite Boolean quadratic programming problem. CoRR (2016)
Nonthachote Chatsanga, Andrew J. Parkes
International Portfolio Optimisation with Integrated Currency Overlay Costs and Constraints. CoRR (2016)
Andrew J. Parkes, Ender Özcan, Daniel Karapetyan
A Software Interface for Supporting the Application of Data Science to Optimisation. LION (2015)
Tianxiang Cui, Ruibin Bai, Andrew J. Parkes, Fang He, Rong Qu, Jingpeng Li
A hybrid genetic algorithm for a two-stage stochastic portfolio optimization with uncertain asset prices. CEC (2015)
Shahriar Asta, Daniel Karapetyan, Ahmed Kheiri, Ender Özcan, Andrew J. Parkes
Combining Monte-Carlo and Hyper-heuristic methods for the Multi-mode Resource-constrained Multi-project Scheduling Problem. CoRR (2015)
Alexander E. I. Brownlee, Jerry Swan, Ender Özcan, Andrew J. Parkes
Hyperion2: a toolkit for {meta-, hyper-} heuristic research. GECCO (Companion) (2014)
Ahmet Yarimcam, Shahriar Asta, Ender Ozcan, Andrew J. Parkes
Heuristic generation via parameter tuning for online bin packing. EALS (2014)
Shahriar Asta, Ender Özcan, Andrew J. Parkes
Dimension reduction in the search for online bin packing policies. GECCO (Companion) (2013)
Tianxiang Cui, Jingpeng Li, John Robert Woodward, Andrew J. Parkes
An ensemble based Genetic Programming system to predict English football premier league games. EAIS (2013)
Shahriar Asta, Ender Özcan, Andrew J. Parkes, A. Sima Etaner-Uyar
Generalizing Hyper-heuristics via Apprenticeship Learning. EvoCOP (2013)
Shahriar Asta, Ender Özcan, Andrew J. Parkes
Batched Mode Hyper-heuristics. LION (2013)
José Carlos Ortiz-Bayliss, Ender Ozcan, Andrew J. Parkes, Hugo Terashima-Marín
A genetic programming hyper-heuristic: Turning features into heuristics for constraint satisfaction. UKCI (2013)
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Ozcan, Andrew J. Parkes, Santiago E. Conant-Pablos
Exploring heuristic interactions in constraint satisfaction problems: A closer look at the hyper-heuristic space. IEEE Congress on Evolutionary Computation (2013)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
A branch-and-cut procedure for the Udine Course Timetabling problem. Ann. Oper. Res. 194 (1) (2012)
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Santiago Enrique Conant-Pablos, Ender Özcan, Andrew J. Parkes
Improving the performance of vector hyper-heuristics through local search. GECCO (2012)
Ender Özcan, Andrew J. Parkes, Alpay Alkan
The Interleaved Constructive Memetic Algorithm and its application to timetabling. Comput. Oper. Res. 39 (10) (2012)
Barry McCollum, Paul McMullan, Andrew J. Parkes, Edmund K. Burke, Rong Qu
A new model for automated examination timetabling. Ann. Oper. Res. 194 (1) (2012)
Andrew J. Parkes, Ender Özcan, Matthew R. Hyde
Matrix Analysis of Genetic Programming Mutation. EuroGP (2012)
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, José Antonio Vázquez Rodríguez, James D. Walker, Michel Gendreau, Graham Kendall, Barry McCollum, Andrew J. Parkes, Sanja Petrovic, Edmund K. Burke
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search. EvoCOP (2012)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability III: Implementation CoRR (2011)
Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability II: Theory CoRR (2011)
Edmund K. Burke, Michel Gendreau, Matthew R. Hyde, Graham Kendall, Barry McCollum, Gabriela Ochoa, Andrew J. Parkes, Sanja Petrovic
The Cross-Domain Heuristic Search Challenge - An International Research Competition. LION (2011)
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Özcan, Andrew J. Parkes, Santiago Enrique Conant-Pablos
Variable and Value Ordering Decision Matrix Hyper-heuristics: A Local Improvement Approach. MICAI (1) (2011)
José Carlos Ortiz-Bayliss, Hugo Terashima-Marín, Ender Özcan, Andrew J. Parkes
On the idea of evolving decision matrix hyper-heuristics for solving constraint satisfaction problems. GECCO (Companion) (2011)
Jingpeng Li, Andrew J. Parkes, Edmund K. Burke
Evolutionary Squeaky Wheel Optimization: A New Framework for Analysis. Evol. Comput. 19 (3) (2011)
Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work CoRR (2011)
Ender Özcan, Andrew J. Parkes
Policy matrix evolution for generation of heuristics. GECCO (2011)
Barry McCollum, Andrea Schaerf, Ben Paechter, Paul McMullan, Rhydian Lewis, Andrew J. Parkes, Luca Di Gaspero, Rong Qu, Edmund K. Burke
Setting the Research Agenda in Automated Timetabling: The Second International Timetabling Competition. INFORMS J. Comput. 22 (1) (2010)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
A supernodal formulation of vertex colouring with applications in course timetabling. Ann. Oper. Res. 179 (1) (2010)
Camille Beyrouthy, Edmund K. Burke, Barry McCollum, Paul McMullan, Andrew J. Parkes
University space planning and space-type profiles. J. Sched. 13 (4) (2010)
José Carlos Ortiz-Bayliss, Ender Özcan, Andrew J. Parkes, Hugo Terashima-Marín
Mapping the performance of heuristics for Constraint Satisfaction. IEEE Congress on Evolutionary Computation (2010)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37 (3) (2010)
Hishammuddin Asmuni, Edmund K. Burke, Jonathan M. Garibaldi, Barry McCollum, Andrew J. Parkes
An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Comput. Oper. Res. 36 (4) (2009)
Camille Beyrouthy, Edmund K. Burke, Dario Landa-Silva, Barry McCollum, Paul McMullan, Andrew J. Parkes
Towards improving the utilization of university teaching space. J. Oper. Res. Soc. 60 (1) (2009)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
Decomposition, Reformulation, and Diving in University Course Timetabling CoRR (2009)
Graham Kendall, Andrew J. Parkes, Kristian Spoerer
A Survey of NP-Complete Puzzles. J. Int. Comput. Games Assoc. 31 (1) (2008)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
Penalising Patterns in Timetables: Novel Integer Programming Formulations. OR (2007)
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling CoRR (2007)
Camille Beyrouthy, Edmund K. Burke, Dario Landa Silva, Barry McCollum, Paul McMullan, Andrew J. Parkes
The Teaching Space Allocation Problem with Splitting. PATAT (2006)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability III: Implementation. J. Artif. Intell. Res. 23 (2005)
Heidi E. Dixon, Matthew L. Ginsberg, David K. Hofer, Eugene M. Luks, Andrew J. Parkes
Implementing a Generalized Version of Resolution. AAAI (2004)
Heidi E. Dixon, Matthew L. Ginsberg, Andrew J. Parkes
Generalizing Boolean Satisfiability I: Background and Survey of Existing Work. J. Artif. Intell. Res. 21 (2004)
Heidi E. Dixon, Matthew L. Ginsberg, Eugene M. Luks, Andrew J. Parkes
Generalizing Boolean Satisfiability II: Theory. J. Artif. Intell. Res. 22 (2004)
Andrew J. Parkes
Scaling Properties of Pure Random Walk on Random 3-SAT. CP (2002)
Andrew J. Parkes
Easy Predictions for the Easy-Hard-Easy Transition. AAAI/IAAI (2002)
Matthew L. Ginsberg, Andrew J. Parkes
Satisfiability Algorithms and Finite Quantification. KR (2000)
Charles B. McVey, David P. Clements, Barton C. Massey, Andrew J. Parkes
Worldwide Aeronautical Route Planner. AAAI/IAAI (1999)
Matthew L. Ginsberg, Andrew J. Parkes, Amitabha Roy
Supermodels and Robustness. AAAI/IAAI (1998)
Andrew J. Parkes
Clustering at the Phase Transition. AAAI/IAAI (1997)
Andrew J. Parkes, Joachim P. Walser
Tuning Local Search for Satisfiability Testing. AAAI/IAAI, Vol. 1 (1996)
Andrew J. Parkes, Geraint A. Wiggins
Logic Program Synthesis by Induction over Horn Clauses. LOPSTR (1995)