Real Time Optimization: Algorithms and Applications.
Abstract
This document contains three technical reports. The first report presents a new branch-and-bound algorithm for the assignment problem with side constraints. Models of this type are used in studies involving the optimal assignment of sailors to billets. Problems having 300 sailors and 600 billets with 90 potential assignments for each sailor were solved in less than five minutes on a Dec Alpha workstation. The second report presents several new algorithms for the problem of developing an annual class schedule for either a Navy C--School or a Navy A-School. Algorithms based on a greedy heuristic were found to perform very well on problems for both types of schools. The final report presents a new dual simplex based algorithm for the generalized network problem. In empirical tests, our specialized code was found to be approximately twenty times faster than CPLEX 3.0.
Document Details
- Document Type
- Technical Report
- Publication Date
- Aug 30, 1996
- Accession Number
- ADA313301
Entities
People
- Jeffery L. Kennington
Organizations
- Southern Methodist University