Academia.eduAcademia.edu

Outline

A tabu search approach to strategic mobility mode selection

2005

Abstract

The advice and concern of Melba Crawford. For the military guidance and technical issues Lt Col Brigantic and LTC Seise provided. Support, encouragement and occasional kick in the pants from Wes Barnes. I could never ask for a better chair, colleague and friend! In addition, I could not have completed this program without the help and support of my family and friends. I will forever be indebted for the specific support of my colleagues in getting me through the program: Catherine Crisp, Kyle Jones and Donna Koryczinski. For the times when I needed to get away and de-stress with gardening-Jeanette Brown. The unwavering support of my family, the morals and values my parents instilled in me and for instilling in me that the only limitations I face are those I impose on myself… vi

References (29)

  1. Battiti, R. & G. Tecchiolli. (1994). The reactive tabu search. ORSA Journal on Computing,6(2), 126-140.
  2. Carlton, W. & J. Barnes. (1996). A note on hashing functions and tabu search algorithms. European Journal of Operational Research, 95, 237-239.
  3. Combs, T. (2002). A combined adaptive tabu search and set partitioning approach for the crew scheduling problem with an air tanker crew application. Doctoral Dissertation. Air Force Institute of Technology, Wright-Patterson Air Force Base, OH.
  4. Crino, J. R. (2002). A group theoretic tabu search methodology for solving theater distribution vehicle routing and scheduling problems. Doctoral Dissertation. Air Force Institute of Technology, Wright-Patterson Air Force Base, OH.
  5. Crino, J., Moore, J., Barnes, J.W., & Nanry, W. (2004). Solving the Theater Distribution Vehicle Routing and Scheduling Problem using Group Theoretic Tabu Search. Mathematical Computer Modeling, 39(6-8),617-640.
  6. Department of the Army. (n.d.). Military fundamentals for DA civilians. Retrieved July 27, 2002, from http://www.osc.army.mil/ig/milfun3.ppt. Department of the Army. (1992). Mobilization, Deployment, Redeployment, Demobilization. (Field Manual No. 100-17). Washington, DC: Author.
  7. Department of Defense. (n.d.). JOPES category codes. Washington, DC: Author. Department of Defense. (2001). JOPES Volume I: Planning Policies and Procedures. Washington, DC: Author.
  8. DPRA. (n.d.). TPFDD. Retrieved on August 1, 2002 from http://www.jfast.org/jfast/html/Terms/TPFDD.htm .
  9. DPRA. (2003). Improving the deployment process. Manhattan, KS: Author.
  10. Fagerholt, K. (2001). Ship scheduling with soft time windows: An optimization based approach. European Journal of Operational Research, 131, 559-571.
  11. Glover, F. (1989). Tabu Search -part I. ORSA Journal on Computing, 1, 190 -206.
  12. Glover, F. (1990). Tabu search: a tutorial. Interfaces, 20(4), 74-94.
  13. Glover, F. & M. Laguna. (1993). Tabu search. In C.R. Reeves (Ed.). Modern heuristic techniques for combinatorial problems (pp. 70-150). NY: Wiley & Sons.
  14. Harwig, J. (2003). An adaptive tabu search approach to cutting and packing problems. Doctoral Dissertation. The University of Texas, Austin, TX. 2003.
  15. IIT Research Institute. (October 2002). Mobility Simulator-Air: Executive Summary. O'Fallon, IL: Author.
  16. Lambert, G. R. (2004). A tabu search approach to the strategic airlift problem. Doctoral Dissertation. The University of Texas, Austin, TX.
  17. Lau, H.C. & Liang, Z. (2001). Pickup and delivery with time windows: Algorithms and test case generation. Proceedings of the International Conference of Tools with Artificial Intelligence, 333-340.
  18. Lu, Q. & Dessouky, M. (2004). An exact algorithm for the Multiple Vehicle Pickup and Delivery Problem. Transportation Science, 38(4), 503-514.
  19. Malca, F. & Semet, F. (2003). A tabu search heuristic for the pickup and delivery problem with time windows and a fixed size fleet. Unpublished manuscript.
  20. McKinzie, K. & Barnes, J. W.. (2004). A review of strategic mobility models supporting the defense transportation system. Mathematical Computer Modeling, 39(6-8), 839-868.
  21. Melendez, B. S. (2002). On scheduling delivery in a military deployment scenario, Doctoral Dissertation. North Carolina State University, Raleigh, NC.
  22. Mitrovic-Minic, S. (1998). Pickup and delivery problem with time windows: A survey. (SFU CMPT TR No 1998-12). Burnby, BC Canada: Simon Frasier University.
  23. Nanry, W.P. & Barnes, J.W. (2000). Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research, part B 34, 107- 121.
  24. Shank, J., Mattock, M., Sumner, G., Greenberg, I., Rothenberg, J., & Stucker, J. (1991). A review of strategic mobility models and analysis. RAND National Defense Research Institute: Santa Monica, CA.
  25. USTRANSCOM. (2003). Strategic Transportation Quick Look (STQL) Excel based spreadsheet model. Unpublished manuscript.
  26. USTRANSCOM/TCJ5 & Joint Transportation Corporate Information Management Center. (1998). Transportation Analysis, Modeling and Simulation (TAMS) Transportation Systems Decision Report. Unpublished manuscript.
  27. Vincenty, T. (1975). Direct and inverse solutions of geodesics on the ellipsoid with application of nested equations. Survey Review, XXIII(176), 88-93.
  28. Wiley, V. (2001) The Aerial Fleet Refueling Problem. Doctoral Dissertation. The University of Texas, Austin, TX.
  29. Wiley, V., Barnes, J. W., Moore, J. & Ryer, D. M. (2004). Solving the aerial fleet refueling problem using group theoretic tabu search. Mathematical Computer Modeling, 39(6-8), 617-640.