Abstract
In many industrial problem domains, when faced with a combinatorial optimisation problem, a “good enough, quick enough” solution to a problem is often required. Simple heuristics often suffice in this case. However, for many domains, a simple heuristic may not be available, and designing one can require considerable expertise. Noting that a wide variety of problems can be represented as graphs, we describe a system for the automatic generation of constructive heuristics in the form of Python programs by mean of grammatical evolution. The system can be applied seamlessly to different graph-based problem domains, only requiring modification of the fitness function. We demonstrate its effectiveness by generating heuristics for the Travelling Salesman and Multi-Dimensional Knapsack problems. The system is shown to be better or comparable to human-designed heuristics in each domain. The generated heuristics can be used ‘out-of-the-box’ to provide a solution, or to augment existing hyper-heuristic algorithms with new low-level heuristics.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Korte, B., Vygen, J.: Combinatorial Optimization, vol. 21. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-24488-9
Rothlauf, F., Goldberg, D.E.: Representations for Genetic and Evolutionary Algorithms. Physica-Verlag, Heidelberg (2002)
Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 149, pp. 449–468. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_15
Biggs, N., Lloyd, E.K., Wilson, R.J.: Graph Theory 1736–1936. Clarendon Press, Oxford (1976)
Goodman, M.D., Dowsland, K.A., Thompson, J.M.: A grasp-knapsack hybrid for a nurse-scheduling problem. J. Heuristics 15(4), 351–379 (2007)
Sabar, N., Ayob, M., Qu, R., Kendall, G.: A Graph Coloring Constructive Hyper-Heuristic for Examination Timetabling Problems, cs.nott.ac.uk. http://www.cs.nott.ac.uk/~pszrq/files/APIN11.pdf
Kouider, A., Haddadene, H.A., Ourari, S., Oulamara, A.: Mixed integer linear programs and tabu search approach to solve mixed graph coloring for unit-time job shop scheduling. In: 2015 IEEE International Conference on Automation Science and Engineering (CASE), pp. 1177–1181. IEEE, August 2015
Pal, M., Pal, A.: Scheduling algorithm to select $k$ optimal programme slots in television channels: a graph theoretic approach, p. 25, May 2014. http://arxiv.org/abs/1405.2199
O’Neil, M., Ryan, C.: Grammatical Evolution. In: Grammatical Evolution, pp. 33–47. Springer, Boston (2003). https://doi.org/10.1007/978-1-4615-0447-4_4
Talbi, E.G.: Metaheuristics: From Design to Implementation, vol. 74. John Wiley & Sons, Hoboken (2009)
Rothlauf, F.: Representations for genetic and evolutionary algorithms. Springer, Heidelberg (2006). https://doi.org/10.1007/3-540-32444-5
Gendreau, M., Potvin, J.Y. (eds.): Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 146. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5
Holland, J.: Genetic algorithms. Sci. Am. (1992). http://www.geos.ed.ac.uk/~mscgis/12-13/s1100074/Holland.pdf
Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning (2011)
Dorigo, M., Birattari, M., Stutzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28–39 (2006). http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4129846
Hertz, A., Widmer, M.: Guidelines for the use of meta-heuristics in combinatorial optimization. Eur. J. Oper. Res. (2003). http://www.sciencedirect.com/science/article/pii/S0377221702008238
Talbi, E.: Metaheuristics: From Design to Implementation (2009)
Liepins, G.E., Vose, M.D.: Representational issues in genetic optimization. J. Exp. Theor. Artif. Intell. 2(2), 101–115 (1990)
O’Neill, M., Vanneschi, L., Gustafson, S., Banzhaf, W.: Open issues in genetic programming. Genet. Program. Evolvable Mach. 11(3–4), 339–363 (2010)
Foulds, L.R.: Graph Theory Applications. Springer Science & Business Media, Berlin (2012)
Gross, J.L., Yellen, J.: Graph Theory and its Applications. CRC Press, Boca Raton (2005)
Gross, J., Yellen, J., Zhang, P.: Handbook of Graph Theory (2013). http://wmich.pure.elsevier.com/en/publications/handbook-of-graph-theory-2
Wagner, S.M., Neshat, N.: Assessing the vulnerability of supply chains using graph theory. Int. J. Prod. Econ. 126(1), 121–129 (2010)
Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global Constraint Catalog (2005). https://hal.archives-ouvertes.fr/hal-00485396/
Seppänen, J., Moore, J.M.: Facilities planning with graph theory. Manag. Sci. 17(4), B-242–B-253 (1970). http://pubsonline.informs.org/doi/abs/10.1287/mnsc.17.4.B242
Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1999). http://ilpubs.stanford.edu:8090/422
Bogers, T.: Movie recommendation using random walks over the contextual graph. In: Proceedings of the 2nd International Workshop on Context-Aware (2010). http://ids.csom.umn.edu/faculty/gedas/cars2010/bogers-cars-2010.pdf
Amigó, J., Gálvez, J., Villar, V.: A review on molecular topology: applying graph theory to drug discovery and design. Naturwissenschaften 96(7), 749–761 (2009)
Elgerd, O., Happ, H.: Electric energy systems theory: an introduction. IEEE Trans. Syst. Man Cybern. (1972)
Gamst, A.: Application of graph theoretical methods to GSM radio network planning. In: Circuits and Systems, 1991, IEEE International (1991)
Burke, E.K., Gendreau, M., Hyde, M., Kendall, G., Ochoa, G., Özcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695–1724 (2013)
Pappa, G., Ochoa, G., Hyde, M., Freitas, A.: Contrasting meta-learning and hyperheuristic research: the role of evolutionary algorithms. Genet. Program. Evolvable Mach. 15(1), 3–35 (2014). http://link.springer.com/article/10.1007/s10710-013-9186-9
Koza, J.: Genetic programming: on the programming of computers by means of natural selection (1992)
Sim, K., Hart, E.: A combined generative and selective hyper-heuristic for the vehicle routing problem. In: Proceedings of the 2016 on Genetic and Evolutionary Computation Conference, pp. 1093–1100. ACM (2016)
Hart, E., Sim, K.: A hyper-heuristic ensemble method for static job-shop scheduling. Evol. Comput. 24(4), 609–635 (2016)
Keller, R.E., Poli, R.: Linear genetic programming of parsimonious metaheuristics. In: 2007 IEEE Congress on Evolutionary Computation, pp. 4508–4515. IEEE, September 2007. http://ieeexplore.ieee.org/document/4425062/
Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840–861 (2013)
Kellerer, H., Pferschy, U., Pisinger, D.: Introduction to NP-completeness of knapsack problems. In: Knapsack Problems, pp. 483–493. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24777-7_16
Fenton, M., McDermott, J., Fagan, D., Forstenlechner, S., Hemberg, E., O’Neill, M.: PonyGE2. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion on - GECCO 2017, pp. 1194–1201. ACM Press, New York, March 2017. https://doi.org/10.1145/3067695.3082469
Reinelt, G.: TSPLIBA traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991). http://pubsonline.informs.org/doi/abs/10.1287/ijoc.3.4.376
Prim, R.C.: Shortest connection networks and some generalizations. Bell Labs Tech. J. 36(6), 1389–1401 (1957)
Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. 3. Pearson Education, Upper Saddle River (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Stone, C., Hart, E., Paechter, B. (2018). Automatic Generation of Constructive Heuristics for Multiple Types of Combinatorial Optimisation Problems with Grammatical Evolution and Geometric Graphs. In: Sim, K., Kaufmann, P. (eds) Applications of Evolutionary Computation. EvoApplications 2018. Lecture Notes in Computer Science(), vol 10784. Springer, Cham. https://doi.org/10.1007/978-3-319-77538-8_40
Download citation
DOI: https://doi.org/10.1007/978-3-319-77538-8_40
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-77537-1
Online ISBN: 978-3-319-77538-8
eBook Packages: Computer ScienceComputer Science (R0)