NETWORK CONFIGURATION AND MACHINE LAYOUT IN FIXED-PATH MATERIAL HANDLING SYSTEMS

In this paper, we address a difficult combinatorial problem that arise s in designing fixed-path material handling systems, where handling oc curs over a pre-defined and fixed route which connects various ''sites '' that are represented by a unique set of pickup and deposit points. Examples of such systems include power-and-free conveyors, monorails, in-floor towline conveyors, and automated guided vehicle systems. The objective of this study is to determine an efficient system design by simultaneously considering the configuration of the fixed path and the layout, i.e., the processor (or machine) assigned to each site. Past studies in this area have focused either on optimizing the path config uration for a given layout or on optimizing the layout for a simple pa th configuration. In this study, we show how simulated annealing can b e applied to obtain good solutions to the problem when both the path c onfiguration and the processor locations are determined concurrently. Since the above two problems are closely related, significant savings can be achieved by considering them simultaneously.