All Outputs (56)

A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem. (2017)
Conference Proceeding
AYODELE, M., MCCALL, J., REGNIER-COUDERT, O. and BOWIE, L. 2017. A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem. In Proceedings of the 2017 IEEE congress on evolutionary computation (CEC 2017), 5-8 June 2017, San Sebastian, Spain. New York: IEEE [online], article number 7969591, pages 2364-2371. Available from: https://doi.org/10.1109/CEC.2017.7969591

Random Key (RK) is an alternative representation for permutation problems that enables application of techniques generally used for continuous optimisation. Although the benefit of RKs to permutation optimisation has been shown, its use within Estima... Read More about A random key based estimation of distribution algorithm for the permutation flowshop scheduling problem..

RK-EDA: a novel random key based estimation of distribution algorithm. (2016)
Conference Proceeding
AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2016. RK-EDA: a novel random key based estimation of distribution algorithm. In Handl, J., Hart, E., Lewis, P.R., López-Ibáñez, M., Ochoa, G. and Paechter, B. (eds.) Parallel problem solving from natuture: proceedings of the 14th International parallel problem solving from nature conference (PPSN XIV), 17-21 September 2016, Edinburgh, UK. Lecture notes in computer science, 9921. Cham: Springer [online], pages 849-858. Available from: https://doi.org/10.1007/978-3-319-45823-6_79

The challenges of solving problems naturally represented as permutations by Estimation of Distribution Algorithms (EDAs) have been a recent focus of interest in the evolutionary computation community. One of the most common alternative representation... Read More about RK-EDA: a novel random key based estimation of distribution algorithm..

Predictive planning with neural networks. (2016)
Conference Proceeding
AINSLIE, R., MCCALL, J., SHAKYA, S. and OWUSU, G. 2016. Predictive planning with neural networks. In Proceedings of the International joint conference on neural networks (IJCNN), 24-29 July 2016, Vancouver, Canada. Piscataway: IEEE [online], pages 2110-2117. Available from: https://doi.org/10.1109/IJCNN.2016.7727460

Critical for successful operations of service industries, such as telecoms, utility companies and logistic companies, is the service chain planning process. This involves optimizing resources against expected demand to maximize the utilization and mi... Read More about Predictive planning with neural networks..

BPGA-EDA for the multi-mode resource constrained project scheduling problem. (2016)
Conference Proceeding
AYODELE, M., MCCALL, J. and REGNIER-COUDERT, O. 2016. BPGA-EDA for the multi-mode resource constrained project scheduling problem. In Proceedings of the 2016 IEEE congress on evolutionary computation (CEC 2016), 24-29 July 2016, Vancouver, Canada. Piscataway, NJ: IEEE [online], article number 7744222, pages 3417-3424. Available from: https://doi.org/10.1109/CEC.2016.7744222

The Multi-mode Resource Constrained Project Scheduling Problem (MRCPSP) has been of research interest for over two decades. The problem is composed of two interacting sub problems: mode assignment and activity scheduling. These problems cannot be sol... Read More about BPGA-EDA for the multi-mode resource constrained project scheduling problem..

Generating easy and hard problems using the proximate optimality principle. (2015)
Conference Proceeding
MCCALL, J.A.W., CHRISTIE, L.A. and BROWNLEE, A.E.I. 2015. Generating easy and hard problems using the proximate optimality principle. In Silva, S. (ed.) Proceedings of the companion publication of the 2015 annual conference on genetic and evolutionary computation (GECCO Companion '15), 11-15 July 2015, Madrid, Spain. New York: ACM [online], pages 767-768. Available from: https://doi.org/10.1145/2739482.2764890

We present an approach to generating problems of variable difficulty based on the well-known Proximate Optimality Principle (POP), often paraphrased as similar solutions have similar fitness. We explore definitions of this concept in terms of metrics... Read More about Generating easy and hard problems using the proximate optimality principle..

Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. (2015)
Conference Proceeding
BROWNLEE, A.E.I., MCCALL, J.A.W. and CHRISTIE, L.A. 2015. Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems. In Proceedings of the 2015 IEEE congress on evolutionary computation (CEC 2015), 25-28 May 2015, Sendai, Japan. Piscataway, NJ: IEEE [online], pages 2066-2073. Available from: https://doi.org/10.1109/CEC.2015.7257139

Metaheuristics assume some kind of coherence between decision and objective spaces. Estimation of Distribution algorithms approach this by constructing an explicit probabilistic model of high fitness solutions, the structure of which is intended to r... Read More about Structural coherence of problem and algorithm: an analysis for EDAs on all 2-bit and 3-bit problems..

Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. (2014)
Conference Proceeding
CHRISTIE, L.A., MCCALL, J.A.W. and LONIE, D.P. 2014. Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings. In Igel, C. (ed.) Proceedings of the 2014 Genetic and evolutionary computation conference (GECCO 2014): a recombination of the 23rd International conference on genetic algorithms (ICGA-2014), and the 19th Annual genetic programming conference (GP-2014), 12-16 July 2014, Vancouver, Canada. New York: ACM [online], pages 333-340. Available from: https://doi.org/10.1145/2576768.2598240

Problem structure, or linkage, refers to the interaction between variables in a black-box fitness function. Discovering structure is a feature of a range of algorithms, including estimation of distribution algorithms (EDAs) and perturbation methods (... Read More about Minimal walsh structure and ordinal linkage of monotonicity-invariant function classes on bit strings..

Partial structure learning by subset Walsh transform. (2013)
Conference Proceeding
CHRISTIE, L.A., LONIE, D.P. and MCCALL, J.A.W. 2013. Partial structure learning by subset Walsh transform. In Jin, Y. and Thomas, S.A. (eds.) Proceedings of the 13th UK workshop on computational intelligence (UKCI 2013), 9-11 September 2013, Guildford, UK. New York: IEEE [online], article number 6651297, pages 128-135. Available from: https://doi.org/10.1109/UKCI.2013.6651297

Estimation of distribution algorithms (EDAs) use structure learning to build a statistical model of good solutions discovered so far, in an effort to discover better solutions. The non-zero coefficients of the Walsh transform produce a hypergraph rep... Read More about Partial structure learning by subset Walsh transform..

Combining biochemical network motifs within an ARN-agent control system. (2013)
Conference Proceeding
GERRARD, C.E., MCCALL, J., MACLEOD, C. and COGHILL, G.M. 2013. Combining biochemical network motifs within an ARN-agent control system. In Jin, Y. and Thomas, S.A. (eds.) Proceedings of the 13th UK workshop on computational intelligence (UKCI 2013), 9-11 September 2013, Guildford, UK. New York: IEEE [online], article number 6651281, pages 8-15. Available from: https://doi.org/10.1109/UKCI.2013.6651281

The Artificial Reaction Network (ARN) is an Artificial Chemistry representation inspired by cell signaling networks. The ARN has previously been applied to the simulation of the chemotaxis pathway of Escherichia coli and to the control of limbed robo... Read More about Combining biochemical network motifs within an ARN-agent control system..

Artificial chemistry approach to exploring search spaces using artificial reaction network agents. (2013)
Conference Proceeding
GERRARD, C.E., MCCALL, J., MACLEOD, C. and COGHILL, G.M. 2013. Artificial chemistry approach to exploring search spaces using artificial reaction network agents. In Proceedings of the 2013 IEEE congress on evolutionary computation (CEC 2013), 20-23 June 2013, Cancun, Mexico. New York: IEEE [online], article number 6557702, pages 1201-1208. Available from: https://doi.org/10.1109/CEC.2013.6557702

The Artificial Reaction Network (ARN) is a cell signaling network inspired representation belonging to the branch of A-Life known as Artificial Chemistry. It has properties in common with both AI and Systems Biology techniques including Artificial Ne... Read More about Artificial chemistry approach to exploring search spaces using artificial reaction network agents..

Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks. (2012)
Conference Proceeding
GERRARD, C.E., MCCALL, J., COGHILL, G.M. and MACLEOD, C. 2012. Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks. In Huang, T., Zeng, Z., Li, C. and Leung, C.S. (eds.) Proceedings of the 19th International conference on neural information processing (ICONIP 2012), 12-15 November 2012, Doha, Qatar. Lecture notes in computer science, 7663. Berlin: Springer [online], part I, pages 280-287. Available from: https://doi.org/10.1007/978-3-642-34475-6_34

The Artificial Reaction Network (ARN) is a bio-inspired connectionist paradigm based on the emerging field of Cellular Intelligence. It has properties in common with both AI and Systems Biology techniques including Artificial Neural Networks, Petri N... Read More about Adaptive dynamic control of quadrupedal robotic gaits with artificial reaction networks..

Temporal patterns in artificial reaction networks. (2012)
Conference Proceeding
GERRARD, C., MCCALL, J., COGHILL, G.M. and MACLEOD, C. 2012. Temporal patterns in artificial reaction networks. In Villa, A.E.P., Duch, W., Érdi, P., Masulli, F. and Palm, G. (eds.) Artificial neural networks and machine learning: proceedings of the 22nd International conference on artificial neural networks (ICANN 2012), 11-14 September 2012, Lausanne, Switzerland. Lecture notes in computer science, 7552. Berlin: Springer [online], part I, pages 1-8. Available from: https://doi.org/10.1007/978-3-642-33269-2_1

The Artificial Reaction Network (ARN) is a bio-inspired connectionist paradigm based on the emerging field of Cellular Intelligence. It has properties in common with both AI and Systems Biology techniques including Artificial Neural Networks, Petri N... Read More about Temporal patterns in artificial reaction networks..

Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields. (2006)
Conference Proceeding
SHAKYA, S.K., MCCALL, J.A.W. and BROWN, D.F. 2006. Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields. In Proceedings of the 2006 IEEE congress on evolutionary computation (CEC 2006), 16-21 July 2006, Vancouver, Canada. New York: IEEE [online], article number 1688408, pages 908-915. Available from: https://doi.org/10.1109/CEC.2006.1688408

Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs). An EDA using this technique was called Distribution Estimation using Markov Ra... Read More about Solving the Ising spin glass problem using a bivariate EDA based on Markov random fields..

Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. (2005)
Conference Proceeding
SHAKYA, S.K., MCCALL, J.A.W. and BROWN, D.F. 2005. Incorporating a metropolis method in a distribution estimation using Markov random field algorithm. In Proceedings of the 2005 IEEE congress on evolutionary computation (CEC 2005), 2-5 September 2005, Edinburgh, UK. New York: IEEE [online], volume 3, article number 1555017, pages 2576-2583. Available from: https://doi.org/10.1109/CEC.2005.1555017

Markov Random Field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for Estimation of Distribution Algorithms (EDAs)[34, 4]. An EDA using this technique, presented in [34], was called Distribution... Read More about Incorporating a metropolis method in a distribution estimation using Markov random field algorithm..

Statistical optimisation and tuning of GA factors. (2005)
Conference Proceeding
PETROVSKI, A., BROWNLEE, A. and MCCALL, J. 2005. Statistical optimisation and tuning of GA factors. In Proceedings of the 2005 IEEE congress on evolutionary computation (CEC 2005), 2-5 September 2005, Edinburgh, UK. New York: IEEE [online], volume 1, article number 1554759, pages 758-764. Available from: https://doi.org/10.1109/CEC.2005.1554759

This paper presents a practical methodology of improving the efficiency of Genetic Algorithms through tuning the factors significantly affecting GA performance. This methodology is based on the methods of statistical inference and has been successful... Read More about Statistical optimisation and tuning of GA factors..

Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. (2001)
Conference Proceeding
PETROVSKI, A. and MCCALL, J. 2001. Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms. In Zitzler, E., Thiele, L., Deb, K., Coello Coello, C.A. and Corne, D. (eds.) Proceedings of the 1st International conference on evolutionary multi-criterion optimization (EMO 2001), 7-9 March 2001, Zurich, Switzerland. Lecture notes in computer science, 1993. Berlin: Springer [online], pages 531-545. Available from: https://doi.org/10.1007/3-540-44719-9_37

The main objectives of cancer treatment in general, and of cancer chemotherapy in particular, are to eradicate the tumour and to prolong the patient survival time. Traditionally, treatments are optimised with only one objective in mind. As a result o... Read More about Multi-objective optimisation of cancer chemotherapy using evolutionary algorithms..