Optimal routing and process scheduling for a mobile service facility

@article{Akinc1992OptimalRA,
  title={Optimal routing and process scheduling for a mobile service facility},
  author={Umit Akinc and Kizhanatham Srikanth},
  journal={Networks},
  year={1992},
  volume={22},
  pages={163-183}
}
This paper deals with the problem of delivering a well-defined service to a given set of points efficiently. Efficiencies are sought through providing the services by use of a mobile service unit (MSU). The service facility is mobile in the sense that it can move from point to point at some “move” cost. Unlike the traveling salesman-type problems however the present problem does not require a physical visit to every point for servicing. Points can be serviced from a distance, while the facility… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Hierarchical network design problem

W. G. Lesso
Eur . J . Operations Res . • 1986

Kernighan , An effective heuristic algorithm for the traveling salesman problem

W. B.
Operations Res . • 1985

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

T. Volgenant, R. Jonker
Eur. J . Operational Res • 1982

Traveling salesman and assignment problemsA survey

W. M.
Ann . Discrete Math . • 1979

The traveling salesman problem and minimal spanning trees : Part 1

R. M. Karp
Math . Program . • 1974

Similar Papers

Loading similar papers…