PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS

This paper considers two different problems in single vehicle routing. The first looks at finding the least time cost routes between all pairs of nodes in a network for navigating vehicles. The second looks at a vehicle which services all locations in a network. Parallel algorithms are employed in the processes.

• Supplemental Notes:
  • Publication Date: 1997 Published By: IEEE Service Center, Piscataway NJ
• Corporate Authors:

  Simon Fraser University, Canada

  School of Computer Science
  Burnaby, British Columbia  Canada  V5A 1S6
• Authors:
  • Gupta, A
  • Krishnamurti, R
• Conference:
  • International Conference on High-Pereformance Computing (4th : 1997 : Bangalore, India). Proceedings
• Publication Date: 1997

Language

• English

Media Info

• Pagination: p. 144-151

Subject/Index Terms

• TRT Terms: Computer algorithms; Parallel processing; Routing
• Subject Areas: Data and Information Technology;

Filing Info

• Accession Number: 00775812
• Record Type: Publication
• Source Agency: UC Berkeley Transportation Library
• Files: PATH
• Created Date: Nov 17 1999 12:00AM