Analytical Analysis of Vehicle Routing and Inventory Routing Problems

Abstract

The objective of the project is to perform analytical analyses of heuristics for the Vehicle Routing Problem (VRP) and apply the results in models that integrate vehicle routing with other issues important to the firm. Our major accomplishments are: (1) Determined the exact structure of the asymptotic optimal solution value of the VRP with capacity and time window constraints and used it to develop a new and efficient algorithm. (2) Obtained a characterization of the effectiveness of set partitioning formulations for VRPs. (3) Characterized the worst case behavior of the linear programming relaxation of the set partitioning formulation for the bin packing problem. (4) Performed a probabilistic analysis of a multi-echelon distribution system and used the insight obtained to develop an efficient algorithm for it.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 30, 1998
Accession Number
ADA358629

Entities

Organizations

  • Columbia University

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Electronic Mail
  • Engineering
  • Inventory
  • Inventory Control
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • New York
  • Operations Research
  • Patents
  • Standards
  • Students
  • Technical Information Centers

Readers

  • Aerial Unmanned Vehicle Swarm Micro Periodontal Dentistry.
  • Logistics and Supply Chain Management.
  • Statistical inference.