A computer program for solution of sequence dependent routing problems using a branch-and-bound algorithm.
Jackson, Richard Alan
MetadataShow full item record
An algorithm for the solution of sequence-dependent routing problems is presented and programmed in FORTRAN IV for use on digital computers. Solutions, computation times and iteration requirements are summarized and discussed for eleven test cases. With specific modification of the input data, a typical traveling salesman closed-loop problem may be solved by the same program.
Approved for public release; distribution is unlimited.
Showing items related by title, author, creator and subject.
Krambeck, Scott D. (Monterey, California: Naval Postgraduate School, 1990-09);The development of a universal solution of the main problem in artificial satellite theory has only recently been accomplished with the aid of high powered computers. The solution to this long standing problem is an ...
Agrawal, B.N. (1993);This paper presents a boundary-layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary-value problems: an ...
Agrawal, B.N. (1990);This paper presents a boundary layer model to predict dynamic characteristics of liquid motion in partially filled tanks of a spinning spacecraft. The solution is obtained by solving three boundary value problems: inviscid, ...