THE TRAVELING SALESMAN LOCATION PROBLEM ON STOCHASTIC NETWORKS

This Technical Note considers the traveling salesman location problem on stochastic networks in which the length of links are not deterministic. It is shown that several available solution methods for deterministic networks can be modified to solve the problem on stochastic networks as well.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • Berman, O
  • SIMCHI-LEVI, D
• Publication Date: 1989-2

Media Info

• Features: Figures; References;
• Pagination: p. 54-57
• Serial:
  • Transportation Science
  • Volume: 23
  • Issue Number: 1
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Networks; Stochastic processes; Traveling salesman problem
• Old TRIS Terms: Stochastic networks; Traveling salesman location problem
• Subject Areas: Data and Information Technology; Planning and Forecasting; Public Transportation;

Filing Info

• Accession Number: 00480985
• Record Type: Publication
• Files: TRIS, ATRI
• Created Date: Mar 31 1989 12:00AM