Solving the Precedence Constrained Vehicle Routing Problem with Time Windows Using the Reactive Tabu Search Metastrategy

Abstract

The vehicle routing problem (VRP) is associated with the design of a set of minimum cost routes for a fleet of vehicles to serve, exactly once, a set of customers with known demands. The pickup and delivery problem with time windows (PDPTW) is a generalization of the VRP. The PDPTW constructs optimal routes to satisfy transportation requests, each requiring both pickup and delivery under capacity, time window, precedence and coupling constraints. This dissertation presents a reactive tabu search (RTS) approach to solve the PDPTW and illustrates how to transform generalized precedence constrained routing problems with time windows (PCRPTW) into equivalent PDPTWs.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1998
Accession Number
ADA349633

Entities

People

  • William Paul Nanry

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Business Administration
  • C Programming Language
  • Computations
  • Computer Programming
  • Computer Science
  • Computers
  • Data Sets
  • Dynamic Programming
  • Engineering
  • Heuristic Methods
  • Mathematical Programming
  • New York
  • Operations Research
  • Optimization
  • Two Dimensional
  • United States Military Academy

Fields of Study

  • Computer science

Readers

  • Aerial Unmanned Vehicle Swarm Micro Periodontal Dentistry.
  • Operations Research