Guided design search in the interval-bounded sailor assignment problem

The problem of assigning Navy personnel to jobs is primarily a manual process performed by enlisted detailers, with decision support from the Enlisted Assignment Information System. In this paper, we offer an expanded interval bounded network flow model of the sailor assignment process creating teams of skilled sailors to be assigned to ships. A new integer preprocessing and solution technique, Guided Design Search (GDS), is integrated into the CPLEX solver with promising results for these difficult problems. Computational results show GDS/CPLEX speed improvements of 10-fold to optimality and for larger problems found feasible assignments when CPLEX alone could not. We show how GDS results can be used by detailers to gauge the effectiveness of alternative sailor assignments and also how it can be used to validate the objective function coefficients of the decision variables.

[1]  T. Liang,et al.  Improving the utilization of training resources through optimal personnel assignment in the U.S. Navy , 1988 .

[2]  Martin W. P. Savelsbergh,et al.  A Computational Study of Search Strategies for Mixed Integer Programming , 1999, INFORMS J. Comput..

[3]  Jeffery L. Kennington,et al.  Assignment with En route training of navy personnel , 1993, Naval Research Logistics (NRL).

[4]  Thomas A. Blanco,et al.  A Sea Story: Implementing the Navy's Personnel Assignment System , 1994, Oper. Res..

[5]  Lloyd S. Nelson,et al.  Statistical Design and Analysis of Experiments , 1990 .

[6]  John H. Sheesley,et al.  Quality Engineering in Production Systems , 1988 .

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Mark W. Lewis.  Guided Design Search in Joint Capacity Allocation Network Problems , 2004 .

[9]  Robert E. Maurer,et al.  Experimental Design with Applications in Management, Engineering and the Sciences , 2001 .

[10]  Reha Uzsoy,et al.  Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial , 2001, J. Heuristics.

[11]  Richard E. DeVor,et al.  Statistical Quality Design and Control: Contemporary Concepts and Methods , 1992 .

[12]  John W. Chinneck,et al.  Locating Minimal Infeasible Constraint Sets in Linear Programs , 1991, INFORMS J. Comput..

[13]  Allen Holder,et al.  Navy Personnel Planning and the Optimal Partition , 2005, Oper. Res..

[14]  Jeffery L. Kennington,et al.  Class scheduling algorithms for Navy training schools , 1998 .

[15]  A. Holder.  Designing Radiotherapy Plans with Elastic Constraints and Interior Point Methods , 2003, Health care management science.

[16]  D. Klingman,et al.  Topological and Computational Aspects of Preemptive Multicriteria Military Personnel Assignment Problems , 1984 .

[17]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[18]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[19]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[20]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[21]  T. Liang,et al.  A LARGE‐SCALE PERSONNEL ASSIGNMENT MODEL FOR THE NAVY* , 1987 .

[22]  Mark W. Lewis.  Solving Fixed Charge Capacitated Multicommodity Network Design Problems Using Guided Design Search , 2004 .