Skip Navigation

The Computer Journal 1990 33(4):368-374; doi:10.1093/comjnl/33.4.368
© 1990 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Oommen, B. J.
Right arrow Articles by Ng, D. T. H.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On Generating Random Permutations with Arbitrary Distributions*

B. J. Oommen and D. T. H. Ng

School of Computer Science, Carleton University, Ottawa: K1S 5B6, Canada

Let R = {R1, R2, ..., RM} be an ordered set of M elements where Ri < Rj whenever i < j. Let {pi} be the set of permutations of R. We consider the problem of randomly generating the elements of {pi} according to a distribution G({pi}). Various algorithms including those due to Durstenfeld3,5 and Moses et al7 are available for the case when the distribution G({pi}) is a uniform distribution (i.e., where all the elements of {pi} are generated with equal probability). In this paper we consider the case when the distribution G({pi}) is not necessarily uniform. We present a strategy for specifying the distribution G({pi}) and propose a technique for generating the elements of {pi} according to the distribution G({pi}). Applications of the technique to generate ‘almost sorted lists’ and in the Travelling Salesman Problem have been presented. Finally, simulation results have been included which demonstrate the power of the Random Permutation Generation (RPG) technique.

Received October 1988. revised February 1989.

* Partially supported by the National Sciences and Engineering Research Council of Canada. A preliminary version of this paper was presented at the 1989 ACM Computer Science Conference in Louisville, Kentucky.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.