DYNAMIC PROGRAMMING SOLUTION TO THE SINGLE VEHICLE MANY-TO-MANY IMMEDIATE REQUEST DIAL-A-RIDE PROBLEM

An investigation of the single-vehicle, many-to-many, immediate-request dial-a-ride problem is developed in two parts. Part I focuses on the "static" case of the problem. A generalized objective function is examined, the minimization of a weighted combination of the time to service all customers and of the total degree of "dissatisfaction" experienced by them while waiting for service. A dynamic programming approach is developed. The algorithm exhibits a computational effort. Part II extends this approach to solving the equivalent "dynamic" case. Example in both "static" and "dynamic" cases are presented.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Psaraftis, H N
  • Publication Date: 1980-5

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00329612
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: May 21 1981 12:00AM