A distributed computing architecture for simulation and optimization

Proceedings - Winter Simulation Conference

Volumn 2005, Issue , 2005, Pages 365-373

  Yijia, Xu ^a   Sen, Suvrajeet ^a  

^a University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SIMULATION; INTEGRATION; LINEAR PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; STOCHASTIC PROGRAMMING;

DISCRETE EVENT SIMULATION; DISTRIBUTED COMPUTING ARCHITECTURE; GENERIC FRAMEWORK;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33846677829     PISSN: 08917736     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/WSC.2005.1574271     Document Type: Conference Paper

References (19)

1. Alrefaei, M.H. and S. Andradóttir. 1999. A simulated annealing algorithm with constant temperature for discrete stochastic optimization. Management Science 45 (5): 748-764.
2. Andradóttir, S. 1996. A global search method for discrete stochastic optimization. SIAM Journal on Optimization 6: 513-530.
3. Bertsimas, D. and D. Gammarnik. 1999. Asymptotically optimal algorithm for job shop scheduling and packet routing. Journal of Algorithms 33: 296-318.
4. Blomvall, J. 2003. A Multistage Stochastic Programming Algorithm Suitable for Parallel Computing. Parallel Computing 29 (4): 431-445.
5. Boudoukh, T., M. Penn, and G. Weiss. 2001. Scheduling job shop with some identical or similar jobs. Journal of Scheduling 4: 177-199.
6. Chen, H. and A. Mandelbaum. 1991. Discrete flow networks: Bottleneck analysis and fluid approximation. Mathematics of Operations Research 16 (2): 408-445.
7. Fu, M. C. 2002. Optimization for Simulation: Theory vs. Practice. INFORMS Journal on Computing 4 (3): 192215.
8. Gelfand, S. and S. Mitter. 1989. Simulated annealing with noisy or imprecise energy measurements. Journal of Optimization Theory and Applications 62: 49-62.
9. Gürkan, G., A.Y. Özge, and S.M. Robinson. 1999. Samplepath solution of stochastic variational inequalities. Mathematical Programming 84: 313-333.
10. Gutjahr, WJ. and G.C. Pflug. 1996. Simulated annealing for noisy cost functions. Journal of Global Optimization 8: 1-13.
11. Lee, E.K. 2004. Generating Cutting Planes for Mixed Integer Programming Problems a Parallel Computing Environment. INFORMS Journal on Computer 16 (1): 3-26.
12. Pichitlamken, J. and B.L. Nelson. 2003. A Combined Procedure for Optimization via Simulation. ACM Transactions on Modeling and Computer Simulation 13 (2): 155-179.
13. Plambeck, E.L., B.-R. Fu, S.M. Robinson, and R. Suri. 1996. Sample-path optimization of convex stochastic performance functions. Mathematical Programming 75: 137-176.
14. Schrage, L., 1997. Optimization Modeling with LINDO. Duxbury Press.
15. Sen, S., R.D. Doverspike, and S. Cossares. 1994. Network planning with random demand. Telecommunication Systems 3: 11-30.
16. Suri, R. and Y.T. Leung. 1989. Single Run Optimization of Discrete Event Simulations - an Empirical Study Using the M/M/1 Queue. IIE Transactions 21: 35-49.
17. Yan, D. and H. MuKai. 1992. Stochastic Discrete Optimization. SIAM Journal of Control and Optimization 30(3): 594-612.
18. Zeigler, B.P., G. Ball, H. Cho, J.S. Lee, and H. Sarjoughian. 1999. Implementation of the DEVS Formalism over the HLA/RTI: Problems and Solutions. In Simulation Interoperation Workshop (SIW). Available online via http://acims.arizona.edu/PUBLlCATlONS/ SIW99Paper/SIWDEVSlmplemHLARTI.pdf [accessed December 20, 2004].
19. Zeigler, B.P. and H.S. Sarjoughian. 2003. Introduction to DEVS Modeling & Simulation with JAVA: Developing Component-based Simulation Models. Available online via http://acims.arizona.edu/SOFTWARE/ devsjava_lieensed/ CBMSManuscript.zip [accessed January 16, 2005].