Satellite constellation configuration design is a complicated and time-consuming simulation optimization problem. In this paper, a new method called the rapid method for satellite constellation performance calculation...Satellite constellation configuration design is a complicated and time-consuming simulation optimization problem. In this paper, a new method called the rapid method for satellite constellation performance calculation is developed by the Hermite interpolation technique to reduce the computing complication and time. The constellation configuration optimization model is established on the basis of the rapid performance calculation. To reduce the search space and enhance the optimization efficiency, this paper presents a new constellation optimization strategy based on the ordinal optimization （00） theory and expands the algorithm realization for constellation optimization including precise and crude models, ordered performance curves, selection rules and selected subsets. Two experiments about navigation constellation and space based surveillance system （SBSS） are carried out and the analysis of simulation results indicates that the ordinal optimization for satellite constellation configuration design is effective.展开更多
Ordinal optimization concentrates on isolating a subset of good designs with high probability and reduces the required simulation time dramatically for discrete event simulation. To obtain the same probability level,w...Ordinal optimization concentrates on isolating a subset of good designs with high probability and reduces the required simulation time dramatically for discrete event simulation. To obtain the same probability level,we may optimally allocate our computing budget among different designs,instead of equally simulating all different designs. In this paper we present an effective approach to optimally allocate computing budget for discrete-event system simulation. While ordinal optimization can dramatically reduce the computation cost, our approach can further reduce the already-low cost.展开更多
In this paper, we propose an ordinal optimization based simulation optimization algorithm to determine a target distribution of bicycles for a bicycle sharing network to minimize an expected cost. The proposed algorit...In this paper, we propose an ordinal optimization based simulation optimization algorithm to determine a target distribution of bicycles for a bicycle sharing network to minimize an expected cost. The proposed algorithm consists of two stages. The first stage is using GA （genetic algorithm） assisted by a surrogate model to select an estimated good enough subset of solutions. The second stage is to identify the best solution among the solutions obtained from stage one using optimal computing budget allocation technique. We have tested the proposed algorithm on a bicycle sharing network and compared the test results with those obtained by the GA with exact model. The test results demonstrate that the proposed algorithm can obtain a good enough solution within reasonable computing time and outperforms the comparing method.展开更多
文摘Satellite constellation configuration design is a complicated and time-consuming simulation optimization problem. In this paper, a new method called the rapid method for satellite constellation performance calculation is developed by the Hermite interpolation technique to reduce the computing complication and time. The constellation configuration optimization model is established on the basis of the rapid performance calculation. To reduce the search space and enhance the optimization efficiency, this paper presents a new constellation optimization strategy based on the ordinal optimization （00） theory and expands the algorithm realization for constellation optimization including precise and crude models, ordered performance curves, selection rules and selected subsets. Two experiments about navigation constellation and space based surveillance system （SBSS） are carried out and the analysis of simulation results indicates that the ordinal optimization for satellite constellation configuration design is effective.
文摘Ordinal optimization concentrates on isolating a subset of good designs with high probability and reduces the required simulation time dramatically for discrete event simulation. To obtain the same probability level,we may optimally allocate our computing budget among different designs,instead of equally simulating all different designs. In this paper we present an effective approach to optimally allocate computing budget for discrete-event system simulation. While ordinal optimization can dramatically reduce the computation cost, our approach can further reduce the already-low cost.
文摘In this paper, we propose an ordinal optimization based simulation optimization algorithm to determine a target distribution of bicycles for a bicycle sharing network to minimize an expected cost. The proposed algorithm consists of two stages. The first stage is using GA （genetic algorithm） assisted by a surrogate model to select an estimated good enough subset of solutions. The second stage is to identify the best solution among the solutions obtained from stage one using optimal computing budget allocation technique. We have tested the proposed algorithm on a bicycle sharing network and compared the test results with those obtained by the GA with exact model. The test results demonstrate that the proposed algorithm can obtain a good enough solution within reasonable computing time and outperforms the comparing method.
