| Abstract: | This paper examines the use of sampling procedures as a solution methodology for large combinatorial problems. Three sampling strategies are investigated: random sampling (each alternative is equally likely), biased sampling (alternatives' probabilities are biased by specified criteria), and improvement sampling (alternatives' probabilities are dynamically changed based upon new information). These three methodologies are illustrated and compared on the basis of solution quality and computer time requirements. |
