In this paper an online optimisation approach is proposed which can be used to find an appropriate combined schedule and container assignment in a Network Design Problem under uncertainty. For this, a simulation based approach on a multi-period time window is proposed, moving forward on the time window after each decision made, assuming that the status of the system is updated as soon as the stochastic and unknown elements become deterministic and known. This approach provides new insight and knowledge into synchromodal and multimodal planning problems. The results of the approach are compared to the results of three simpler online optimisation methods and to the solution of the offline approach where all information is known.

In quantum circuit design, the question arises how to distribute qubits, used in algorithms, over the various quantum computers, and how to order them within a quantum computer. In order to evaluate these problems, we define the global and local reordering problems for distributed quantum computing. We formalise the mathematical problems and model them as integer linear programming problems, to minimise the number of SWAP gates or the number of interactions between different quantum computers. For global reordering, we analyse the problem for various geometries of networks: completely connected networks, general networks, linear arrays and grid-structured networks. For local reordering, in networks of quantum computers, we also define the mathematical optimisation problem.