Set Partitioning Based Heuristics for Interactive Routing,

Abstract

The set partitioning model is used as the basis for an interactive approach for solving a broad class of routing problems. A pricing mechanism is developed which can be used with a variety of methods in generating improving solutions. A version of the approach has been implemented via a colorgraphics display. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1980
Accession Number
ADA090564

Entities

People

  • H. Donald Ratliff
  • John J. Jarvis

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • Cyber
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Clustering
  • Computations
  • Computer Programming
  • Computers
  • Coverings
  • Demographic Cohorts
  • Engineering
  • Linear Programming
  • Mainframe Computers
  • Mathematical Models
  • Military Research
  • Models
  • Optimization
  • Scheduling (Production)
  • Systems Engineering

Readers

  • Operations Research