ROUTING AND SCHEDULING WITH TIME WINDOWS SOLVED BY NETWORK RELAXATION AND BRANCH-AND-BOUND ON TIME VARIABLES. FROM THE BOOK COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

Consider a set of trips where each trip is specified a priori by a place of origin, a destination, a duration, a cost and a time interval within which the trip must begin. The trips may include visits to one or more specific points. Our problem is to determine the number of vehicles required together with their routes and schedules, so that each trip begins within its given interval, while the fixed costs related to the number of vehicles, and the travel costs between trips are minimized. The problem is a generalization of the m-traveling salesman problem.

• Supplemental Notes:
  • Proceedings of a workshop held in Montreal in 1983 under the auspices of the Centre de recherche sur les transports of the Universite de Montreal.
• Corporate Authors:

  Elsevier

  Radarweg 29
  Amsterdam,   Netherlands  1043 NX
• Authors:
  • Desrosiers, J
  • Soumis, F
  • DESROCHERS, M
  • Sauve, M
• Publication Date: 1985

Media Info

• Features: References; Tables;
• Pagination: p. 451-469
• Monograph Title: COMPUTER SCHEDULING OF PUBLIC TRANSPORT 2

Subject/Index Terms

• TRT Terms: Buses; Costs; Mathematical models; Origin and destination; Routing; Scheduling; Time
• Old TRIS Terms: Time factor
• Subject Areas: Finance; Operations and Traffic Management; Public Transportation;

Filing Info

• Accession Number: 00484131
• Record Type: Publication
• Files: TRIS
• Created Date: May 31 1989 12:00AM