This paper proposes a new swarm intelligence method known as the Particle-based Simplified Swarm Optimization (PSSO) algorithm while undertaking a modification of the Updating Mechanism (UM), called N-UM and R-UM, and...
详细信息
This paper proposes a new swarm intelligence method known as the Particle-based Simplified Swarm Optimization (PSSO) algorithm while undertaking a modification of the Updating Mechanism (UM), called N-UM and R-UM, and simultaneously applying an Orthogonal Array Test (OA) to solve reliability-redundancy allocation problems (RRAPs) successfully. One difficulty of RRAP is the need to maximize system reliability in cases where the number of redundant components and the reliability of corresponding components in each subsystem are simultaneously decided with nonlinear constraints. In this paper, four REAP benchmarks are used to display the applicability of the proposed PSSO that advances the strengths of both PSO and SSO to enable optimizing the RRAP that belongs to mixed-integer nonlinear programming. When the computational results are compared with those of previously developed algorithms in existing literature, the findings indicate that the proposed PSSO is highly competitive and performs well. (C) 2015 Elsevier Ltd. All rights reserved.
The Steiner Travelling Salesman Problem (STSP) is a variant of the TSP that is suitable for instances defined on road networks. We consider an extension of the STSP in which the road traversal costs are both stochasti...
详细信息
The Steiner Travelling Salesman Problem (STSP) is a variant of the TSP that is suitable for instances defined on road networks. We consider an extension of the STSP in which the road traversal costs are both stochastic and correlated. This happens, for example, when vehicles are prone to delays due to rush hours, road Works or accidents. Following the work of Markowitz on portfolio selection, we model this problem as a bi-objettive mean-variance problem. Then, we show how to approximate the efficient frontier via integerprogramming. We also show how to exploit certain special structures in the correlation matrices. Computational results indicate that our approach is viable for instances with up to 100 nodes. It turns out that minimum variance tours can look rather different from minimum expected cost tours. (C) 2015 Elsevier B.V. All rights reserved.
For functions depending on two variables, we automatically construct triangulations subject to the condition that the continuous, piecewise linear approximation, under-, or overestimation, never deviates more than a g...
详细信息
For functions depending on two variables, we automatically construct triangulations subject to the condition that the continuous, piecewise linear approximation, under-, or overestimation, never deviates more than a given -tolerance from the original function over a given domain. This tolerance is ensured by solving subproblems over each triangle to global optimality. The continuous, piecewise linear approximators, under-, and overestimators, involve shift variables at the vertices of the triangles leading to a small number of triangles while still ensuring continuity over the entire domain. For functions depending on more than two variables, we provide appropriate transformations and substitutions, which allow the use of one- or two-dimensional -approximators. We address the problem of error propagation when using these dimensionality reduction routines. We discuss and analyze the trade-off between one-dimensional (1D) and two-dimensional (2D) approaches, and we demonstrate the numerical behavior of our approach on nine bivariate functions for five different -tolerances.
The reformulation-linearization technique, due to Sherali and Adams, can be used to construct hierarchies of linear programming relaxations of mixed 0-1 polynomial programs. As one moves up the hierarchy, the relaxati...
详细信息
The reformulation-linearization technique, due to Sherali and Adams, can be used to construct hierarchies of linear programming relaxations of mixed 0-1 polynomial programs. As one moves up the hierarchy, the relaxations grow stronger, but the number of variables increases exponentially. We present a procedure that generates cutting planes at any given level of the hierarchy, by optimally weakening linear inequalities that are valid at any given higher level. Computational experiments, conducted on instances of the quadratic knapsack problem, indicate that the cutting planes can close a significant proportion of the integrality gap.
In this study, we consider a capacitated location-multi-allocation-routing problem with population-dependent random travel times. The objective is to find appropriate locations as server locations among the candidate ...
详细信息
In this study, we consider a capacitated location-multi-allocation-routing problem with population-dependent random travel times. The objective is to find appropriate locations as server locations among the candidate locations, allocate the existing population in each demand node to server locations, and determine the movement path of each member to reach its corresponding server with respect to the simultaneous change of the random travel times so that the expected total transportation time is minimized. In our study, the concept of population-dependent random travel times incurs two issues: (1) consideration of some random factors in computing the travel times and (2) impact of the traveling population (presence of people or vehicles) on these random factors simultaneously. Here, three random factors of the time spent in traffic, the number of accidents, and the number of road failures are considered. Also, the capacities of server nodes for servicing the people or vehicles and the capacities of arcs to pass the people or vehicles are assumed to be limited. Defining a linear function for population-dependent random travel time, we formulate the problem as a mixed-integer nonlinear programming model. Also, to investigate the validation and behavior of the proposed random model, several network examples are provided and computational results are analyzed.
For univariate functions, we compute optimal breakpoint systems subject to the condition that the piecewise linear approximator, under-, and over-estimator never deviate more than a given -tolerance from the original ...
详细信息
For univariate functions, we compute optimal breakpoint systems subject to the condition that the piecewise linear approximator, under-, and over-estimator never deviate more than a given -tolerance from the original function over a given finite interval. The linear approximators, under-, and over-estimators involve shift variables at the breakpoints allowing for the computation of an optimal piecewise linear, continuous approximator, under-, and over-estimator. We develop three non-convex optimization models: two yield the minimal number of breakpoints, and another in which, for a fixed number of breakpoints, the breakpoints are placed such that the maximal deviation is minimized. Alternatively, we use two heuristics which compute the breakpoints subsequently, solving small non-convex problems. We present computational results for 10 univariate functions. Our approach computes breakpoint systems with up to one order of magnitude less breakpoints compared to an equidistant approach.
We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination me...
详细信息
We present an algorithm to solve two-stage stochastic convex problems, whose objective function and constraints are nonlinear. It is based on the twin-node-family concept involved in the Branch-and-Fix Coordination method. These problems have 0-1 mixed-integer recourse variables in the first stage and only continuous variables in the second stage. The non-anticipativity constraints are satisfied by means of the twin-node-family strategy. In this work to solve each nonlinear convex subproblem at each node we propose the solution of sequences of quadratic subproblems. Since the convexity of the constraints we can approximate them by means of outer approximations. These methods have been implemented in C with the help of Cplex 12.1, which only solves the quadratic approximations. The test problems have been randomly generated by using a C code developed by this author. Numerical experiments have been performed and its efficiency has been compared with that of well-known codes.
We present a novel heuristic to identify feasible solutions of amixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity t...
详细信息
We present a novel heuristic to identify feasible solutions of amixed-integer nonlinear programming problem arising in natural gas transportation: the selection of new pipelines to enhance the network's capacity to a desired level in a cost-efficient way. We solve this problem in a linear programming based branch-and-cut approach, where we deal with the nonlinearities by linear outer approximation and spatial branching. At certain nodes of the branching tree, we compute a KKT point of a nonlinear relaxation. Based on the information from the KKT point we alter some of the binary variables in a locally promising way exploiting our problem-specific structure. On a test set of real-world instances, we are able to increase the chance of identifying feasible solutions by some order of magnitude compared to standard MINLP heuristics that are already built in the general-purpose MINLP solver SCIP.
This study applies a penalty guided strategy and the orthogonal array test (OA) based on the Simplified Swarm Optimization algorithm (SSO) to solve the reliability redundancy allocation problems (RRAP) in the series s...
详细信息
ISBN:
(纸本)9781479919598
This study applies a penalty guided strategy and the orthogonal array test (OA) based on the Simplified Swarm Optimization algorithm (SSO) to solve the reliability redundancy allocation problems (RRAP) in the series system, the series-parallel system, the complex (bridge) system, and the overspeed protection of gas turbine system. For several decades, the RRAP has been one of the most well known techniques. The maximization of system reliability, the number of redundant components, and the reliability of corresponding components in each subsystem have to be decided simultaneously with nonlinear constraints, acting as one difficulty for the use of the RRAP. In other words, the objective function of the RRAP is the mixed-integerprogramming problem with the nonlinear constraints. The RRAP is of the class of NP-hard. Hence, in this paper, the SSO algorithm is proposed to solve the RRAP and improve computation efficiency for these NP-hard problems. There are four RRAP problems used to illustrate the applicability and the effectiveness of the SSO. The experimental results are compared with previously developed algorithms in literature. Moreover, the maximum-possible-improvement (MPI) is used to measure the amount of improvement of the solution found by the SSO to the previous solutions. According to the results, the system reliabilities obtained by the proposed SSO for the four RRAP problems are as well as or better than the previously best-known solutions.
The pooling problem is a nonconvex nonlinearprogramming problem (NLP) with applications in the refining and petrochemical industries, but also the coal mining industry. The problem can be stated as follows: given a s...
详细信息
ISBN:
(纸本)9780987214355
The pooling problem is a nonconvex nonlinearprogramming problem (NLP) with applications in the refining and petrochemical industries, but also the coal mining industry. The problem can be stated as follows: given a set of raw material suppliers (inputs) and qualities of the supplies, find a cost-minimising way of blending these raw materials in intermediate pools and outputs so as to satisfy requirements on the output qualities. The blending in two stages (in pools and outputs) introduces bilinear constraints. The pooling problem can alternatively be described as a minimum cost network flow problem with additional bilinear constraints to capture the blending of raw materials. In this paper we study a variation of the pooling problem that arises naturally in the coal mining industry and is sometimes referred to as grade targeting. Coal is made-to-order according to customers' desired product qualities. Deviations from these target qualities result in contractually agreed bonuses and penalties. In the pooling problem variation we study, costs are associated with these bonuses and penalties instead of network flows. While in the original pooling problem we have hard bounds on the qualities and unmet demand is penalised in the objective function, in our coal mining variation we have hard demand constraints and deviations from target qualities are penalised. This makes finding a feasible solution easy, while in the pooling problem finding a nontrivial feasible solution that satisfies the quality requirements is already hard. An implication of this is that we are able to solve larger problem instances than those typically studied in the pooling problem literature. To model the coal blending process accurately, we define a time-expanded network where the intermediate pools represent coal stockpiles over time. Since coal is transported in large quantities, we study the trade-off between continuous and discretized flows in coal blending, i.e., solving a continuous flow prob
暂无评论