Visit Allocation Model. Volume III. Algorithm Modifications.
Abstract
The report contains the development and the program description of additions and modifications to the Visit Allocation Model. The Visit Allocation Model is designed to assign ordered visit site points to paths in such a manner as to include all visit sites and to minimize the total path distance subject to constraints on (1) maximum allowed path distance (range) associated with each vehicle. (2) maximum number of visits associated with each given vehicle, and (3) total number of vehicles available. Vehicles with different maximum range and visit capabilities are allowed. Each path must originate at any one of a specified group of entry points (points of origin) and must terminate at any one of a specified group of entry points (points of destination). No geometric constraints are placed upon entry, exit, or visit sites allowed; and no restriction is placed upon the number of vehicles assigned to any entry or exis. The FORTRAN 4 program was converted from the IBM 7094 Direct Couple System to the CDC 6600 computer. The new program version uses an improved algorithm to find minimum path length. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1972
- Accession Number
- AD0753116
Entities
People
- Arthur Z. Kovacs
- Michael J. Gehrlich
Organizations
- University of Dayton Research Institute