#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1983

2016

- This year (0)
- Last 5 years (6)
- Last 10 years (16)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- The Jin Ai, Voratas Kachitvichyanukul
- Computers & OR
- 2009

This dissertation is a study on the use of swarm methods for optimization, and is divided into three main parts. In the first part, two novel swarm metaheuristic algorithms—named Survival Sub-swarms Adaptive Particle Swarm Optimization (SSS-APSO) and Survival Sub-swarms Adaptive Particle Swarm Optimization with velocity-line bouncing (SSS-APSO-vb)—are… (More)

- The Jin Ai, Voratas Kachitvichyanukul
- Computers & Industrial Engineering
- 2009

- Voratas Kachitvichyanukul, Bruce W. Schmeiser
- Commun. ACM
- 1988

Existing binomial random-variate generators are surveyed, and a new generator designed for moderate and large means is developed. The new algorithm, BTPE, has fixed memory requirements and is faster than other such algorithms, both when single, or when many variates are needed.

This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the… (More)

- Sugree Phatanapherom, Putchong Uthayopas, Voratas Kachitvichyanukul
- Winter Simulation Conference
- 2003

To develop grid scheduling algorithms, a high performance simulator is necessary since grid is an uncontrollable and unrepeatable environment. In this paper, a discrete event simulation library called HyperSim is used as extensible building blocks for grid scheduling simulator. The use of event graph model for the grid simulation are proposed. This model is… (More)

- Voratas Kachitvichyanukul, Bruce W. Schmeiser
- ACM Trans. Math. Softw.
- 1988

Let M be the mode of the hypergeometric distribution, which is defined as the integer portion of {(k + l)(nI + l)/(nl + n2 + 2)). The inverse transformation method is used for M max(O, k n2) < 10, and algorithm HBPE is used for M max(O, K n2) I 10. The overall algorithm framework for HBPE is acceptance/rejection and is implemented via composition. Three… (More)

- Voratas Kachitvichyanukul, Siriwan Sitthitham
- J. Intelligent Manufacturing
- 2011

- Bruce W. Schmeiser, Voratas Kachitvichyanukul
- Winter Simulation Conference
- 1986

Inducing correlation between estimators is a common way to try to reduce variance in simulation experiments. To induce the correlation between estimators, random variates are generated as functions of the same random-number streams. Although the optimal correlation induction occurs with the inverse transformation. The inverse can be quite slow compared to… (More)

- W. Wisittipanich, V. Kachitvichyanukul
- 2011

This article may be used for research, teaching and private study purposes. Any substantial or systematic reproduction, redistribution , reselling , loan, sub-licensing, systematic supply or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will… (More)

- Pisut Pongchairerks, Voratas Kachitvichyanukul
- APJOR
- 2009

This paper is a contribution to the research which aims to provide an efficient optimization algorithm for job-shop scheduling problems with multi-purpose machines or MPMJSP. To meet its objective, this paper proposes a new variant of particle swarm optimization algorithm, called GLN-PSOc, which is an extension of the standard particle swarm optimization… (More)