Optimization of Service Routes in a Restricted Environment

This paper presents a method which is presently being developed for planning mechanical and electrical service routes within a confined space. The method uses a modified Lees’ algorithm which allows horizontal, vertical and diagonal (450) routings within the space/each service is initially routed individually and then a system based on simulated evolution techniques is used to select services for progressive re-routing until an optimal solution is obtained. The method of selecting which services are to be re-routed considers the length and complexity of the service route, whether its initial routing clashes with any other services and whether its position will permit a logical construction sequence. The order in which the services are re-routed is then determined by a probabilistic method. Initial tests using this method indicate that complex service layouts are successfully routed and that the resultant layouts are well proportioned and distributed.