Application Of The Adaptive Random Search To Discrete And Mixed Integer Optimization

Author

R. C. Kelahan
J. L. Gaddy, Missouri University of Science and Technology

Abstract

In this study, a random search technique, previously applied to continuous optimization problems, is adapted and applied to discrete and mixed integer problems. The development of the method and the procedure for applying the method are discussed in detail. Three discrete and one mixed integer problems, efficiencies can be made. The radom search procedure demonstrated perfect reliability in locating the optima. Improved efficiencies resulted for each of the examples are improved optimal solutions were found in two cases. Copyright © 1978 John Wiley & Sons, Ltd

Recommended Citation

R. C. Kelahan and J. L. Gaddy, "Application Of The Adaptive Random Search To Discrete And Mixed Integer Optimization," International Journal for Numerical Methods in Engineering, vol. 12, no. 2, pp. 289 - 298, Wiley, Jan 1978.

The definitive version is available at https://doi.org/10.1002/nme.1620120210

Department(s)

Chemical and Biochemical Engineering

International Standard Serial Number (ISSN)

1097-0207; 0029-5981

Document Type

Article - Journal

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2023 Wiley, All rights reserved.

Publication Date

01 Jan 1978