Routing a fleet of M vehicles to/from a central facility

• C. S. Orloff

抄録

In a previous paper, algorithms for optimally routing a single vehicle were presented. In this paper, the problem of routing a fleet of M vehicles serving fixed demand for transportation from many origins to a single destination is considered. The M vehicle General Routing Problem (abbreviated M‐GRP) is the core of many real routing problems, such as school bus routing for a single school (many‐to‐one) and garbage truck routing to a central dump. It is shown that the M‐GRP on a given graph is equivalent to a GRP on a modified graph. From this result, it is shown that single vehicle routing algorithms can be applied to the M vehicle routing problem.

収録刊行物

• Networks

  Networks 4 (2), 147-162, 1974-01

  Wiley

キーワード

• Computer Networks and Communications
• Hardware and Architecture
• Information Systems
• Software

詳細情報

• CRID: 1362544418567717376
• NII論文ID: 30027490186
• DOI: 10.1002/net.3230040205
• ISSN: 10970037
• ISSN: 00283045
• ISSN: http://id.crossref.org/issn/00283045
• Web Site: https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fnet.3230040205
• Web Site: https://onlinelibrary.wiley.com/doi/pdf/10.1002/net.3230040205
• データソース種別:
  • Crossref
  • CiNii Articles