This thesis studies the problem of determining an optimal route of a moving facility considering two different kinds of measure for the distance between the service facility and facilities to be served.
For the case of rectilinear distance, the earlier work by S.W. Kim (6) is extended to include constaint problem which require the moving facility pass a certain point given.
For the squared Euclidean distance, the optimal solutions are also obtained, for the unconstraint problem as well as the constraint problem.
To illustrate the solution procedure, an example problem is solved for each model considered.