Capacity uncertainty is a common issue in the transportation planning field. However, few studies discuss the intermodal routing problem with service capacity uncertainty. Based on our previous study on the intermodal routing under deterministic capacity consideration, we systematically explore how service capacity uncertainty influences the intermodal routing decision. First of all, we adopt t...

The problem of optimizing affine feedback laws that explicitly steer the mean and covariance an uncertain system state in presence a Gaussian random field is considered. Spatially-dependent disturbances are successively approximated with respect to nominal trajectory by sequence jointly vectors. Sequential updates control inputs computed via convex optimization includes effect feedback, perturb...

Waste management problems are subject to uncertainties presented as intervals, random variables and/or fuzzy sets. During the past 20 years, inexact programming methods have been developed and applied increasingly to waste management problems under uncertainty. To obtain a snapshot of these studies, this paper gives a review on recent developments, applications, challenges, and barriers associa...

The data envelopment analytical hierarchy process (DEAHP) is a type of the analytical hierarchy process (AHP), which used the concept of data envelopment analysis (DEA) for generating LW from the judgment matrices and aggregating them to be final weight (FW) in AHP. In general, the judgment scales in AHP is built based on decision maker. It is unrealistic to expect that the decision maker has c...

This paper considers two general 0-1 random fuzzy programming problems based on the degree of necessity which include some previous 0-1 stochastic and fuzzy programming problems. The proposal problems are not well defined due to including randomness and fuzziness. Therefore, by introducing chance constraint and fuzzy goal for the objective function, and considering the maximization of the aspir...

The term probabilistic constrained programming means the same as chance constrained programming, i.e., optimization of a function subject to certain conditions where at least one is formulated so that a condition, involving random variables, should hold with a prescribed probability. The probability is usually not prescribed exactly but a lower bound is given instead which is in practice near u...

This paper considers a general 0-1 random fuzzy programming problem including some previous 0-1 stochastic and fuzzy programming problems. The proposal problem is not a well-defined problem due to including random fuzzy variables. Therefore, by introducing chance constraint and fuzzy goal for objective function and considering the maximization for the degrees of possibility that the objective f...