Connor McLemore, Shaun Doheney, S. Savage, Philip A. Fahringer
{"title":"Military Readiness Modeling: Changing the Question from \"Ready or Not?\" to \"How Ready for What?\"","authors":"Connor McLemore, Shaun Doheney, S. Savage, Philip A. Fahringer","doi":"10.5711/1082598326123","DOIUrl":"https://doi.org/10.5711/1082598326123","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"1 1","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948884","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Parameterization and Multiobjective Optimization of Range and Loiter Times for Multiple-Leg, Turbojet Aircraft Mission Profiles","authors":"Lauren Bramblett, L. Champagne, B. Lunday","doi":"10.5711/1082598326137","DOIUrl":"https://doi.org/10.5711/1082598326137","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2021-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44601338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal interdiction of a ground convoy","authors":"D. Oh, R. K. Wood, Young Hoon Lee","doi":"10.5711/1082598323205","DOIUrl":"https://doi.org/10.5711/1082598323205","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"23 1","pages":"5-17"},"PeriodicalIF":0.7,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948393","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
V. Nguyen, B. Moran, A. Novak, Vicky H. Mak-Hau, T. Caelli, B. Hill, D. Kirszenblat
Military Operations Research Society. All rights reserved. Algorithms for timetabling solutions typically involve sequential allocation of students to courses and resources as the algorithm unfolds. Most current solutions, to this end, commonly use some form of stochastic optimization. In this paper, we propose a novel paradigm for optimal timetabling that comprises two distinct phases. First, we enumerate all feasible course schedules, along with their costs, using a modified implementation of Knuth’s Dancing Links technique for the exact cover problem. To our knowledge, the only prior use of this implementation has been to solve games such as Sudoku and N-Queens. Once the list of all solutions that satisfy prerequisite and time-clash constraints is generated, the second phase applies a standard deterministic optimization to allocate students to these feasible schedules. This method has been applied to a real complex timetabling problem in the Royal Australian Navy helicopter aircrew training program. The results are compared, in terms of computational time, to an exhaustive best practice backtracking algorithm for generating a complete set of feasible schedules, as well as to a pure integer linear programming solution for generating schedules and allocating students to schedules.
{"title":"Dancing links for optimal timetabling","authors":"V. Nguyen, B. Moran, A. Novak, Vicky H. Mak-Hau, T. Caelli, B. Hill, D. Kirszenblat","doi":"10.5711/1082598323261","DOIUrl":"https://doi.org/10.5711/1082598323261","url":null,"abstract":"Military Operations Research Society. All rights reserved. Algorithms for timetabling solutions typically involve sequential allocation of students to courses and resources as the algorithm unfolds. Most current solutions, to this end, commonly use some form of stochastic optimization. In this paper, we propose a novel paradigm for optimal timetabling that comprises two distinct phases. First, we enumerate all feasible course schedules, along with their costs, using a modified implementation of Knuth’s Dancing Links technique for the exact cover problem. To our knowledge, the only prior use of this implementation has been to solve games such as Sudoku and N-Queens. Once the list of all solutions that satisfy prerequisite and time-clash constraints is generated, the second phase applies a standard deterministic optimization to allocate students to these feasible schedules. This method has been applied to a real complex timetabling problem in the Royal Australian Navy helicopter aircrew training program. The results are compared, in terms of computational time, to an exhaustive best practice backtracking algorithm for generating a complete set of feasible schedules, as well as to a pure integer linear programming solution for generating schedules and allocating students to schedules.","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"23 1","pages":"61-78"},"PeriodicalIF":0.7,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70949176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimizing US army force size under uncertainty through stochastic programming","authors":"John C. Checco, Bjorn P. Berg, A. Loerch","doi":"10.5711/1082598322219","DOIUrl":"https://doi.org/10.5711/1082598322219","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"26 1","pages":"19-37"},"PeriodicalIF":0.7,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948344","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Dong-Hoon Lee, BongJoo Jeong, Bong-Kyun Kim, Ju-Yong Lee, S. Jang, Yeong-Dae Kim
{"title":"Algorithms for Aircraft Flight and Maintenance Scheduling in an Army Aviation Unit","authors":"Dong-Hoon Lee, BongJoo Jeong, Bong-Kyun Kim, Ju-Yong Lee, S. Jang, Yeong-Dae Kim","doi":"10.5711/1082598321305","DOIUrl":"https://doi.org/10.5711/1082598321305","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"21 1","pages":"5-17"},"PeriodicalIF":0.7,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948329","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analytics in Action at the New York City Police Department's Counterterrorism Bureau","authors":"E. S. Levine, J. Tisch","doi":"10.5711/1082598319405","DOIUrl":"https://doi.org/10.5711/1082598319405","url":null,"abstract":"","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"19 1","pages":"5-14"},"PeriodicalIF":0.7,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948648","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mark A. Gallagher, David J. Caswell, B. Hanlon, Justin M. Hill
F or decades, analysts within the defense community have categorized their analytic models and simulations for decision support through a hierarchy expressed in terms of resolution. The hierarchy is usually depicted as a pyramid that has levels of ‘‘engineering and physics,’’ ‘‘engagement,’’ and ‘‘mission,’’ to the most aggregate level of ‘‘campaign’’ models. In this article, we accomplish three enhancements. First, we document the importance of applying a hierarchy of models and simulations, which some have questioned because of increased computer speed. Second, we list factors to consider in describing a model or simulation’s resolution, which we hope aids interfacing model results and calibrating across levels. Third, we propose expanding the hierarchy to include two more levels beyond campaign to include levels of ‘‘defense enterprise’’ and ‘‘government, nongovernment, and coalition instruments of power.’’ We use these levels to categorize models constructed to aid decisions requiring evaluations beyond a single campaign’s results. The growing emphasis on disparate coalition operations along with the increasing interplay of broader government and nongovernmental capabilities points to a need to extend this traditional hierarchy. We propose refining the hierarchy to depict both model and simulation breadth (scope) and depth (resolution) along with our recommended two additional levels of abstraction.
{"title":"Rethinking the Hierarchy of Analytic Models and Simulations for Conflicts","authors":"Mark A. Gallagher, David J. Caswell, B. Hanlon, Justin M. Hill","doi":"10.5711/1082598319415","DOIUrl":"https://doi.org/10.5711/1082598319415","url":null,"abstract":"F or decades, analysts within the defense community have categorized their analytic models and simulations for decision support through a hierarchy expressed in terms of resolution. The hierarchy is usually depicted as a pyramid that has levels of ‘‘engineering and physics,’’ ‘‘engagement,’’ and ‘‘mission,’’ to the most aggregate level of ‘‘campaign’’ models. In this article, we accomplish three enhancements. First, we document the importance of applying a hierarchy of models and simulations, which some have questioned because of increased computer speed. Second, we list factors to consider in describing a model or simulation’s resolution, which we hope aids interfacing model results and calibrating across levels. Third, we propose expanding the hierarchy to include two more levels beyond campaign to include levels of ‘‘defense enterprise’’ and ‘‘government, nongovernment, and coalition instruments of power.’’ We use these levels to categorize models constructed to aid decisions requiring evaluations beyond a single campaign’s results. The growing emphasis on disparate coalition operations along with the increasing interplay of broader government and nongovernmental capabilities points to a need to extend this traditional hierarchy. We propose refining the hierarchy to depict both model and simulation breadth (scope) and depth (resolution) along with our recommended two additional levels of abstraction.","PeriodicalId":54242,"journal":{"name":"Military Operations Research","volume":"16 1","pages":"15-24"},"PeriodicalIF":0.7,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70948658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：