We study path planning on grids with blocked and unblocked cells. Any-angle path-planning algorithms find short paths fast because they propagate information along grid edges without constraining the resulting paths to grid edges. Incremental pathplanning algorithms solve a series of similar pathplanning problems faster than repeated single-shot searches because they reuse information from the ...

A large body of work exists in process industry supply chain optimisation. We describe the state of the art of research in infrastructure design, modelling and analysis and planning and scheduling, together with some industrial examples. We will consider two network design type problems in more detail and then draw some conclusions about the degree to which different classes of problem have bee...