The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...

We study here a problem of scheduling n job types on m parallel machines, when setups are required and the demands for the products are correlated random variables. We model this problem as a chance constrained integer program. Methods of solution currently available { in integer programming and stochastic programming { are not suucient to solve this model exactly. We develop and introduce here...

Critical environmental and human health concerns are associated with the rapidly growing fields of nanotechnology and manufactured nanomaterials (MNMs). The main risk arises from occupational exposure via chronic inhalation of nanoparticles. This research presents a chance-constrained nonlinear programming (CCNLP) optimization approach, which is developed to maximize the nanaomaterial productio...

This study covers the output-feedback model predictive control (MPC) of nonlinear systems subjected to stochastic disturbances and state chance constraints. The optimal problem is solved in a dynamic programming fashion, performed with extended Kalman filter. information summarized as Gaussian belief model. Thus, Bellman equation transformed into deterministic using this resulting constrained p...

The maximum weighted matching problem is to find a maximum matching in a given graph such that the sum of weights of edges in it is maximum. In this paper, the concept of maximum random fuzzy weighted matching is proposed firstly, and then the maximum random fuzzy weighted matching problem is formulated as expected value model, chance-constrained programming and dependent-chance programming acc...