TWO FORMULATIONS OF THE VEHICLE ROUTING PROBLEM: AN EMPIRICAL APPLICATION AND COMPUTATIONAL EXPERIENCE

This paper presents an exact method, based on mixed integer programming (MIP), and a heuristic method, based on dynamic programming (DP), to determine optimum routing of delivery vehicles. Empirical results of the two approaches show that an agribusiness firm engaged in dispatching fuel delivery vehicles could obtain substantial savings if either of the two methods were used. The discrepancies between the MIP and DP solutions were in general negligible. In contrast, the DP approach is computationally far more efficient than the MIP approach and offers a practical alternative when solution time as well as accuracy is of concern.

  • Corporate Authors:

    University of British Columbia, Vancouver

    Faculty of Commerce and Business Administration
    Vancouver, British Columbia  Canada  V6T 1Z2
  • Authors:
    • Onal, H
    • Jaramillo, B M
    • Mazzocco, M A
  • Publication Date: 1996-6

Language

  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00724686
  • Record Type: Publication
  • Files: TRIS, ATRI
  • Created Date: Aug 30 1996 12:00AM