TL;DR: In this paper, the authors compared the performance of quasi-random and random Monte Carlo methods for multidimensional integrals with respect to variance, variation, smoothness, and dimension.
TL;DR: The analysis shows that, in this application, the Modified Latin Hypercube Sampling (MLHS) outperforms each type of Halton sequence, making the MLHS method an appealing approach for simulation of travel demand models and simulation-based models in general.
Abstract: Quasi-random number sequences have been used extensively for many years in the simulation of integrals that do not have a closed-form expression, such as Mixed Logit and Multinomial Probit choice probabilities. Halton sequences are one example of such quasi-random number sequences, and various types of Halton sequences, including standard, scrambled, and shuffled versions, have been proposed and tested in the context of travel demand modeling. In this paper, we propose an alternative to Halton sequences, based on an adapted version of Latin Hypercube Sampling. These alternative sequences, like scrambled and shuffled Halton sequences, avoid the undesirable correlation patterns that arise in standard Halton sequences. However, they are easier to create than scrambled or shuffled Halton sequences. They also provide more uniform coverage in each dimension than any of the Halton sequences. A detailed analysis, using a 16-dimensional Mixed Logit model for choice between alternative-fuelled vehicles in California, was conducted to compare the performance of the different types of draws. The analysis shows that, in this application, the Modified Latin Hypercube Sampling (MLHS) outperforms each type of Halton sequence. This greater accuracy combined with the greater simplicity make the MLHS method an appealing approach for simulation of travel demand models and simulation-based models in general.
TL;DR: A modification of the Halton sequence (theHalton sequence leaped) and a new construction of the generalized Haltonsequence are suggested for unrestricted number of dimensions and are shown to improve considerably on the original Halton sequences.
Abstract: The Halton, Sobol, and Faure sequences and the Braaten-Weller construction of the generalized Halton sequence are studied in order to assess their applicability for the quasi Monte Carlo integration with large number of variates. A modification of the Halton sequence (the Halton sequence leaped) and a new construction of the generalized Halton sequence are suggested for unrestricted number of dimensions and are shown to improve considerably on the original Halton sequence. Problems associated with estimation of the error in quasi Monte Carlo integration and with the selection of test functions are identified. Then an estimate of the maximum error of the quasi Monte Carlo integration of nine test functions is computed for up to 400 dimensions and is used to evaluate the known generators mentioned above and the two new generators. An empirical formula for the error of the quasi Monte Carlo integration is suggested.
TL;DR: The Hammersley and Halton point sets, two well-known, low discrepancy sequences, have been used for quasi-Monte Carlo integration and the sampling scheme is also applied to ray tracing, with a significant improvement in error over standard sampling techniques.
Abstract: The Hammersley and Halton point sets, two well-known, low discrepancy sequences, have been used for quasi-Monte Carlo integration in previous research. A deterministic formula generates a uniformly distributed and stochasticlooking sampling pattern at low computational cost. The Halton point set is also useful for incremental sampling. In this paper, we discuss detailed implementation issues and our experience of choosing suitable bases for the point sets, not just on the two-dimensional plane but also on a spherical surface. The sampling scheme is also applied to ray tracing, with a significant improvement in error over standard sampling techniques.
TL;DR: It is concluded that the requirement of skewsymmetry constitutes a powerful and effective sieve for the search for near-optimal sequences.
Abstract: The value 2e^{2} is calculated by approximations as a conjectured asymptotic limit for the best central to sidelobe energy ratio of very long low autocorrelation binary sequences. The same bound is calculated by approximation for skewsymmetric sequences, hence it is concluded that the requirement of skewsymmetry constitutes a powerful and effective sieve for the search for near-optimal sequences. A second sieve based on the use of complementary sequences is discussed and shown to be quite effective for sequence lengths up to 31, and its investigation for longer lengths by means of computers is suggested. A third and a fourth sieve, based on the selection of restricted classes of complementary sequences, are also discussed.