Original scientific paper Network skeleton reconfiguration is an important task during power system restoration after blackout. The uncertainty of the restoration time and the restoration successful rate during the network skeleton reconfiguration are considered in the paper. The restoration time of transmission lines and transformers, units’ startup time limit and the restoration successful ra...

In this paper, the problem of low probability of identification (LPID) improvement for radar network systems is investigated. Firstly, the security information is derived to evaluate the LPID performance for radar network. Then, without any prior knowledge of hostile intercept receiver, a novel fuzzy chance-constrained programming (FCCP) based security information optimization scheme is present...

In the paper a chance constrained linear programming problem is considered in the case of join chance constraints with random both left and right hand sides. It is assumed that due to its complex stochastic nature the problem cannot be reduced to any equivalent deterministic problem. In such a case a Monte Carlo method combined with Global Optimization (GO) algorithms are proposed to solve the ...

This study addresses a multi-objective stochastic solid transportation problem (MOSSTP) with uncertainties in supply, demand, and conveyance capacity, following the Weibull distribution. aims to minimize multiple costs (STP) under probabilistic inequality constraints. The MOSSTP is expressed as chance-constrained programming problem, constraints are incorporated ensure that capacity satisfied s...

The computation problem is discussed for the stochastic chance-constrained linear programming, and a novel direct algorithm, that is, simplex algorithm based on stochastic simulation, is proposed. The considered programming problem in this paper is linear programming with chance constraints and random coefficients, and therefore the stochastic simulation is an important implement of the propose...

In the present paper, we concentrate on dealing with a class of multiobjective programming problems with random rough coefficients. We first discuss how to turn a constrained model with random rough variables into crisp equivalent models. Then an interactive algorithm which is similar to the interactive fuzzy satisfying method is introduced to obtain the decision maker’s satisfying solution. In...

Based on the characteristics of perishable goods, we extend the location-routing problem with distance constraints by adopting chance constrained goal programming approach to solve the uncertainty and to express the different priority levels of decisions. The random of depot construction costs and vehicle routing travel time is taken into account. Meanwhile, a two-stage genetic algorithm incorp...

A natural way to handle optimization problem with data affected by stochastic uncertainty is to pass to a chance constrained version of the problem, where candidate solutions should satisfy the randomly perturbed constraints with probability at least 1− . While being attractive from modeling viewpoint, chance constrained problems “as they are” are, in general, computationally intractable. In th...

Abstract: In this study, we combine the fuzzy customer information problem with the multicommodity multimodal routing with schedule-based services which was explored in our previous study [1]. The fuzzy characteristics of the customer information are embodied in the demanded volumes of the multiple commodities and the time windows of their due dates. When the schedule-based services are conside...