VEHICLES SCHEDULING WITH SLIDING TIME WINDOWS

This paper introduces a heuristic approach for the vehicle scheduling problem with sliding time windows. In the problem with time windows, advantage is taken of the fact that the starting time of each task must fall within a given time interval (ie. A time window) rather than being fixed. Here, another level of flexibility is added by allowing the time windows of subsets of tasks to slide. The approach consists of identifying pairs of tasks offering good opportunity costs for reducing the overall cost, and finding ways of modifying the starting times to allow them to be linked. The technique is first developed for the problem with time windows and then extended to the case with sliding windows. Numberical results are reported to indicate the efficiency of the approach. (Author/TRRL)

• Corporate Authors:

  University of Montreal

  Center for Research on Transportation (CRT)/CIRRELT
  P.O. Box 6128, Station Centre-ville
  Montreal, Quebec  Canada  H3C 3J7
• Authors:
  • FERLAND, J A
  • Fortin, L
• Publication Date: 1987-3

Language

• Undetermined

Media Info

• Features: Figures; References; Tables;
• Pagination: 33 p.
• Serial:
  • Issue Number: 593

Subject/Index Terms

• TRT Terms: Heuristic methods; Scheduling; Vehicles
• ITRD Terms: 6464: Calculation; 685: Headway; 9102: Method; 1054: Network (traffic); 9055: Operational research; 1144: Operations (transp network); 1186: Timetable; 1255: Vehicle
• Subject Areas: Administration and Management; Highways; Vehicles and Equipment;

Filing Info

• Accession Number: 00478670
• Record Type: Publication
• Source Agency: Transportation Association of Canada (TAC)
• Files: ITRD, TRIS
• Created Date: Jan 31 1989 12:00AM