A STOCHASTIC SIMULATION-BASED HYBRID INTERVAL FUZZY PROGRAMMING APPROACH FOR OPTIMIZING THE TREATMENT OF RECOVERED OILY WATER

In this paper, a stochastic simulation-based hybrid interval fuzzy programming (SHIFP) approach is developed to aid the decision-making process by solving fuzzy linear optimization problems. Fuzzy set theory, probability theory, and interval analysis are integrated to take into account the effect of imprecise information, subjective judgment, and variable environmental conditions. A case study related to oily water treatment during offshore oil spill clean-up operations is conducted to demonstrate the applicability of the proposed approach. The results suggest that producing a random sequence of triangular fuzzy numbers in a given interval is equivalent to a normal distribution when using the centroid defuzzification method. It also shows that the defuzzified optimal solutions follow the normal distribution and range from 3,000-3,700 tons, given the budget constraint (CAD 110,000-150,000). The normality seems to be able to propagate throughout the optimization process, yet this interesting finding deserves more in-depth study and needs more rigorous mathematical proof to validate its applicability and feasibility. In addition, the optimal decision variables can be categorized into several groups with different probability such that decision makers can wisely allocate limited resources with higher confidence in a short period of time. This study is expected to advise the industries and authorities on how to distribute resources and maximize the treatment efficiency of oily water in a short period of time, particularly in the context of harsh environments

A robust fuzzy possibilistic AHP approach for partner selection in international strategic alliance

The international strategic alliance is an inevitable solution for making competitive advantage and reducing the risk in today’s business environment. Partner selection is an important part in success of partnerships, and meanwhile it is a complicated decision because of various dimensions of the problem and inherent conflicts of stockholders. The purpose of this paper is to provide a practical approach to the problem of partner selection in international strategic alliances, which fulfills the gap between theories of inter-organizational relationships and quantitative models. Thus, a novel Robust Fuzzy Possibilistic AHP approach is proposed for combining the benefits of two complementary theories of inter-organizational relationships named, (1) Resource-based view, and (2) Transaction-cost theory and considering Fit theory as the perquisite of alliance success. The Robust Fuzzy Possibilistic AHP approach is a noveldevelopment of Interval-AHP technique employing robust formulation; aimed at handling the ambiguity of the problem and let the use of intervals as pairwise judgments. The proposed approach was compared with existing approaches, and the results show that it provides the best quality solutions in terms of minimum error degree. Moreover, the framework implemented in a case study and its applicability were discussed

Efficient Semidefinite Branch-and-Cut for MAP-MRF Inference

We propose a Branch-and-Cut (B&C) method for solving general MAP-MRF inference problems. The core of our method is a very efficient bounding procedure, which combines scalable semidefinite programming (SDP) and a cutting-plane method for seeking violated constraints. In order to further speed up the computation, several strategies have been exploited, including model reduction, warm start and removal of inactive constraints. We analyze the performance of the proposed method under different settings, and demonstrate that our method either outperforms or performs on par with state-of-the-art approaches. Especially when the connectivities are dense or when the relative magnitudes of the unary costs are low, we achieve the best reported results. Experiments show that the proposed algorithm achieves better approximation than the state-of-the-art methods within a variety of time budgets on challenging non-submodular MAP-MRF inference problems.Comment: 21 page

Matrix Game with Payoffs Represented by Triangular Dual Hesitant Fuzzy Numbers

Matrix Game with Payoffs RepresentedDue to the complexity of information or the inaccuracy of decision-makers’ cognition, it is difficult for experts to quantify the information accurately in the decision-making process. However, the integration of the fuzzy set and game theory provides a way to help decision makers solve the problem. This research aims to develop a methodology for solving matrix game with payoffs represented by triangular dual hesitant fuzzy numbers (TDHFNs). First, the definition of TDHFNs with their cut sets are presented. The inequality relations between two TDHFNs are also introduced. Second, the matrix game with payoffs represented by TDHFNs is investigated. Moreover, two TDHFNs programming models are transformed into two linear programming models to obtain the numerical solution of the proposed fuzzy matrix game. Furthermore, a case study is given to to illustrate the efficiency and applicability of the proposed methodology. Our results also demonstrate the advantage of the proposed concept of TDHFNs

A Conflict-Resilient Lock-Free Calendar Queue for Scalable Share-Everything PDES Platforms

Emerging share-everything Parallel Discrete Event Simulation (PDES) platforms rely on worker threads fully sharing the workload of events to be processed. These platforms require efficient event pool data structures enabling high concurrency of extraction/insertion operations. Non-blocking event pool algorithms are raising as promising solutions for this problem. However, the classical non-blocking paradigm leads concurrent conflicting operations, acting on a same portion of the event pool data structure, to abort and then retry. In this article we present a conflict-resilient non-blocking calendar queue that enables conflicting dequeue operations, concurrently attempting to extract the minimum element, to survive, thus improving the level of scalability of accesses to the hot portion of the data structure---namely the bucket to which the current locality of the events to be processed is bound. We have integrated our solution within an open source share-everything PDES platform and report the results of an experimental analysis of the proposed concurrent data structure compared to some literature solutions

An algorithm for the solution of dynamic linear programs

The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation scheme