메뉴 건너뛰기




Volumn 19, Issue 3, 2009, Pages

The optimizing-simulator: An illustration using the military airlift problem

Author keywords

Approximate dynamic programming; Control of simulation; Military logistics; Modeling information; Optimizing simulator

Indexed keywords

APPROXIMATE DYNAMIC PROGRAMMING; DECISION FUNCTIONS; INTEGRATED MODELING; MILITARY LOGISTICS; MODEL COMPLEXES; MODELING FLEXIBILITY; MODELING INFORMATION; OPERATIONAL PROBLEMS; OPTIMIZING-SIMULATOR; RULE BASED; SIMULATION AND OPTIMIZATION;

EID: 69149099695     PISSN: 10493301     EISSN: 15581195     Source Type: Journal    
DOI: 10.1145/1540530.1540535     Document Type: Article
Times cited : (14)

References (34)
  • 4
    • 2942570080 scopus 로고    scopus 로고
    • Modelling force deployments from army installations using the transportation system capability (TRANSCAP) model: A standardized approach
    • Burke, J. F., Love, R. J., and Macal, C. M. 2004. Modelling force deployments from army installations using the transportation system capability (TRANSCAP) model: A standardized approach. Math. Comput. Model. 39, 6-8, 733-744.
    • (2004) Math. Comput. Model. , vol.39 , Issue.6-8 , pp. 733-744
    • Burke, J.F.1    Love, R.J.2    MacAl, C.M.3
  • 5
    • 0036849199 scopus 로고    scopus 로고
    • Cooperative parallel tabu search for capacitated network design
    • Crainic, T. and Gendreau, M. 2002. Cooperative parallel tabu search for capacitated network design. J. Heuristics 8, 6, 601-627.
    • (2002) J. Heuristics , vol.8 , Issue.6 , pp. 601-627
    • Crainic, T.1    Gendreau, M.2
  • 6
    • 2942598778 scopus 로고    scopus 로고
    • Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search
    • Crino, J. R., Moore, J. T., Barnes, J. W., and Nanry, W. P. 2004. Solving the theater distribution vehicle routing and scheduling problem using group theoretic tabu search. Math. Comput. Model. 39, 6-8, 599-616.
    • (2004) Math. Comput. Model. , vol.39 , Issue.6-8 , pp. 599-616
    • Crino, J.R.1    Moore, J.T.2    Barnes, J.W.3    Nanry, W.P.4
  • 7
    • 0002879508 scopus 로고
    • The allocation of aircraft to routes: An example of linear programming under uncertain demand
    • Dantzig, G. and Ferguson, A. 1956. The allocation of aircraft to routes: An example of linear programming under uncertain demand. Manage. Sci. 3, 45-73.
    • (1956) Manage. Sci. , vol.3 , pp. 45-73
    • Dantzig, G.1    Ferguson, A.2
  • 8
    • 0010504031 scopus 로고
    • The problem of routing aircraft-a mathematical solution.
    • Ferguson, A. and Dantzig, G. B. 1955. The problem of routing aircraft-a mathematical solution. Aeronaut. Eng. Rev. 14, 51-55.
    • (1955) Aeronaut. Eng. Rev. , vol.14 , pp. 51-55
    • Ferguson, A.1    Dantzig, G.B.2
  • 9
    • 0012260296 scopus 로고    scopus 로고
    • Optimization for simulation: Theory vs. practice
    • FU, M. 2002. Optimization for simulation: Theory vs. practice. INFORMS J. Comput. 14, 3, 192-215.
    • (2002) INFORMS J. Comput. , vol.14 , Issue.3 , pp. 192-215
    • Fu, M.1
  • 10
    • 0036475258 scopus 로고    scopus 로고
    • An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times
    • Godfrey, G. and Powell, W. B. 2002. An adaptive, dynamic programming algorithm for stochastic resource allocation problems I: Single period travel times. Transport. Sci. 36, 1, 21-39.
    • (2002) Transport. Sci. , vol.36 , Issue.1 , pp. 21-39
    • Godfrey, G.1    Powell, W.B.2
  • 17
    • 0242388935 scopus 로고
    • Stochastic programming models for airlift operations
    • Midler, J. L. and Wollmer, R. D. 1969. Stochastic programming models for airlift operations. Nav. Res. Logist. Quart. 16, 315-330.
    • (1969) Nav. Res. Logist. Quart. , vol.16 , pp. 315-330
    • Midler, J.L.1    Wollmer, R.D.2
  • 22
    • 41049107821 scopus 로고    scopus 로고
    • Fleet management
    • S. Wallace and W Ziemba, Eds. Math Programming Society-SIAM Series in Optimization, Philadelphia
    • Powell, W B. and Topaloglu, H. 2005. Fleet management. Applications of Stochastic Programming, S. Wallace and W Ziemba, Eds. Math Programming Society-SIAM Series in Optimization, Philadelphia.
    • (2005) Applications of Stochastic Programming
    • Powell, W.B.1    Topaloglu, H.2
  • 26
    • 63449141834 scopus 로고    scopus 로고
    • An approximate dynamic programming algorithm for large-scale fleet management: A case application
    • Simao, H. P., Day, J., George, A. P., Gifford, T., Nienow, J., and Powell, W B. 2008. An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transport. Sci. 43, 2, 178-197.
    • (2008) Transport. Sci. , vol.43 , Issue.2 , pp. 178-197
    • Simao, H.P.1    Day, J.2    George, A.P.3    Gifford, T.4    Nienow, J.5    Powell, W.B.6
  • 27
    • 10644263219 scopus 로고    scopus 로고
    • The dynamic assignment problem
    • Spivey, M. and Powell, W B. 2004. The dynamic assignment problem. Transport. Sci. 38, 4, 399-419.
    • (2004) Transport. Sci. , vol.38 , Issue.4 , pp. 399-419
    • Spivey, M.1    Powell, W.B.2
  • 28
    • 26744460688 scopus 로고    scopus 로고
    • Understanding airfield capacity for airlift operations
    • RAND Corporation
    • Stucker, J. P. and Berg, R. T. 1999. Understanding airfield capacity for airlift operations. Tech. Rep., RAND Corporation.
    • (1999) Tech. Rep.
    • Stucker, J.P.1    Berg, R.T.2
  • 29
    • 0346271770 scopus 로고    scopus 로고
    • Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey
    • Swisher, J., Jacobson, S., and Yücesan, E. 2003. Discrete-event simulation optimization using ranking, selection, and multiple comparison procedures: A survey. ACM Trans. Model. Comput. Simul. 13, 2, 134-154.
    • (2003) ACM Trans. Model. Comput. Simul. , vol.13 , Issue.2 , pp. 134-154
    • Swisher, J.1    Jacobson, S.2    Yücesan, E.3
  • 31
    • 0029752470 scopus 로고    scopus 로고
    • Feature-based methods for large scale dynamic programming
    • Tsitsiklis, J. N. and Van Roy, B. 1996. Feature-based methods for large scale dynamic programming. Mach. Learn. 22, 59-94.
    • (1996) Mach. Learn. , vol.22 , pp. 59-94
    • Tsitsiklis, J.N.1    Van Roy, B.2
  • 34
    • 0034548506 scopus 로고    scopus 로고
    • The LP/POMDP marriage: Optimization with imperfect information
    • Yost, K. A. and Washburn, A. R. 2000. The LP/POMDP marriage: Optimization with imperfect information. Nav. Res. Logist. 47, 8, 607-619.
    • (2000) Nav. Res. Logist. , vol.47 , Issue.8 , pp. 607-619
    • Yost, K.A.1    Washburn, A.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.