Using greedy clustering method to solve capacitated location-routing problem with fuzzy demands

In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. In CLRP-FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed, the vehicles and the depots have a predefined capacity to serve the customers that have fuzzy demands. To model this problem, a fuzzy chance constrained programming model of that is designed based upon the fuzzy credibility theory. To solve this problem, a greedy clustering method (GCM) including the stochastic simulation is proposed. To obtain the best value of the dispatcher preference index of the model and to analyze its influence on the final solution, numerical experiments are carried out. Finally, to show the performance of the greedy clustering method, associated results are compared with the lower bound of the solutions.     

Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm

In this paper, the dynamic capacitated location-routing problem with fuzzy demands (DCLRP-FD) is considered. In the DCLRP-FD, facility location problem and vehicle routing problem are solved on a time horizon. Decisions concerning facility locations are permitted to be made only in the first time period of the planning horizon but, the routing decisions may be changed in each time period. Furthermore, the vehicles and depots have a predefined capacity to serve the customers with altering demands during the time horizon. It is assumed that the demands of customers are fuzzy variables. To model the DCLRP-FD, a fuzzy chance-constrained programming is designed based upon the fuzzy credibility theory. To solve this problem, a hybrid heuristic algorithm (HHA) with four phases including the stochastic simulation and a local search method are proposed. To achieve the best value of two parameters of the model, the dispatcher preference index (DPI) and the assignment preference index (API), and to analyze their influences on the final solution, numerical experiments are carried out. Moreover, the efficiency of the HHA is demonstrated via comparing with the lower bound of solutions and by using a standard benchmark set of test problems. The numerical examples show that the proposed algorithm is robust and could be used in real world problems.     

Chance constrained integer programming models for capital budgeting in fuzzy environments

This paper attempts to model capital budgeting problems by chance constrained integer programming in a fuzzy environment (rather than a stochastic environment). Some examples are also provided to illustrate the potential applications of new models. Finally, a fuzzy simulation based genetic algorithm is designed for solving chance constrained integer programming models with fuzzy parameters.     

Stochastic programming with fuzzy linear partial information on probability distribution

This paper deals with stochastic programming problems where the probability distribution is not explicitly known. We suppose that the probability distribution is defined by crisp or fuzzy inequalities on the probability of the different states of nature. We formulate the problem and present a solution strategy that uses the α-cut technique in order to transform our problem into a stochastic program with linear partial information on probability distribution (SPI). The obtained SPI problem is than solved using two approaches, namely, a chance constrained approach and a recourse approach. For the recourse approach, a modified L-shaped algorithm is designed and illustrated by an example.     

A new data envelopment analysis model with fuzzy random inputs and outputs

This paper first presents several formulas for mean chance distributions of triangular fuzzy random variables and their functions, then develops a new class of fuzzy random data envelopment analysis (FRDEA) models with mean chance constraints, in which the inputs and outputs are assumed to be characterized by fuzzy random variables with known possibility and probability distributions. According to the established formulas for the mean chance distributions, we can turn the mean chance constraints into their equivalent stochastic ones. On the other hand, since the objective in the FRDEA model is the expectation about the ratio of the weighted sum of outputs and the weighted sum of inputs for a target decision-making unite (DMU), for general fuzzy random inputs and outputs, we suggest an approximation method to evaluate the objective; and for triangular fuzzy random inputs and outputs, we propose a method to reduce the objective to its equivalent stochastic one. As a consequence, under the assumption that the inputs and the outputs are triangular fuzzy random vectors, the proposed FRDEA model can be reduced to its equivalent stochastic programming one, in which the constraints contain the standard normal distribution function, and the objective is the expectation for a function of the normal random variable. To solve the equivalent stochastic programming model, we design a hybrid algorithm by integrating stochastic simulation and genetic algorithm (GA). Finally, one numerical example is presented to demonstrate the proposed FRDEA modeling idea and the effectiveness of the designed hybrid algorithm.     

An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

We study here a problem of schedulingn job types onm 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 sufficient to solve this model exactly. We develop and introduce here a new approach, based on a geometric interpretation of some recent results in Gröbner basis theory, to provide a solution method applicable to a general class of chance constrained integer programming problems.Out algorithm is conceptually simple and easy to implement. Starting from a (possibly) infeasible solution, we move from one lattice point to another in a monotone manner regularly querying a membership oracle for feasibility until the optimal solution is found. We illustrate this methodology by solving a problem based on a real system.Corresponding author.     

Relaxations and approximations of chance constraints under finite distributions

Optimization problems with constraints involving stochastic parameters that are required to be satisfied with a prespecified probability threshold arise in numerous applications. Such chance constrained optimization problems involve the dual challenges of stochasticity and nonconvexity. In the setting of a finite distribution of the stochastic parameters, an optimization problem with linear chance constraints can be formulated as a mixed integer linear program (MILP). The natural MILP formulation has a weak relaxation bound and is quite difficult to solve. In this paper, we review some recent results on improving the relaxation bounds and constructing approximate solutions for MILP formulations of chance constraints. We also discuss a recently introduced bicriteria approximation algorithm for covering type chance constrained problems. This algorithm uses a relaxation to construct a solution whose (constraint violation) risk level may be larger than the pre-specified threshold, but is within a constant factor of it, and whose objective value is also within a constant factor of the true optimal value. Finally, we present some new results that improve on the bicriteria approximation factors in the finite scenario setting and shed light on the effect of strong relaxations on the approximation ratios.     

A hybrid intelligent algorithm for portfolio selection problem with fuzzy returns

Portfolio selection theory with fuzzy returns has been well developed and widely applied. Within the framework of credibility theory, several fuzzy portfolio selection models have been proposed such as mean–variance model, entropy optimization model, chance constrained programming model and so on. In order to solve these nonlinear optimization models, a hybrid intelligent algorithm is designed by integrating simulated annealing algorithm, neural network and fuzzy simulation techniques, where the neural network is used to approximate the expected value and variance for fuzzy returns and the fuzzy simulation is used to generate the training data for neural network. Since these models are used to be solved by genetic algorithm, some comparisons between the hybrid intelligent algorithm and genetic algorithm are given in terms of numerical examples, which imply that the hybrid intelligent algorithm is robust and more effective. In particular, it reduces the running time significantly for large size problems.     

不同风险态度下的三层供应链集成优化

研究了在决策者不同风险态度下的由供应商、分销商和零售商组成三层供应链集成优化问题。考虑供应链中价格、质量、交货、需求和供应的不确定风险因素为模糊变量,应用可信性理论建立了模糊机会约束规划模型,可信性测度的置信水平代表了决策者的风险偏好程度。使用模糊变量的乐观值和悲观值将机会约束转化为清晰的等价形式。最后,通过数值算例分析了决策者的风险态度的变化对集成供应链的影响。     

Multi-objective stochastic programming for portfolio selection

Generally, in the portfolio selection problem the Decision Maker (DM) considers simultaneously conflicting objectives such as rate of return, liquidity and risk. Multi-objective programming techniques such as goal programming (GP) and compromise programming (CP) are used to choose the portfolio best satisfying the DM’s aspirations and preferences. In this article, we assume that the parameters associated with the objectives are random and normally distributed. We propose a chance constrained compromise programming model (CCCP) as a deterministic transformation to multi-objective stochastic programming portfolio model. CCCP is based on CP and chance constrained programming (CCP) models. The proposed program is illustrated by means of a portfolio selection problem from the Tunisian stock exchange market.