Implementation and Evaluation of a Resource Allocation Algorithm to Determine the Minimum Number of Inspectors

Abstract

This thesis presents the problem of determining the minimum number of inspectors required to perform cyclic activities at multiple locations over an arbitrary time period. Formulated as an integer programming problem, it is similar to the broad class of problems known as vehicle routing problems. A heuristic approach is adopted for solving this inspector problem by essentially dividing it into a load assignment problem and a tour construction problem for every node with demand. The result is an algorithm to solve generic resource allocation problems with any number of depots. A computer-based implementation of the algorithm was developed to evaluate its performance. Keywords: Logistics support; Logistics inspectors; Vehicle routing problems; Resource allocation; Resource management.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1988
Accession Number
ADA217457

Entities

People

  • John T. Clatanoff

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Availability
  • Classification
  • Computer Programming
  • Computer Programs
  • Computers
  • Data Sets
  • Engineering
  • Heuristic Methods
  • Illinois
  • Industrial Engineering
  • Integer Programming
  • Mathematical Models
  • Operations Research
  • Optimization
  • Organizational Structure
  • Security

Readers

  • Defense Financial Management and Audit.
  • Logistics and Supply Chain Management.
  • Operations Research