Receding Horizon Re-Ordering of Multi-Agent Execution Schedules

The trajectory planning for a fleet of automated guided vehicles (AGVs) on a roadmap is commonly referred to as the multi-agent path finding (MAPF) problem, the solution to which dictates each AGV's spatial and temporal location until it reaches its goal without collision. When executing MAPF plans in dynamic workspaces, AGVs can be...

Mixed-integer optimisation of graph neural networks for computer-aided molecular design

ReLU neural networks have been modelled as constraints in mixed integer linear programming (MILP), enabling surrogate-based optimisation in various domains and efficient solution of machine learning certification problems. However, previous works are mostly limited to MLPs. Graph neural networks (GNNs) can learn from non-euclidean data...

Optimal Design of new Hospitals: A Computational Workflow for Stacking, Zoning, and Routing

The paper proposes a generative design workflow for three major hospital layout planning steps to satisfy multiplex configurational requirements. The initial step is stacking through clustering functional spaces into floor plans, for which a spectral method is presented. Subsequently, a novel simultaneous process of zoning and routing is...

Exploring Optimal Pump Scheduling in Water Distribution Networks with Branch and Bound Methods

Water utilities can achieve significant savings in operating costs by optimising pump scheduling to improve efficiency and shift electricity consumption to low-tariff periods. Due to the complexity of the optimal scheduling problem, heuristic methods that cannot guarantee global optimality are often applied. This paper investigates...