In this paper, a brief summary of the heuristic methods, single-stage optimization methods, time-phased optimization methods, artificial intelligence (AI) techniques and iterative improvement methods are presented. Finally, some of the important characteristics of network programming methods and their strengths and weaknesses are identified and compared. Key-words Heuristic Methods, Single-Stag...

We propose a randomized search method called Stochastic Model Reference Adaptive Search (SMRAS) for solving stochastic optimization problems in situations where the objective functions cannot be evaluated exactly, but can be estimated with some noise (or uncertainty), e.g., via simulation. The method is a generalization of the recently proposed Model Reference Adaptive Search (MRAS) method for ...

An extensive review on warehouse operation planning problems is presented. The problems are classified according to the basic warehouse functions, i.e., receiving, storage, order picking, and shipping. The literature in each category is summarized with an emphasis on the characteristics of various decision support models and solution algorithms. The purpose is to provide a bridge between academ...

This work is a study of DES-like ciphers where the bitwise exclusive-or (XOR) operation in the underlying Feistel network is replaced by an arbitrary group operation. We construct a two round simplified version of DES that contains all the DES components and show that its set of encryption permutations is not a group under functional composition, it is not a pure cipher and its set of encryptio...