
Accession Number : AD0672256
Title : FINDING MINIMAL COSTTIME RATIO CIRCUITS,
Corporate Author : RAND CORP SANTA MONICA CALIF
Personal Author(s) : Fox,Bennett
Report Date : JUN 1968
Pagination or Media Count : 16
Abstract : An efficient method is given for finding minimal costtime ratio circuits in routing problems through the use of the outofkilter algorithm. The problem of finding a cycle in a network having a minimal costtotime ratio has been considered previously, and column generators have been used to introduce, into the basis of the master problem, the solution that corresponds to this cycle. The subproblem is of independent interest and corresponds to deterministic single chain Markov renewal programming. The main difference between earlier approaches and the present one is that where others have used a shortest path method corresponding to the simplex method (except that steepest descent is not used), here the flow circulation problem for optimal costtime tradeoff is solved parametrically by the outofkilter algorithm. (Author)
Descriptors : (*OPERATIONS RESEARCH, SCHEDULING), (*NETWORKS, SCHEDULING), (*SCHEDULING, OPTIMIZATION), DYNAMIC PROGRAMMING, LINEAR PROGRAMMING, STATISTICAL PROCESSES, ITERATIONS, COSTS, TIME, ALGORITHMS, PROBLEM SOLVING
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE