Using MAP-Elites to support policy making around Workforce Scheduling and Routing
Journal Article
Urquhart, N., Hart, E., & Hutcheson, W. (2020)
Using MAP-Elites to support policy making around Workforce Scheduling and Routing. Automatisierungstechnik, 68(2), https://doi.org/10.1515/auto-2019-0107
English abstract: Algorithms such as MAP-Elites provide a means of allowing users to explore a solution space by returning an archive of high-performing solutions. Such an arc...
An Illumination Algorithm Approach to Solving the Micro-Depot Routing Problem
Conference Proceeding
Urquhart, N., Hoehl, S., & Hart, E. (2019)
An Illumination Algorithm Approach to Solving the Micro-Depot Routing Problem. In GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion. , (1347-1355). https://doi.org/10.1145/3321707.3321767
An increasing emphasis on reducing pollution and congestion in city centres combined with an increase in online shopping is changing the ways in which logistics companies addr...
Quantifying the effects of increasing user choice in MAP-Elites applied to a Workforce Scheduling and Routing Problem.
Conference Proceeding
Urquhart, N., Hart, E., & Hutcheson, W. (2019)
Quantifying the effects of increasing user choice in MAP-Elites applied to a Workforce Scheduling and Routing Problem. In EvoApplications 2019: Applications of Evolutionary Computation, 49-63. https://doi.org/10.1007/978-3-030-16692-2_4
Quality-diversity algorithms such as MAP-Elites provide a means of supporting the users when finding and choosing solutions to a problem by returning a set of solutions which ...
Automatic Generation of Constructive Heuristics for Multiple Types of Combinatorial Optimisation Problems with Grammatical Evolution and Geometric Graphs
Conference Proceeding
Stone, C., Hart, E., & Paechter, B. (2017)
Automatic Generation of Constructive Heuristics for Multiple Types of Combinatorial Optimisation Problems with Grammatical Evolution and Geometric Graphs. In Applications of Evolutionary Computation, 578-593
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 heurist...