Title: A random activity network generator
Authors: Demeulemeester, Erik ×
Dodin, B
Herroelen, Willy #
Issue Date: Sep-1993
Publisher: Operations research soc amer
Series Title: Operations research vol:41 issue:5 pages:972-980
Abstract: Exact and heuristic procedures are often developed to obtain optimal and near-optimal solutions to decision problems modeled as activity networks. Testing the accuracy and efficiency of these procedures requires the use of activity networks with various sizes, structures and parameters. The size of the network is determined by its number of nodes and arcs, where the structure is chosen from the set of all structures for the specified network size. The network parameters depend on the nature of the decision problem. Often, it is desirable for test problems to be generated at random from the space of all feasible networks. This paper deals with the problem of generating the size and structure of the network at random from the space of all feasible networks. It develops a theory which guarantees the randomness of the network structure. The theory is the basis for two methods. One can be used to generate dense networks, where the other is used to generate nondense networks. The methods, which are practical and easy to use, have been programmed for use on mainframe or personal computers. CPU time requirements are negligible. Copies of the computer program can be obtained from the authors.
ISSN: 0030-364X
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Research Center for Operations Management, Leuven
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
Arandomactivity.pdf Published 351KbAdobe PDFView/Open Request a copy

These files are only available to some KU Leuven Association staff members


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science